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++: #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#ifdef __GXX_EXPERIMENTAL_CXX0X__
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

#include <array>

using namespace std;

int data[10][11] = {};

int main ()
{
	int a , b , c;
	char d;
	while( cin >> a >> d >> b >> d >> c )
	{
		if( c == 1 )
		{
			if( a - 1 >= 0 )
			{
				data[a - 1][b]++;
				data[a - 1][b + 1]--;
			}
			data[a][max ( b - 1 , 0 )]++;
			data[a][min ( b + 2 , 10 )]--;
			if( a + 1 < 10 )
			{
				data[a + 1][b]++;
				data[a + 1][b + 1]--;
			}
		} else if( c == 2 )
		{
			if( a - 1 >= 0 )
			{
				data[a - 1][max ( b - 1 , 0 )]++;
				data[a - 1][min ( b + 2 , 10 )]--;
			}
			data[a][max ( b - 1 , 0 )]++;
			data[a][min ( b + 2 , 10 )]--;
			if( a + 1 < 10 )
			{
				data[a + 1][max ( b - 1 , 0 )]++;
				data[a + 1][min ( b + 2 , 10 )]--;
			}
		} else
		{
			if( a - 2 >= 0 )
			{
				data[a - 2][b]++;
				data[a - 2][b + 1]--;
			}
			if( a - 1 >= 0 )
			{
				data[a - 1][max ( b - 1 , 0 )]++;
				data[a - 1][min ( b + 2 , 10 )]--;
			}
			data[a][max ( b - 2 , 0 )]++;
			data[a][min ( b + 3 , 10 )]--;
			if( a + 1 < 10 )
			{
				data[a + 1][max ( b - 1 , 0 )]++;
				data[a + 1][min ( b + 2 , 10 )]--;
			}
			if( a + 2 < 10 )
			{
				data[a + 2][b]++;
				data[a + 2][b + 1]--;
			}
		}
	}
	int ans1 = 0 , ans2 = 0;
	for( size_t i = 0; i < 10; i++ )
	{
		for( size_t j = 1; j < 11; j++ )
		{
			data[i][j] += data[i][j - 1];
			if( data[i][j] == 0 )
			{
				ans1++;
			}
			if( ans2 < data[i][j] )
			{
				ans2 = data[i][j];
			}
		}
	}
	cout << ans1 << endl << ans2 << endl;
}

C++: #include <bits/stdc++.h>
using namespace std;
 
int cnt[10][10];
 
int main() {
    int x, y, s; char c;
    while(cin >> x >> c >> y >> c >> s) {
        for(int i = 0; i < 10; i ++)
            for(int j = 0; j < 10; j ++)
                if(s == 2) {
                    if(abs(x - i) <= 1 && abs(y - j) <= 1)
                        cnt[i][j] ++;
                } else {
                    if(abs(x - i) + abs(y - j) <= s / 2 + 1)
                        cnt[i][j] ++;
                }
    }
    auto a = (int*)cnt;
    cout << count(a, a + 100, 0) << '\n';
    cout << *max_element(a, a + 100) << '\n';
    return 0;
}

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

using namespace std;
constexpr int paper_w=10,paper_h=10;
constexpr int ink_w=5,ink_h=5;
int inkarea[3][ink_h][ink_w]={
  0,0,0,0,0,
  0,0,1,0,0,
  0,1,1,1,0,
  0,0,1,0,0,
  0,0,0,0,0,

  0,0,0,0,0,
  0,1,1,1,0,
  0,1,1,1,0,
  0,1,1,1,0,
  0,0,0,0,0,

  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 main(){
  int paper[paper_h][paper_w]={0};
  int x,y,size;
  char c;
  while(cin>>x>>c>>y>>c>>size){
    for(int i=0;i<ink_h;i++){
      for(int j=0;j<ink_w;j++){
        int ink_x=x+j-2,ink_y=y+i-2;
        if(ink_y<0||paper_h<=ink_y||ink_x<0||paper_w<=ink_x)
          continue;
        paper[ink_y][ink_x]+=inkarea[size-1][i][j];
      }
    }
  } 
  int white=0,density=0;
  for(int i=0;i<paper_h;i++){
    for(int j=0;j<paper_w;j++){
      if(!paper[i][j])
        white++;
      if(density<paper[i][j])
        density=paper[i][j];
    }
  }
  cout<<white<<endl;
  cout<<density<<endl;

}

C++: #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>

typedef long long ll;
using namespace std;


void paint(int cell[10][10],int x, int y, int size,int *maxC){
	if(size == 3){
		for(int i=x-2;i<=x+2;i++){
			for(int j=y-2;j<=y+2;j++){
				if(sqrt(pow((double)i-(double)x,2.0) + pow((double)j-(double)y,2.0)) <= 2.0){
					if(i >=0 && i< 10 && j>= 0&& j<10){
						cell[j][i]++;
						*maxC = max(cell[j][i],*maxC);
					}
				}
			}
		}
	}

	if(size == 2){
		for(int i=x-1;i<=x+1;i++){
			for(int j=y-1;j<=y+1;j++){
				if(i >=0 && i< 10 && j>= 0&& j<10){
					cell[j][i]++;
					*maxC = max(cell[j][i],*maxC);
				}
			}
		}
	}

	if(size == 1){
		for(int i=-1;i<=1;i++){
			for(int j=-1;j<=1;j++){
				if(abs(i*j) == 1) continue;
				if(i >=0 && i< 10 && j>= 0&& j<10){
					cell[y+i][x+j]++;
					*maxC = max(cell[y+i][x+j],*maxC);
				}
			}
		}
	}
}

int main()
{
	int cell[10][10];
	fill((int*)cell,(int*)cell+10*10,0);
	string str;
	int maxC=0;
	int count=0;
	while(getline(cin,str,',')){
		string str2;

		getline(cin,str2,',');
		string str3;

		getline(cin,str3);		
		paint(cell,str[0]-'0',str2[0]-'0',str3[0]-'0',&maxC);
		
	}
	for(int i=0;i<10;i++) for(int j=0;j<10;j++) count += cell[i][j] == 0 ? 1 : 0;
	cout << count << endl;
	cout << maxC << endl;
}