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>
#include <climits>
using namespace std;

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

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];
            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<vector>
#include<algorithm>
#include<stdio.h>
int main(){
	int x,y,size;
	std::vector<std::vector<int> > vec(10,std::vector<int>(10,0));
	while(scanf("%d,%d,%d",&x,&y,&size)!=EOF){
		vec[y][x]++;
		vec[y-1][x]++;
		vec[y+1][x]++;
		vec[y][x-1]++;
		vec[y][x+1]++;
		if(size>=2){
			vec[y-1][x-1]++;
			vec[y-1][x+1]++;
			vec[y+1][x-1]++;
			vec[y+1][x+1]++;
		}
		if(size==3){
			vec[y-2][x]++;
			vec[y+2][x]++;
			vec[y][x-2]++;
			vec[y][x+2]++;
		}
	}
	std::vector<int> vec2(100);
	for(int i=0;i<10;i++){
		for(int j=0;j<10;j++)vec2[i*10+j]=vec[i][j];
	}
	int no=0,max=0;
	for(int i=0;i<100;i++){
		if(vec2[i]==0)no++;
		if(max<vec2[i])max=vec2[i];
	}
	std::cout<<no<<std::endl;
	std::cout<<max<<std::endl;
	/*sort(vec2.begin(),vec2.end(),std::greater<int>());
	std::cout<<vec2[0]<<std::endl;*/
	return 0;
}

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


using namespace std;
#define LENGTH 10

bool isDropEnabled(int x, int y){
  if(0<=x && x<LENGTH && 0<=y && y<LENGTH){
    return true;
  }else{
    return false;
  }
}
 



int main(){
  int x, y, size;
  char c;
  int density[LENGTH][LENGTH];
  for(int i=0;i<LENGTH;i++){
    for(int j=0;j<LENGTH;j++){
      density[i][j]=0;
    }
  }
  
  while(cin >> x >> c >> y >> c >> size){
    if(size==1){
      for(int i=-1;i<2;i++){
	for(int j=-1;j<2;j++){
	  if(isDropEnabled(x+i, y+j) && ((i+j)%2==1 || i==j==0)){
	    density[x+i][y+j]++;
	  }
	}
      }
    }

    if(size==2){
      for(int i=-1;i<2;i++){
	for(int j=-1;j<2;j++){
	  if(isDropEnabled(x+i, y+j)){
	    density[x+i][y+j]++;
	  }
	}
      }
    }

    if(size==3){
      for(int i=-2;i<3;i++){
	for(int j=-2;j<3;j++){
	  if(isDropEnabled(x+i, y+j) && (abs(i)+abs(j) <=2)){
	    density[x+i][y+j]++;
	  }
	}
      }
    }
  }
    
  //
  int empty=0;
  int max=0;
  for(int i=0;i<LENGTH;i++){
    for(int j=0;j<LENGTH;j++){
      if(density[i][j]==0){
	empty++;
      }else if(max < density[i][j]){
	max = density[i][j];
      }
    }
  }
  cout << empty << " " << max << endl;
  
}

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

int main()
{
    int wp[14][14]={0};
    int x,y,s;
    while(scanf("%d,%d,%d",&x,&y,&s)!=EOF)
    {
        if(s==1){
            int dx[5]={-1,1,0,0,0},dy[5]={0,0,1,-1,0};
            for(int i=0;i<5;++i){
                wp[x+2+dx[i]][y+2+dy[i]]+=1;
            }
        }
        if(s==2){
            int dx[9]={-1,1,0,0,0,-1,-1,1,1},dy[9]={0,0,1,-1,0,-1,1,-1,1};
            for(int i=0;i<9;++i){
                wp[x+2+dx[i]][y+2+dy[i]]+=1;
            }
        }
        if(s==3){
            int dx[13]={-1,1,0,0,0,-1,-1,1,1,0,0,2,-2},dy[13]={0,0,1,-1,0,-1,1,-1,1,-2,2,0,0};
            for(int i=0;i<13;++i){
                wp[x+2+dx[i]][y+2+dy[i]]+=1;
            }
        }
    }
    int wc=0,mdc=0;
    for(int i=2;i<12;++i){
        for(int j=2;j<12;++j){
            if(!wp[i][j])wc++;
            if(wp[i][j]>mdc)mdc=wp[i][j];
        }
    }
    cout<<wc<<endl<<mdc<<endl;
    return 0;
}

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


int main(){
	int vx[]={ 0, 1,-1, 0, 0,-1,-1, 1, 1, 2,-2, 0, 0};
	int vy[]={ 0, 0, 0, 1,-1,-1, 1,-1, 1, 0, 0, 2,-2};
	int x,y,size;
	int map[10][10];
	for(int i=0;i<10;i++){
		for(int j=0;j<10;j++){
			map[i][j]=0;
		}
	}
	
	int nm_ans=0,max_ans=0;
	
	while(scanf("%d,%d,%d",&x,&y,&size)!=EOF){
		switch(size){
		case 1:
			for(int i=0;i<5;i++){
				if(min(x+vx[i],y+vy[i])>0){
					map[x+vx[i]][y+vy[i]]++;
				}
			}
			break;
		case 2:
			for(int i=0;i<9;i++){
				if(min(x+vx[i],y+vy[i])>0){
					map[x+vx[i]][y+vy[i]]++;
				}
			}
			break;
		case 3:
			for(int i=0;i<13;i++){
				if((min(x+vx[i],y+vy[i])>=0)&&max(x+vx[i],y+vy[i])<10){
					map[x+vx[i]][y+vy[i]]++;
				}
			}
			break;
		}
	}
	
	
	
	for(int i=0;i<10;i++){
		for(int j=0;j<10;j++){
			if(map[i][j]>max_ans){
				max_ans=map[i][j];
			}
			if(map[i][j]==0){
				nm_ans++;
			}
		}
	}
	cout<<nm_ans<<endl;
	cout<<max_ans<<endl;
	return 0;
}