Go: package main

import (
        "fmt"
)

var paper [10][10]int

func main() {
        var x, y, s int
        for {
                _, err := fmt.Scanf("%d,%d,%d", &x, &y, &s)
                if err != nil {
                        break
                }

                fill(x, y, s)
        }
        var d, z int
        for i := 0; i < 10; i++ {
                for j := 0; j < 10; j++ {
                        if paper[i][j] == 0 {
                                z += 1
                        }
                        if paper[i][j] > d {
                                d += 1
                        }
                }
        }
        fmt.Printf("%d\n%d\n", z, d)
}

func fill(x int, y int, s int) {
        paper[x][y] += 1
        if x > 0 {
                paper[x-1][y] += 1
        }
        if x < 9 {
                paper[x+1][y] += 1
        }
        if y > 0 {
                paper[x][y-1] += 1
        }
        if y < 9 {
                paper[x][y+1] += 1
        }

        if s >= 2 {
                if x > 0 && y > 0 {
                        paper[x-1][y-1] += 1
                }
                if x > 0 && y < 9 {
                        paper[x-1][y+1] += 1
                }
                if x < 9 && y > 0 {
                        paper[x+1][y-1] += 1
                }
                if x < 9 && y < 9 {
                        paper[x+1][y+1] += 1
                }
        }

        if s > 2 {
                if x > 1 {
                        paper[x-2][y] += 1
                }
                if x < 8 {
                        paper[x+2][y] += 1
                }
                if y > 1 {
                        paper[x][y-2] += 1
                }
                if y < 8 {
                        paper[x][y+2] += 1
                }
        }
}

C++: #define _USE_MATH_DEFINES
 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>

using namespace std;

void small(int kami[10][10], int x, int y){
	kami[y][x]++;
	if(x-1>=0){
		kami[y][x-1]++;
	}
	if(x+1<=9){
		kami[y][x+1]++;
	}
	if(y-1>=0){
		kami[y-1][x]++;
	}
	if(y+1<=9){
		kami[y+1][x]++;
	}
}

void middle(int kami[10][10], int x, int y){
	if(x-1>=0 && y-1>=0){
		kami[y-1][x-1]++;
	}
	if(x-1>=0 && y+1<=9){
		kami[y+1][x-1]++;
	}
	if(x+1<=9 && y-1>=0){
		kami[y-1][x+1]++;
	}
	if(x+1<=9 && y+1<=9){
		kami[y+1][x+1]++;
	}
}

void large(int kami[10][10], int x, int y){
	if(x-2>=0){
		kami[y][x-2]++;
	}
	if(x+2<=9){
		kami[y][x+2]++;
	}
	if(y-2>=0){
		kami[y-2][x]++;
	}
	if(y+2<=9){
		kami[y+2][x]++;
	}
}

int main(){
	int kami[10][10]={0};
	char c;
	int x, y, s;

	while( cin>> x >> c >> y >> c >> s ){
		switch( s ){
		case 3:
			large(kami, x, y);
		case 2:
			middle(kami, x, y);
		case 1:
			small(kami, x, y);
		}
	}

	int max = 0;
	int count = 0;
	for(int i=0;i<10;i++){
		for(int j=0;j<10;j++){
			if(kami[i][j]==0){
				count++;
			}else if(max<kami[i][j]){
				max=kami[i][j];
			}
		}
	}

	cout << count << endl;
	cout << max << endl;
	return 0;
}

C++: #include <iostream>

using namespace std;

int main() {
    const int s = 10;
	int paper[10+s+s][10+s+s] = {};
	int x, y, siz;
	char c;
	while (cin >> x >> c >> y >> c >> siz) {
        x += s; y += s;
		switch (siz) {
			case 3:
				paper[y-2][x] ++;
				paper[y][x-2] ++;
				paper[y][x+2] ++;
				paper[y+2][x] ++;
			case 2:
				paper[y-1][x-1] ++;
				paper[y-1][x+1] ++;
				paper[y+1][x-1] ++;
				paper[y+1][x+1] ++;
			case 1:
				paper[y-1][x] ++;
				paper[y][x-1] ++;
				paper[y][x] ++;
				paper[y][x+1] ++;
				paper[y+1][x] ++;
		}
	}
	int empty = 0, mx = 0;
	for (int i=s; i<s+10; ++i) {
		for (int j=s; j<s+10; ++j) {
			empty += !paper[i][j];
			mx = max(mx, paper[i][j]);
		}
	}
	cout << empty << endl;
	cout << mx << endl;

	return 0;
}

C++: #include <iostream>
#include <list>
#include <string>
#include <sstream>
#include <typeinfo>
#include <stdlib.h>
#include <cmath>

using namespace std;

void drip1(int x, int y,int square[10][10]){
    int i;
    for(i=x-1;i<=x+1;i++){
        if(i>=0)square[i][y] += 1;
    }
    for(i=y-1;i<=y+1;i+=2){
        if(i>=0)square[x][i] += 1;
    }
    
}

void drip2(int x, int y,int square[10][10]){
    for(int i=x-1;i<=x+1;i++){
        for(int j=y-1;j<=y+1;j++){
            if(i>=0 && j>=0){
                square[i][j] += 1;
                cout <<"2 " << i << "," << j << endl;
            }
        }
    }

}

void drip3(int x, int y,int square[10][10]){
    
    for(int i=x-2;i<=x+2;i++){
        for(int j=y-2+abs(x-i); j<=y+2-abs(x-i); j++){
            if(i>=0 && j>=0){
                square[i][j] += 1;
                //cout << "3 " << i << "," << j << endl;
            }
        }
    }
}



int main (int argc, char const* argv[]){
    int square[10][10]={};
    int size,x,y, count=0, max=0;
    string str, tmp;
    list<int> xysize;
    
    while(getline(cin,str)){
        stringstream ss(str);
        xysize.clear();
        
        while(getline(ss,tmp,',')){
            xysize.push_back(atoi(tmp.c_str()));
        }
        list<int>::iterator it = xysize.begin();
        x = *(it++);
        y = *(it++);
        size = *(it);
        
        cout << x<< " "<<y <<" "<<size <<endl;
        
        if(size==1){
            drip1(x,y,square);
        }else if(size==2){
            drip2(x,y,square);
        }else if(size==3){
            drip3(x,y,square);
        }
    }
    for(int i=0;i<10;i++){
        for(int j=0;j<10;j++){
            if(square[i][j]==0)count++;
            if(max < square[i][j]) max = square[i][j];
        }
    }

    
    cout << count << endl << max << endl;
    
    return 0;
}

C++: #include <iostream>
#include <cstdio>

using namespace std;

int main() {
	int p[10][10];
	for (int i=0; i<10; i++) {
		for (int j=0; j<10; j++) {
			p[i][j] = 0;
		}
	}
	int x,y,size;
	while (scanf("%d,%d,%d", &x, &y, &size)!=EOF) {
		p[x][y]++;
		if (size==1) {
			if (y-1>=0) p[x][y-1]++;
			if (x-1>=0) p[x-1][y]++;
			if (x+1<10) p[x+1][y]++;
			if (y+1<10) p[x][y+1]++;
		} else if (size==2) {
			if (y-1>=0) p[x][y-1]++;
			if (x-1>=0) p[x-1][y]++;
			if (x+1<10) p[x+1][y]++;
			if (y+1<10) p[x][y+1]++;
			if (x-1>=0&&y-1>=0) p[x-1][y-1]++;
			if (x+1<10&&y-1>=0) p[x+1][y-1]++;
			if (x-1>=0&&y+1<10) p[x-1][y+1]++;
			if (x+1<10&&y+1<10) p[x+1][y+1]++;
		} else if (size==3) {
			if (y-1>=0) p[x][y-1]++;
			if (x-1>=0) p[x-1][y]++;
			if (x+1<10) p[x+1][y]++;
			if (y+1<10) p[x][y+1]++;
			if (x-1>=0&&y-1>=0) p[x-1][y-1]++;
			if (x+1<10&&y-1>=0) p[x+1][y-1]++;
			if (x-1>=0&&y+1<10) p[x-1][y+1]++;
			if (x+1<10&&y+1<10) p[x+1][y+1]++;
			if (y-2>=0) p[x][y-2]++;
			if (x-2>=0) p[x-2][y]++;
			if (x+2<10) p[x+2][y]++;
			if (y+2<10) p[x][y+2]++;
		}
	}
	int c=0,m=0;
	for (int i=0; i<10; i++) {
		for (int j=0; j<10; j++) {
			if (p[i][j] == 0) c++;
			else max(m,p[i][j]);
		}
	}
	cout << c << endl;
	cout << m << endl;
	return 0;
}