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 <cstdlib>
#include <cstdio>
#include <cstring>
using namespace std;

enum {
    Up,
    UpLeft,
    Left,
    DownLeft,
    Down,
    DownRight,
    Right,
    UpRight,
    DirectionMax
};

int Direction[][2] = {
    {0, -1},  // Up
    {-1, -1}, // UpLeft
    {-1, 0},  // Left
    {-1, 1},  // DownLeft
    {0, 1},   // Down
    {1, 1},   // DownRight
    {1, 0},   // Right
    {1, -1}   // UpRight
};

void DropInk(int paper[10][10], int x, int y, int s);
void Show(const int paper[10][10]);

int main(void) {
    int paper[10][10] = {{}};
    int x, y, s;
    
    while(scanf("%d,%d,%d", &x, &y, &s) != EOF) {
        DropInk(paper, x, y, s);
    }
    
    Show(paper);
}

void DropInk(int paper[10][10], int x, int y, int s) {
// s = 1(small), 2(medium), 3(large)
    int X, Y;
    ++paper[x][y];
    switch(s) {
        case 1 : { // UP, Left, Down, Right
            for(int i = 0; i < DirectionMax; i+=2) {
                X = x + Direction[i][0];
                Y = y + Direction[i][1];
                if(0 <= X && X < 10 && 0 <= Y && Y < 10) {
                    ++paper[X][Y];
                }
            }
            break;
        }
        case 2 : { // All Direction
            for(int i = 0; i < DirectionMax ; ++i) {
                X = x + Direction[i][0];
                Y = y + Direction[i][1];
                if(0 <= X && X < 10 && 0 <= Y && Y < 10) {
                    ++paper[X][Y];
                }
            }
            break;
        }
        case 3 : { // All Direction + a
            for(int i = 0; i < DirectionMax; ++i) {
                X = x + Direction[i][0];
                Y = y + Direction[i][1];
                if(0 <= X && X < 10 && 0 <= Y && Y < 10) {
                    ++paper[X][Y];
                }
                if(i == Up || i == Left || i == Down || i == Right) {
                    X += Direction[i][0];
                    Y += Direction[i][1];
                    if(0 <= X && X < 10 && 0 <= Y && Y < 10) {
                        ++paper[X][Y];
                    }
                }
            }
            break;
        }
    }
}

void Show(const int paper[10][10]) {
    int count0 = 0;
    int dark = 0;
    for(int x = 0; x < 10; ++x) {
        for(int y = 0; y < 10; ++y) {
            if(paper[x][y] == 0) {
                ++count0;
            }
            if(paper[x][y] > dark) {
                dark = paper[x][y];
            }
        }
    }
    cout << count0 << endl;
    cout << dark << endl;
}

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

#define loop(i,a,b) for(int i=(a); i<int(b); i++)
#define rep(i,b) loop(i,0,b)

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
typedef complex<double> vec;

double cross(const vec& a, const vec& b) {
    return imag(conj(a)*b);
}

int dx1[] = {1,0,0,-1}; // tateyoko
int dy1[] = {0,1,-1,0};
int dx2[] = {1,1,-1,-1}; // naname
int dy2[] = {-1,1,-1,1};
inline bool in(int x, int y){
    return 0<=x  && 0<=y && x<10 && y<10;
}
int main(){
    vvi g(10,vi(10));
    int x,y,s;
    while(scanf("%d,%d,%d", &x,&y,&s)!=EOF){
        if(s==3){
            rep(d,4){
                for(int t=1; t<=2; t++){
                    int px=x+dx1[d]*t;
                    int py=y+dy1[d]*t;
                    if(in(px,py)) g[py][px]++;
                }
                int px=x+dx2[d];
                int py=y+dy2[d];
                if(in(px,py)) g[py][px]++;
            }
        }else if(s==2){
            rep(d,4){
                for(int t=1; t<=1; t++){
                    int px=x+dx1[d]*t;
                    int py=y+dy1[d]*t;
                    if(in(px,py)) g[py][px]++;
                }
                int px=x+dx2[d];
                int py=y+dy2[d];
                if(in(px,py)) g[py][px]++;
            }
        }else if(s==1){
            rep(d,4){
                for(int t=1; t<=1; t++){
                    int px=x+dx1[d]*t;
                    int py=y+dy1[d]*t;
                    if(in(px,py)) g[py][px]++;
                }
            }
        }
    }
    int z=0;
    int ans=-1;
    rep(i,10)rep(j,10){
        if(g[i][j]==0)z++;
        ans=max(ans,g[i][j]);
    }
    cout << z << "\n" << ans << endl;
}

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

int f[10][10];
void solve(){

}
int dx[] = {0,1,0,-1,0,1,1,-1,-1,2,0,-2,0};
int dy[] = {0,0,1,0,-1,1,-1,1,-1,0,2,0,-2};
int cnt, d;
void ink(int x, int y, int s){  
  for(int i = 0; i <= 4*s; i++){
    int nx = dx[i] + x;
    int ny = dy[i] + y;
    if(nx < 0 || nx >= 10 || ny < 0 || ny >= 10)continue;  
    f[ny][nx]++;
    if(f[ny][nx] == 1)cnt++;
    d = max(d, f[ny][nx]);
  }
}
int main(){
  int x,y,size;
  cnt = d = 0;
  char c;
  memset(f, 0, sizeof(f));
  while(cin >> x >> c >> y >> c >> size){
    ink(x,y,size);
  }
  cout << 100 - cnt << endl << d << endl;
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)

int xy[10][10];

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

int main(void)
{
    int size, x, y, white, deep;
    while(~scanf("%d,%d,%d", &x, &y, &size))
    {
        if(size >= 1)
        {
            set(x,y);
            set(x,y-1);
            set(x,y+1);
            set(x-1,y);
            set(x+1,y);
        }
        if(size >= 2)
        {
            set(x+1,y+1);
            set(x+1,y-1);
            set(x-1,y+1);
            set(x-1,y+1);
        }
        if(size == 3)
        {
            set(x+2,y);
            set(x-2,y);
            set(x,y+2);
            set(x,y-2);
        }
    }
    
    white = 0;
    deep = 0;
    rep(i,10)
    {
        rep(j,10)
        {
            if(xy[i][j] == 0)
                white++;
            if(deep < xy[i][j])
                deep = xy[i][j];
        }
    }
    
    cout << white << endl << deep << endl;

    return 0;
}