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<algorithm>
using namespace std;
int map[11][11];
int dx[] = { 0, 0, 0, 1, -1, 1, 1, -1, -1, 0, 0, 2, -2 };
int dy[] = { 0, 1, -1, 0, 0, -1, 1, 1, -1, 2, -2, 0, 0 };
int ans;
int total;
void map_make(int x, int y, int size){
	for (int i = 0; i < size * 4 + 1; i++){
		int xx = x + dx[i];
		int yy = y + dy[i];
		if (xx < 0 || xx >= 10 || yy < 0 || yy >= 10) continue;
		map[yy][xx]++;
		ans = max(ans, map[yy][xx]);
		if (map[yy][xx] == 1)total--;
	}
}
int main(){
	int x, y, size;
	char c;
	total = 10 * 10;
	while (cin >> x >> c >> y >> c >> size){
		map_make(x, y, size);
	}
	cout << total << endl;
	cout << ans << endl;
	return 0;
}

C++: #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;

//#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)
#define all(c) c.begin(),c.end()
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);
void sink(vector<vector<int>> &v, int x, int y, int size) {
	v[x][y]++;
	if (x + 1 < 10)v[x + 1][y]++;
	if (0 <= x - 1)v[x - 1][y]++;
	if (y + 1 < 10)v[x][y + 1]++;
	if (0 <= y - 1)v[x][y - 1]++;

	if (size >= 2) {
		if (x + 1 < 10) {
			if (y + 1 < 10)v[x + 1][y + 1]++;
			if (y - 1 >= 0)v[x + 1][y - 1]++;
		}
		if (x - 1 >= 0) {
			if (y + 1 < 10)v[x - 1][y + 1]++;
			if (y - 1 >= 0)v[x - 1][y - 1]++;
		}
	}

	if (size >= 3) {
		if (x + 2 < 10)v[x + 2][y]++;
		if (x - 2 >= 0)v[x - 2][y]++;
		if (y + 2 < 10)v[x][y + 2]++;
		if (y - 2 >= 0)v[x][y - 2]++;
	}
}
signed main() {
	char c; int x, y, s;
	vector<vector<int>>v(10, vector<int>(10, 0));
	while (cin >> x >> c >> y >> c >> s) {
		sink(v, x, y, s);
	}
	int cnt(0);
	int m(0);
	rep(i, 0, 10) {
		rep(j, 0, 10) {
			m = max(m, v[i][j]);
			if (v[i][j] == 0)cnt++;
		}
	}
	cout << cnt << endl << m << endl;
	return 0;
}

C++: 
#include<stdio.h>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>     
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <iomanip>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define roop(a,t) for(int a=0;a<t;a++) 
int grid[14][14];
int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	int u;
	roop(i, 0) { roop(j, 0) { grid[i][j] = 0; } }
	int pow1x[5] = { 0,1,-1,0,0 };
	int pow1y[5] = { 0,0,0,1,-1 };
	int pow2x[9] = { 0,0,0,1,1,1,-1,-1,-1 };
	int pow2y[9] = { -1,0,1,-1,0,1,-1,0,1 };
	int pow3x[13] = { 0 ,0,0,0,0,1,1,1,-1,-1,-1,2,-2 };
	int pow3y[13] = { 2,1,0,-1,-2,1,0,-1,1,0,-1,0,0 };
	int x, y, power;
	char g, h;
	while (cin >> x >> g >> y >> h >> power) {
		
		x += 2; y += 2;
		power = power * 4 + 1;
		if (power == 5) {
			for (int i = 0; i < power; i++) {
				grid[pow1x[i] + x][pow1y[i] + y]++;
			}
		}
		else if (power == 9) {
			for (int i = 0; i < power; i++) {
				grid[pow2x[i] + x][pow2y[i] + y]++;
			}
		}
		else {
			for (int i = 0; i < power; i++) {
				grid[pow3x[i] + x][pow3y[i] + y]++;
			}
		}
	}
	int ans1 = 0;
	int ans2 = 0;
	for (int i = 2; i < 12; i++) {
		for (int j = 2; j < 12; j++) {
			ans2 = max(ans2, grid[i][j]);
			if (grid[i][j] > 0) {
				ans1++;
			}
			/////
			//cout<< grid[i][j]<<" ";
		}//cout<<endl;
	}
	
	cout << 100-ans1 << endl << ans2 << endl;
	return 0;
}

C++: #include <iostream>
#include <list>
#include <string>
#include <sstream>
#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 && i<10)square[i][y] += 1;
    }
    for(i=y-1;i<=y+1;i+=2){
        if(i>=0 && i<10)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 && i<10 && j<10){
                square[i][j] += 1;
            }
        }
    }

}

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 && i<10 && j<10){
                square[i][j] += 1;
            }
        }
    }
}



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);
        
        
        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<stdio.h>
using namespace std;
int main(){
	int a[10][10]={},x,y,size,dumy=0,max=0,ans=0;
	int mx[12]={0,-1,1,0,-1,1,-1,1,0,-2,2,0},my[12]={-1,0,0,1,-1,-1,1,1,-2,0,0,2};
	while(scanf("%d,%d,%d",&x,&y,&size)!=EOF){
		dumy=4*size;
		//cout<<size<<endl;
		for(int i=0;i<dumy;i++){
			if(x+mx[i]>=0&&y+my[i]>=0&&x+mx[i]<10&&y+my[i]<10)
			a[x+mx[i]][y+my[i]]++;
		}
	}
	for(int i=0;i<10;i++){
		for(int j=0;j<10;j++){
			if(a[i][j]==0){
				ans++;
			}else{
				if(max<=a[i][j])
				max=a[i][j];
			}
		}
	}
	cout<<ans<<endl<<max<<endl;
return 0;
}