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 _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <queue>
#include <cmath>
#include <stack>
#include <map>

#define int64 long long int 

using namespace std;
typedef pair<int, int> P;

void ink(P, int, int map[10][10]);

int main()
{
	int map[10][10] = {0};
	int x, y, s, count, max;
	while(scanf("%d,%d,%d", &x, &y, &s) != EOF){
		P p(x, y);
		ink(p, s, map);
	}
	count = max = 0;
	for(int i=0; i<10; i++){
		for(int j=0; j<10; j++){
			if(!map[i][j]) count++;
			if(max < map[i][j]) max = map[i][j];
		}
	}
	cout << count << '\n' << max << '\n';
	return 0;
}

void ink(P p, int s, int map[10][10])
{
	int dx1[4] = {1, 0, -1, 0};
	int dy1[4] = {0, 1, 0, -1};
	int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1};
	int dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
	int dx3[12] = {1, 1, 0, -1, -1, -1, 0, 1, 2, 0, -2, 0};
	int dy3[12] = {0, 1, 1, 1, 0, -1, -1, -1, 0, 2, 0, -2};
	int nx, ny;

	if(s == 1){
		map[p.first][p.second]++;
		for(int i=0; i<4; i++){
			nx = p.first + dx1[i], ny = p.second + dy1[i];
			if(0 <= nx && nx < 10 && 0 <= ny && ny < 10)
				map[nx][ny]++;
		}
	}
	if(s == 2){
		map[p.first][p.second]++;
		for(int i=0; i<8; i++){
			nx = p.first + dx2[i], ny = p.second + dy2[i];
			if(0 <= nx && nx < 10 && 0 <= ny && ny < 10)
				map[nx][ny]++;
		}
	}
	if(s == 3){
		map[p.first][p.second]++;
		for(int i=0; i<12; i++){
			nx = p.first + dx3[i], ny = p.second + dy3[i];
			if(0 <= nx && nx < 10 && 0 <= ny && ny < 10)
				map[nx][ny]++;
		}
	}
	return;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int x[2000][2000], a, b, c, p, sum, maxn; char f;
int main() {
	while (cin >> a >> f >> b >> f >> p) {
		if (p % 2 == 1) {
			c = p / 2 + 1;
			for (int i = -c; i <= c; i++) {
				for (int j = -c; j <= c; j++) {
					if (a + i >= 0 && b + j >= 0) {
						if ((i + j >= -c && i + j <= c) && (i - j >= -c && i - j <= c)) {
							x[a + i][b + j]++;
						}
					}
				}
			}
		}
		else {
			for (int i = -1; i <= 1; i++) {
				for (int j = -1; j <= 1; j++) {
					if (a + i >= 0 && b + j >= 0) {
						x[a + i][b + j]++;
					}
				}
			}
		}
	}
	sum = 0;
	maxn = 0;
	for (int i = 0; i < 10; i++) {
		for (int j = 0; j < 10; j++) {
			if (x[i][j] == 0) { sum++; }
			maxn = max(maxn, x[i][j]);
		}
	}
	cout << sum << endl << maxn << endl;
}

C++: #include <iostream>
using namespace std;

void drop(int x, int y, int xy[][10]){
  if(x>=0 && x<10 && y>=0 && y<10)
    xy[x][y]++;
}

int main(){
  int xy[10][10]={{0}};
  int x,y,size,num=0,ans=0;
  const int small=5, medium=9, big=13;
  char c;

  int s[small][2]={{0,0},{-1,0},{1,0},{0,-1},{0,1}};
  int m[medium][2]={{0,0},{-1,0},{1,0},{0,-1},{0,1},{-1,-1},{-1,1},{1,-1},{1,1}};
  int b[big][2]={{0,0},{-1,0},{1,0},{0,-1},{0,1},{-1,-1},{-1,1},{1,-1},{1,1},{-2,0},{2,0},{0,-2},{0,2}};
  while(cin >> x >> c >> y >> c >> size){
    if(size==1) for(int i=0; i<small; i++) drop(x+s[i][0],y+s[i][1],xy);
    else if(size==2) for(int i=0; i<medium; i++) drop(x+m[i][0],y+m[i][1],xy);
    else for(int i=0; i<big; i++) drop(x+b[i][0],y+b[i][1],xy);
  }

  for(int i=0; i<10; i++)
    for(int j=0; j<10; j++){
      if(xy[i][j]==0) num++;
      if(xy[i][j]>ans) ans = xy[i][j];
    }

  cout << num << endl;
  cout << ans << endl;
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

const int INF = 1e+9 * 2;
double eps = 1e-10;

int H = 10, W = 10;
int size[] = {5, 9, 13};
int dx[] = {0, 1, -1, 0, 0, 1, 1, -1, -1, 2, -2, 0, 0};
int dy[] = {0, 0, 0, 1, -1, 1, -1, 1, -1, 0, 0, 2, -2};

int main() {
	int x, y, s;
	int cnt[16][16] = {0};
	while(scanf("%d,%d,%d", &x, &y, &s) != EOF){
		s--;
		for(int i = 0; i < size[s]; ++i){
			cnt[x + dx[i]][y + dy[i]]++;
		}
	}
			int ans_c = 0, ans_m = 0;
		for(int i = 0; i < 10; ++i){
			for(int j = 0; j < 10; ++j){
				if(cnt[i][j] == 0)
					ans_c++;
				if(cnt[i][j] > ans_m)
					ans_m = cnt[i][j];
			}
		}
		cout << ans_c << endl;
		cout << ans_m << endl;
	return 0;
}

C++: //インクを落とす
#include<cstdio>

using namespace std;

int main(void){
	int pa[14][14];
	int i,j;	//ループカウンタ
	int x,y,size,da=0,not_=0;
	
	//二次元配列の初期化
	for(i=0;i<14;i++){
		for(j=0;j<14;j++)
			pa[i][j]=0;
	}

	while(scanf("%d,%d,%d",&x,&y,&size)!=EOF){
		x=x+2;
		y=y+2;
		switch(size){
			case 1:	//小
				pa[y][x]++;
				pa[y-1][x]++;
				pa[y+1][x]++;
				pa[y][x-1]++;
				pa[y][x+1]++;
				break;
			case 2:	//中
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[y+i][x+j]++;
				}
				break;
			case 3:	//大
				for(i=-1;i<=1;i++){
					for(j=-1;j<=1;j++)
						pa[y+i][x+j]++;
				}
				pa[y-2][x]++;
				pa[y+2][x]++;
				pa[y][x-2]++;
				pa[y][x+2]++;
				break;
		}
	}
	for(i=2;i<12;i++){
		for(j=2;j<12;j++){
			if(pa[i][j]==0)
				not_++;
			if(pa[i][j]>da)
				da=pa[i][j];
		}
	}
	printf("%d\n%d\n",not_,da);

	return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	int a[14][14];
	int i; int ii; int kosuu = 0; int mol = 0;
	for (i = 0; i <= 13; i++){
		for (ii = 0; ii <= 13; ii++){
			a[i][ii] = 0;
		}
	}
	while (!cin.eof()){
		int x = 0; int y = 0; int size = 0;
		cin >> x >> y >> size ;
		int xx = x + 2; int yy = y + 2;

		if (size == 1){
			a[xx][yy] = a[xx][yy] + 1;
			a[xx+1][yy] = a[xx+1][yy] + 1;			a[xx-1][yy] = a[xx-1][yy] + 1;			a[xx][yy+1] = a[xx][yy+1] + 1;			a[xx][yy-1] = a[xx][yy-1] + 1;
		}

		if (size == 2){
			for (i = 0; i <= 2; i++){
				for (i = 0; i <= 2; i++){
					a[xx + i - 1][yy + ii - 1] = a[xx + i - 1][yy + ii - 1] + 1;
				}
			}
		}

		if (size == 3){
			for (i = 0; i <= 2; i++){
				for (i = 0; i <= 2; i++){
					a[xx + i - 1][yy + ii - 1] = a[xx + i - 1][yy + ii - 1] + 1;
				}
			}
			a[xx + 2][yy] = a[xx + 2][yy] + 1;			a[xx - 2][yy] = a[xx - 2][yy] + 1;			a[xx][yy + 2] = a[xx][yy + 2] + 1;			a[xx][yy - 2] = a[xx][yy - 2] + 1;
		}
	}
	for (i = 2; i <= 11; i++){
		for (ii = 2; ii < 11; ii++){
			if (a[i][ii] == 0){
				kosuu = kosuu + 1;
			}
			if (a[i][ii] > mol){
				mol = a[i][ii];
			}
		}
	}
	cout << kosuu << endl;
	cout << mol << endl;


	return  0;
}