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++: #include <iostream>
#include <iomanip>
#include <cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <sstream>
#include <istream>
#include <cmath>
#include <cstdio>

using namespace std;

#define vci vector<int>
#define vcs vector<string>
#define pb push_back
#define sz size()
#define mapii map<int, int>
#define mapci map<char, int>
#define mapsi map<string, int>
#define all(x) x.begin(), x.end()
#define minit(a, i) memset(a, i, sizeof(a));

#define for_(i, a, b) for (int i=(int)a; i<(int)b; i++)
#define for_d(i, a, b) for (int i=(int)a-1; i>=b; i--)
#define for_r(i, a, b, c) for (int i=(int)a; i<(int)b; i += c)
#define for_dr(i, a, b, c) for (int i=(int)a-1; i>=b; i -= c)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

typedef long long ll;

const int iINF = 2147483647;
const ll lINF = 9223372036854775807;

template <class T> inline void dbg(T t) { cout << t << endl; }

int area[10][10];

int main() {
	minit(area, 0);
	
	int x, y, s;
	while (scanf("%d,%d,%d", &x, &y, &s) != -1) {
		area[x][y]++;
		switch (s) {
			case 1:
				if (x-1 >= 0) area[x-1][y]++;
				if (x+1 < 10) area[x+1][y]++;
				if (y-1 >= 0) area[x][y-1]++;
				if (y+1 < 10) area[x][y+1]++;
				break;
			case 2:
				if (x-1 >= 0) {
					area[x-1][y]++;
					if (y-1 >= 0) area[x-1][y-1]++;
					if (y+1 >= 0) area[x-1][y+1]++;
				}
				if (x+1 < 10) {
					area[x+1][y]++;
					if (y-1 >= 0) area[x+1][y-1]++;
					if (y+1 < 10) area[x+1][y+1]++;
				}
				if (y-1 >= 0) area[x][y-1]++;
				if (y+1 < 10) area[x][y+1]++;
				break;
			case 3:
				if (x-1 >= 0) {
					area[x-1][y]++;
					if (y-1 >= 0) area[x-1][y-1]++;
					if (y+1 >= 0) area[x-1][y+1]++;
				}
				if (x+1 < 10) {
					area[x+1][y]++;
					if (y-1 >= 0) area[x+1][y-1]++;
					if (y+1 < 10) area[x+1][y+1]++;
				}
				if (y-1 >= 0) area[x][y-1]++;
				if (y+1 < 10) area[x][y+1]++;
				if (x-2 >= 0) area[x-2][y]++;
				if (x+2 < 10) area[x+2][y]++;
				if (y-2 >= 0) area[x][y-2]++;
				if (y+2 < 10) area[x][y+2]++;
				break;
			default:
				break;
		}
	}
	
	int n0, m;
	for (int i=0; i<10; i++) {
		for (int j=0; j<10; j++) {
			m = max(m, area[i][j]);
			if (area[i][j]==0) n0++;
		}
	}
	
	cout << n0 << endl << m << endl;
	
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <stdio.h>
using namespace std;
int main(){
	int x,y,s,count=0;
	int paper[14][14] = {0};
	while(scanf("%d,%d,%d",&x,&y,&s) != EOF){
		if(s==1 || s==2 || s==3){
			paper[x+2][y+2]++;
			paper[x+1][y+2]++;
			paper[x+3][y+2]++;
			paper[x+2][y+1]++;
			paper[x+2][y+3]++;
		}else if(s==2 || s==3){
			paper[x+1][y+1]++;
			paper[x+1][y+3]++;
			paper[x+3][y+1]++;
			paper[x+3][y+3]++;
		}else if(s==3){
			paper[x+4][y+2]++;
			paper[x+2][y+4]++;
			paper[x][y+2]++;
			paper[x+2][y]++;
		}
	}
	int a = 1;
	for(int i=2;i<12;i++){
		for(int j=2;j<12;j++){
			if(paper[i][j] == 0) count++;
			if(a<paper[i][j]) a = paper[i][j];
		}
	}
	cout<<count<<endl;
	cout<<a<<endl;
	return 0;
}

C++: #include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <array>
#include <stack>
#include <queue>
#include <chrono>
#include <numeric>
#include <memory.h>
#include <map>
#include <math.h>
#include <utility>
#include <set>

#pragma warning(disable:4996)
using namespace std;
#define REP(i,n) for(int i = 0 ; i < n ; ++i)
typedef long long Int;
const double PI = 3.141592653589793238;
const Int INF = 999999999999;
typedef pair<int, int> P;

int S[3][3] = {
		{ 0, 1, 0 },
		{ 1, 1, 1 },
		{ 0, 1, 0 },
};
int M[3][3] = {
		{ 1, 1, 1 },
		{ 1, 1, 1 },
		{ 1, 1, 1 },
};
int L[5][5] = {
		{ 0, 0, 1, 0, 0 },
		{ 0, 1, 1, 1, 0 },
		{ 1, 1, 1, 1, 1 },
		{ 0, 1, 1, 1, 0 },
		{ 0, 0, 1, 0, 0 },
};

int tile[10][10];

int main()
{
	int x, y, size;
	while (scanf("%d,%d,%d", &x, &y, &size) != EOF){
		int a = 0;
		int b = 0;
		int a_ = 0;
		int b_ = 0;
		if (size == 1){
			while (x + a - 1 < 0)++a;
			while (y + b - 1 < 0)++b;
			while (x + 2 + a_ > 10)--a_;
			while (y + 2 + b_ > 10)--b_;

			for (int i = y - 1 + b; i < y + 2 + b_; ++i){
				for (int j = x - 1 + a; j < x + 2 + a_; ++j){
					tile[i][j] += S[i + 1 - y][j + 1 - x];
				}
			}
		}
		if (size == 2){
			while (x + a - 1 < 0)++a;
			while (y + b - 1 < 0)++b;
			while (x + 2 + a_ > 10)--a_;
			while (y + 2 + b_ > 10)--b_;

			for (int i = y - 1 + b; i < y + 2 + b_; ++i){
				for (int j = x - 1 + a; j < x + 2 + a_; ++j){
					tile[i][j] += M[i + 1 - y][j + 1 - x];
				}
			}
		}
		if (size == 3){
			while (x + a - 2 < 0)++a;
			while (y + b - 2 < 0)++b;
			while (x + 3 + a_ > 10)--a_;
			while (y + 3 + b_ > 10)--b_;

			for (int i = y - 2 + b; i < y + 3 + b_; ++i){
				for (int j = x - 2 + a; j < x + 3 + a_; ++j){
					tile[i][j] += L[i + 2 - y][j + 2 - x];
				}
			}
		}
	}
	int white = 0;
	int max_ = -1;

	REP(i, 10){
		REP(j, 10){
			if (!tile[i][j])
				++white;
			max_ = max(tile[i][j], max_);
		}
	}

	cout << white << endl << max_ << endl;

	return 0;

}