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 <cstdio>
using namespace std;

int board[10][10];
int empty = 0;
int _max = 0;

bool ok(int val) {
    return(val >= 0 && val < 10);
}

void small(int x, int y) {
    board[y][x]++;
    int north = y - 1, south = y + 1,  east = x + 1, west = x - 1;
    if(ok(north)) board[north][x]++;
    if(ok(south)) board[south][x]++;
    if(ok(east))  board[y][east]++;
    if(ok(west))  board[y][west]++;
}

void mid(int x, int y) {
    small(x, y);
    int uprightx = x + 1, uprighty = y + 1;
    int downrightx = x + 1, downrighty = y - 1;
    int downleftx = x - 1, downlefty = y - 1;
    int upleftx = x - 1, uplefty = y + 1;
    if(ok(uprightx) && ok(uprighty)) board[uprighty][uprightx]++;
    if(ok(downrightx) && ok(downrighty)) board[downrighty][downrightx]++;
    if(ok(downleftx) && ok(downlefty)) board[downrighty][downrightx]++;
    if(ok(upleftx) && ok(uplefty)) board[uplefty][upleftx]++;
}

void large(int x, int y) {
    mid(x, y);
    int north = y - 2, south = y + 2,  east = x + 2, west = x - 2;
    if(ok(north)) board[north][x]++;
    if(ok(south)) board[south][x]++;
    if(ok(east))  board[y][east]++;
    if(ok(west))  board[y][west]++;
}

void search() {
    for(int r = 0; r < 10; r++) {
        for(int c = 0; c < 10; c++) {
            if(board[r][c] > _max) _max = board[r][c];
            else if(board[r][c] == 0) empty++;
        }
    }
}

int main(void) {
    int x, y, size;
    
    while(scanf("%d,%d,%d", &x, &y, &size) != EOF) {
        switch(size) {
            case 1: small(x, y); break;
            case 2: mid(x, y);   break;
            default:large(x, y); break;
        }
    }
    search();
    cout << empty << endl << _max << endl;
    return(0);
}

C++: #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>

using namespace std;
int a[14][14];
void drop_ink(int x, int y, int s);

int main()
{
	int count = 0;
	int max = 0;
	for (int i = 0; i < 14; i++) {
		for (int j = 0; j < 14; j++) {
			a[i][j] = 0;
		}
	}
	int x, y, s;
	while (cin >> x >> y >> s) {
		drop_ink(x, y, s);
	}
	for (int i = 2; i <= 11; i++) {
		for (int j = 2; j <= 11; j++) {
			if (a[i][j] == 0) {
				count++;
			}
			if (a[i][j]>max) {
				max = a[i][j];
			}
		}
	}
	cout << count << endl << max << endl;
}

void drop_ink(int x, int y, int s) {
	if (s == 1) {
		a[x + 2][y + 2]++;
		a[x + 2][y + 1]++;
		a[x + 2][y + 3]++;
		a[x + 3][y + 2]++;
		a[x + 1][y + 2]++;
	}
	if (s == 2) {
		drop_ink(x, y, 1);
		a[x + 1][y + 1]++;
		a[x + 1][y + 3]++;
		a[x + 3][y + 1]++;
		a[x + 3][y + 3]++;
	}
	if (s == 3) {
		drop_ink(x, y, 2);
		a[x + 2][y]++;
		a[x + 2][y + 4]++;
		a[x][y + 2]++;
		a[x + 4][y + 2]++;
	}
}

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

using namespace std;

#define XAXIS 10
#define YAXIS 10

int main(){
	int paper[XAXIS][YAXIS];
	int x,y,s;
	int white = 0, most=0;

	//initialize
	for(int i=0; i<XAXIS; i++)
	for(int j=0; j<YAXIS; j++)
		paper[i][j] = 0;

	while(scanf("%d,%d,%d", &x, &y, &s) != EOF){
		switch(s){
			case 3:
				if(x+2 <  XAXIS) paper[x+2][y] += 1; //2 right 
				if(y+2 <  YAXIS) paper[x][y+2] += 1; //2 down
				if(x-2 >= 0)     paper[x-2][y] += 1; //2 left
				if(y-2 >= 0)     paper[x][y-2] += 1; //2 up

			case 2:
				if(x+1 <  XAXIS && y+1 < YAXIS )  paper[x+1][y+1] += 1; //right upper
				if(x+1 <  XAXIS && y-1 > 0)       paper[x+1][y-1] += 1; //right downer
				if(x-1 >= 0     && y+1 < YAXIS )  paper[x-1][y+1] += 1; //left upper
				if(x-1 >= 0     && y-1 < 0)       paper[x-1][y-1] += 1; //left downer

			case 1:
				if(x+1 <  XAXIS) paper[x+1][y] += 1; //right
				if(y+1 <  YAXIS) paper[x][y+1] += 1; //down
				if(x-1 >= 0)     paper[x-1][y] += 1; //left
				if(y-1 >= 0)     paper[x][y-1] += 1; //up
				paper[x][y] += 1;
				break;
		}
	}

	for(int i=0; i<XAXIS; i++)
		for(int j=0; j<YAXIS; j++){
			if(paper[i][j] == 0 )  white++;
			most = max(most,paper[i][j]);
		}

	cout<<white<<endl<<most<<endl;
	return 0;
}

C++: #include <cstdio>

using namespace std;

int paper[10][10];

void dropInk(int ary[][2], int size, int x, int y)
{
        int nx, ny;

        for (int i = 0; i < size; i++) {
                nx = x + ary[i][0];
                ny = y + ary[i][1];
                if (nx >= 0 && ny >= 0) {
                        paper[nx][ny]++;
                }
        }
}

int main()
{
        int sm[5][2] = {{-1, 0}, {1, 0}, {0, -1},
                                   {0, 0}, {0, 1}},
                md[9][2] = {{-1, -1}, {-1, 0}, {-1, 1},
                                   {0, -1}, {0, 0}, {0, 1},
                                   {1, -1}, {1, 0}, {1, 1}},
                lr[13][2] = {{-2, 0}, {-1, -1}, {-1, 0}, {-1, 1},
                                        {0, -2}, {0, -1}, {0, 0}, {0, 1}, {0, 2}                                                      ,
                                        {1, -1}, {1, 0}, {1, 1}, {2, 0}};
        int x, y, s;

        for (int i = 0; i < 10; i++) {
                for (int j = 0; j < 10; j++) {
                        paper[i][j] = 0;
                }
        }
        while (scanf("%d%*c%d%*c%d", &x, &y, &s) != EOF) {
                switch (s) {
                case 1:
                        dropInk(sm, 5, x, y);
                        break;
                case 2:
                        dropInk(md, 9, x, y);
                        break;
                default:
                        dropInk(lr, 13, x, y);
                        break;
                }
        }

        int noInk = 0, most = 0;
        for (int i = 0; i < 10; i++) {
                for (int j = 0; j < 10; j++) {
                        if (!paper[i][j]) {
                                noInk++;
                        }
                        else if (paper[i][j] > most){
                                most = paper[i][j];
                        }
                }
        }
        printf("%d\n%d\n", noInk, most);

        return 0;
}