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 <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>

#define rep(i,j,k) for(int i=j;i<k;i++)
#define drep(n,m) for(int i=0;i<n;i++)for(int j=0;j<m;j++)
#define fi first
#define se second
#define vi vector<int>
#define INF 1000000000
#define MOD 1000000009
#define pb push_back
#define mp make_pair
typedef long long ll;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;

ll gcd(ll a,ll b){
    if(a<b){
        int t=a;a=b;b=t;
    }
    int c=a%b;
    while(c!=0){
        a=b;
        b=c;
        c=a%b;
    }
    return b;
}

ll lcm(ll a,ll b){
    return a*b/gcd(a,b);
}

bool isPrime(int x){
    if(x==1)return false;
    if(x==2)return true;
    if(x%2==0)return false;
    for(int i=3;i<=sqrt(x);i+=2){
        if(x%i==0)return false;
    }
    return true;
}

vector<vector<int>> v;
void calc1(int x,int y){
    v[y][x]++;
    rep(i,0,4){
        int nx=x+dx[i],ny=y+dy[i];
        if(0<=nx&&0<=ny&&nx<10&&ny<10)v[ny][nx]++;
    }
}

void calc2(int x,int y){
    v[y][x]++;
    for(int i=-1;i<=1;i++){
        for(int j=-1;j<=1;j++){
            int nx=x+i,ny=y+j;
            if(0<=nx&&0<=ny&&nx<10&&ny<10)v[ny][nx]++;
        }
    }
}

void calc3(int x,int y){
    calc2(x,y);
    rep(i,0,4){
        int nx=x+dx[i]*2,ny=y+dy[i]*2;
        if(0<=nx&&0<=ny&&nx<10&&ny<10)v[ny][nx]++;
    }
    
}
int main() {
    v.resize(10,vector<int>(10,0));
    int x,y,mode;
    char c;
    while(cin>>x>>c>>y>>c>>mode){
        if(mode==1)calc1(x,y);
        else if(mode==2)calc2(x,y);
        else calc3(x,y);
    }
    
    int blank=0,ma=-INF;
    rep(i,0,10){
        rep(j,0,10){
            if(v[i][j]==0)blank++;
            ma=max(ma,v[i][j]);
        }
    }
    cout<<blank<<endl<<ma-1<<endl;
    
  
    return 0;
}

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

enum DropSize {
	DropSize_S = 1,
	DropSize_M,
	DropSize_L
};

struct SinkCell {
	int x, y;
};

SinkCell sinkCellsForSizeS[] = {
	{0,0},{-1,0},{1,0},{0,-1},{0,1}
};
SinkCell sinkCellsForSizeM[] = {
	{-1,-1},{0,-1},{1,-1},{-1,0},{0,0},{1,0},{-1,1},{0,1},{1,1}
};
SinkCell sinkCellsForSizeL[] = {
	{0,-2},{-1,-1},{0,-1},{1,-1},{-2,0},{-1,0},{0,0},{1,0},{2,0},{-1,1},{0,1},{1,1},{0,2}
};

class Paper {
	int width_;
	int height_;
	std::vector<int> depth_;
	void SinkInk(int x, int y) {
		if (0 <= x && x < width_ && 0 <= y && y < height_) {
			++depth_[width_ * x + y];
		}
	}
	template<int count>
	void SinkInkToCells(int x, int y, const SinkCell (&cells)[count]) {
		for (int i = 0; i < count; ++i) {
			SinkInk(x + cells[i].x, y + cells[i].y);
		}
	}
public:
	explicit Paper(int width, int height) : width_(width), height_(height), depth_(width * height, 0)
	{
	}
	void DropInk(int x, int y, DropSize size)
	{
		if (0 <= x && x < width_ && 0 <= y && y < height_) {
			switch (size) {
				case DropSize_S:
					SinkInkToCells(x, y, sinkCellsForSizeS);
					break;
				case DropSize_M:
					SinkInkToCells(x, y, sinkCellsForSizeM);
					break;
				case DropSize_L:
					SinkInkToCells(x, y, sinkCellsForSizeL);
					break;
				default:
					break;
			}
		}
	}
	int Depth(int x, int y) const
	{
		return depth_[width_ * x + y];
	}
private:
};

int main()
{
	const int width = 10;
	const int height = 10;
	Paper paper(width, height);
	int x, y, size;
	while (std::scanf("%d,%d,%d", &x, &y, &size) == 3) {
		paper.DropInk(x, y, static_cast<DropSize>(size));
	}

	int maxDepth = 0;
	int whiteCount = 0;
	for (int x = 0; x < width; ++x) {
		for (int y = 0; y < height; ++y) {
			if (maxDepth < paper.Depth(x, y)) {
				maxDepth = paper.Depth(x, y);
			}
			if (paper.Depth(x, y) == 0) {
				++whiteCount;
			}
		}
	}

	std::printf("%d\n%d\n", whiteCount, maxDepth);

	return 0;
}

C++: #include<cstdio>
#include<algorithm>
using namespace std;
int main(){
	int x, y, s;
	int chess[14][14]={0};
	while(scanf("%d,%d,%d", &x, &y, &s)!=EOF){
		x=x+2;
		y=y+2;
		if(s==1){
			chess[x][y]++;
			chess[x+1][y]++;
			chess[x-1][y]++;
			chess[x][y+1]++;
			chess[x][y-1]++;
		}
		else if(s==2){
			for(int i=x-1; i<=x+1; i++){
				for(int j=y-1; j<=y+1; j++)
					chess[i][j]++;
			}
		}
		else if(s==3){
			for(int i=x-1; i<=x+1; i++){
				for(int j=y-1; j<=y+1; j++)
					chess[i][j]++;
			}
			chess[x][y-2]++;
			chess[x][y+2]++;
			chess[x+2][y]++;
			chess[x-2][y]++;
		}
	}
	int c=0, m=0;
	for(int i=2; i<12; i++){
		for(int j=2; j<12; j++){
			if(chess[i][j]==0)
				c++;
			else{
				m=max(m, chess[i][j]);
			}
		}
	}
	printf("%d\n%d\n", c, m);
	return 0;
}

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

void solve()
{
	int dx[] = {1, 0, -1, 0, 1, 1, -1, -1, 2, 0, -2, 0};
	int dy[] = {0, -1, 0, 1, 1, -1, 1, -1, 0, -2, 0, 2};
	int field[10][10] = {0};
	int x, y, size;
	while(scanf("%d,%d,%d", &x, &y, &size) != EOF)
	{
		++field[x][y];
		int n = 4 * size;
		for(int i = 0; i < n; ++i)
		{
			if((0 <= x + dx[i] && x + dx[i] < 10) && (0 <= y + dy[i] && y + dy[i] < 10))
			{
				++field[x + dx[i]][y + dy[i]];
			}
		}
	}
	int count = 0;
	int max = 0;
	for(int i = 0; i < 10; ++i)
	{
		for(int j = 0; j < 10; ++j)
		{
			if(field[i][j] >= 1)
			{
				++count;
			}
			if(field[i][j] > max)
			{
				max = field[i][j];
			}
		}
	}
	cout << 100 - count << endl;
	cout << max << endl;
}

int main()
{
	solve();
	return(0);
}