Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"fmt"
)

func rangeCheck(x, y int) bool {
	if x >= 0 && x <= 9 && y >= 0 && y <= 9 {
		return true
	} else {
		return false
	}
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	paper := make([][]int, 10)
	for i := range paper {
		paper[i] = make([]int, 10)
		for j := range paper[i] {
			paper[i][j] = 0
		}
	}
	fmt.Println(paper)
	for scanner.Scan() {
		infos := strings.Split(scanner.Text(), ",")
		x, _ := strconv.Atoi(infos[0])
		y, _ := strconv.Atoi(infos[1])
		s, _ := strconv.Atoi(infos[2])
		// fmt.Println(x, y, s)
		switch s {
		case 1:
			paper[x][y]++
			if rangeCheck(x, y-1) {
				paper[x][y-1]++
			}
			if rangeCheck(x, y+1) {
				paper[x][y+1]++
			}
			if rangeCheck(x-1, y) {
				paper[x-1][y]++
			}
			if rangeCheck(x+1, y) {
				paper[x+1][y]++
			}
			continue
		case 2:
			paper[x][y]++
			if rangeCheck(x-1, y-1) {
				paper[x-1][y-1]++
			}
			if rangeCheck(x, y-1) {
				paper[x][y-1]++
			}
			if rangeCheck(x+1, y-1) {
				paper[x+1][y-1]++
			}
			if rangeCheck(x-1, y) {
				paper[x-1][y]++
			}
			if rangeCheck(x+1, y) {
				paper[x+1][y]++
			}
			if rangeCheck(x-1, y+1) {
				paper[x-1][y+1]++
			}
			if rangeCheck(x, y+1) {
				paper[x][y+1]++
			}
			if rangeCheck(x+1, y+1) {
				paper[x+1][y+1]++
			}
			continue
		case 3:
			paper[x][y]++
			if rangeCheck(x-1,y-1) {
				paper[x-1][y-1]++
			}
			if rangeCheck(x,y-1) {
				paper[x][y-1]++
			}
			if rangeCheck(x+1,y-1) {
				paper[x+1][y-1]++
			}
			if rangeCheck(x-1,y) {
				paper[x-1][y]++
			}
			if rangeCheck(x+1,y) {
				paper[x+1][y]++
			}
			if rangeCheck(x-1,y+1) {
				paper[x-1][y+1]++
			}
			if rangeCheck(x,y+1) {
				paper[x][y+1]++
			}
			if rangeCheck(x+1,y+1) {
				paper[x+1][y+1]++
			}
			if rangeCheck(x,y-2) {
				paper[x][y-2]++
			}
			if rangeCheck(x-2,y) {
				paper[x-2][y]++
			}
			if rangeCheck(x+2,y) {
				paper[x+2][y]++
			}
			if rangeCheck(x,y+2) {
				paper[x][y+2]++
			}
			continue
		}
	}
	count := 0
	max := -1
	for i := range paper {
		for j := range paper[i] {
			if paper[i][j] == 0 {
				count++
			}
			if max >= paper[i][j] {
				max = max
			} else {
				max = paper[i][j]
			}
		}
	}
	fmt.Printf("%d\n%d", count, max)
}

C++: #include<stdio.h>

int main(void)
{
	int paper[10][10],i,j,size,max=0,w=0;

	for(i=0;i<10;i++)
		for(j=0;j<10;j++)
			paper[i][j]=0;
	
	while(scanf("%d,%d,%d",&i,&j,&size)!=EOF){
			paper[i][j]+=1;
			if(i+1<10)
			paper[i+1][j]+=1;
			if(i-1>=0)
			paper[i-1][j]+=1;
			if(j+1<10)
			paper[i][j+1]+=1;
			if(j-1>=0)
			paper[i][j-1]+=1;
			if(size>1)//サイズが2以上の時に追加
			{
			  if(i+1<10 && j+1<10)
				paper[i+1][j+1]+=1;
			  if(i+1<10 && j-1>=0)
				paper[i+1][j-1]+=1;
			  if(i-1>=0 && j+1<10)
				paper[i-1][j+1]+=1;
			  if(i-1>=0 && j-1>=0)
				paper[i-1][j-1]+=1;
			}
			if(size==3)//サイズが3の時に追加
			{
				if(i+2<10)  
				    paper[i+2][j]+=1;
			    if(i-2>=0)
					paper[i-2][j]+=1;
				if(j+2<10)
					paper[i][j+2]+=1;
				if(j-2>=0)
					paper[i][j-2]+=1;
			}
	}

	for(i=0;i<10;i++){
		for(j=0;j<10;j++){
			if(paper[i][j]==0)
				w++;
			if(paper[i][j]>max)
				max=paper[i][j];
		}
	}
	printf("%d\n",w);
	printf("%d\n",max);
	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 xt = x;
		int yt = y;
		if (size == 1){
			while (xt - 1 < 0)++xt;
			while (yt - 1 < 0)++yt;
			while (xt + 2 > 9)--xt;
			while (yt + 2 > 9)--yt;

			for (int i = yt - 1; i < yt + 2; ++i){
				for (int j = xt - 1; j < xt + 2; ++j){
					tile[i][j] += S[i + 1 - yt][j + 1 - xt];
				}
			}
		}
		if (size == 2){
			while (xt - 1 < 0)++xt;
			while (yt - 1 < 0)++yt;
			while (xt + 2 > 9)--xt;
			while (yt + 2 > 9)--yt;

			for (int i = yt - 1; i < yt + 2; ++i){
				for (int j = xt - 1; j < xt + 2; ++j){
					tile[i][j] += M[i + 1 - yt][j + 1 - xt];
				}
			}

		}
		if (size == 3){
			while (xt - 1 < 0)++xt;
			while (yt - 1 < 0)++yt;
			while (xt + 3 > 9)--xt;
			while (yt + 3  > 9)--yt;

			for (int i = yt - 2; i < yt + 3; ++i){
				for (int j = xt - 2; j < xt + 3; ++j){
					tile[i][j] += L[i + 2 - yt][j + 2 - xt];
				}
			}

		}
	}
	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;

}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
  int a[15][15]={0},b=0,c=0,x,y,t;
  string s[50];
  while(scanf("%d,%d,%d",&x,&y,&t)!=EOF){
    if(t==3){a[x+2][y+2]++;a[x+1][y+2]++;a[x][y+2]++;a[x+3][y+2]++;a[x+4][y+2]++;a[x+2][y+1]++;a[x+2][y]++;a[x+2][y+3]++;a[x+2][y+4]++;a[x+3][y+3]++;a[x+3][y+1]++;a[x+1][y+3]++;a[x+1][y+1]++;}
    if(t==2){a[x+2][y+2]++;a[x+1][y+2]++;a[x+3][y+2]++;a[x+2][y+1]++;a[x+2][y+3]++;a[x+3][y+3]++;a[x+3][y+1]++;a[x+1][y+3]++;a[x+1][y+1]++;}
    else {a[x+2][y+2]++;a[x+1][y+2]++;a[x+3][y+2]++;a[x+2][y+1]++;a[x+2][y+3]++;}
  }
  for(int i=2;i<13;i++){
    for(int j=2;j<13;j++){
      if(!a[i][j])c++;
      b=max(b,a[i][j]);
    }
  }
  cout<<b<<endl<<c<<endl;
}

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

int parse(string a) {
	int s = 0;
	for (int b = 0; b < a.length(); b++) {
		s *= 10;
		s += a[b] - 48;
	}
	return s;
}
vector<int>split(string a) {
	vector<int>s;
	string b = "";
	for (int c = 0; c < a.length(); c++) {
		if (a[c] == ',') { s.push_back(parse(b)); b = ""; }
		else b += a[c];
	}
	s.push_back(parse(b));
	return s;
}
int main() {
	vector<vector<int>>masu(10,vector<int>(10));
	int xp[5]{ -1,0,0,0,1 };
	int yp[5]{0,-1,0,1,0 };
	int xq[13]{ -2,-1,-1,-1,0,0,0,0,0,1,1,1,2 };
	int yq[13]{ 0,-1,0,1,-2,-1,0,1,2,-1,0,1,0 };
	string a;
	while (cin >> a) {
		vector<int>b;
		b = split(a);
		if (b[2] == 1){
			for (int l = 0; l < 5; l++) {
				if (b[0] + xp[l] < 10 && b[0] + xp[l]>-1 && b[1] + yp[l] < 10 && b[1] + yp[l]>-1)masu[b[0] + xp[l]][b[1] + yp[l]]++;
		}
		}
		else if (b[2] == 2) {
			for (int l = b[0] - 1; l < b[0] + 2; l++) {
				for (int r = b[1] - 1; r < b[1] + 2; r++) {
					if (l < 10 && l>-1 && r < 10 && r>-1) masu[l][r]++;
				}
			}
		}
		else {
			for (int l = 0; l < 13; l++) {
				if (b[0] + xq[l] < 10 && b[0] + xq[l]>-1 && b[1] + yq[l] < 10 && b[1] + yq[l]>-1)masu[b[0] + xq[l]][b[1] + yq[l]]++;
			}
		}
	}
	int zero, n;
	zero = n = 0;
	for (auto j : masu) {
		for (int i : j) {
			if (!i)zero++;
			else if (i > n)n = i;
		}
	}
	cout << zero << endl << n << endl;
}