Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"fmt"
)

func rangeCheck(x, y int) bool {
	if x >= 0 && x <= 9 && y >= 0 && y <= 9 {
		return true
	} else {
		return false
	}
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	paper := make([][]int, 10)
	for i := range paper {
		paper[i] = make([]int, 10)
		for j := range paper[i] {
			paper[i][j] = 0
		}
	}
	// fmt.Println(paper)
	for scanner.Scan() {
		infos := strings.Split(scanner.Text(), ",")
		x, _ := strconv.Atoi(infos[0])
		y, _ := strconv.Atoi(infos[1])
		s, _ := strconv.Atoi(infos[2])
		// fmt.Println(x, y, s)
		switch s {
		case 1:
			paper[x][y]++
			if rangeCheck(x, y-1) {
				paper[x][y-1]++
			}
			if rangeCheck(x, y+1) {
				paper[x][y+1]++
			}
			if rangeCheck(x-1, y) {
				paper[x-1][y]++
			}
			if rangeCheck(x+1, y) {
				paper[x+1][y]++
			}
			continue
		case 2:
			paper[x][y]++
			if rangeCheck(x-1, y-1) {
				paper[x-1][y-1]++
			}
			if rangeCheck(x, y-1) {
				paper[x][y-1]++
			}
			if rangeCheck(x+1, y-1) {
				paper[x+1][y-1]++
			}
			if rangeCheck(x-1, y) {
				paper[x-1][y]++
			}
			if rangeCheck(x+1, y) {
				paper[x+1][y]++
			}
			if rangeCheck(x-1, y+1) {
				paper[x-1][y+1]++
			}
			if rangeCheck(x, y+1) {
				paper[x][y+1]++
			}
			if rangeCheck(x+1, y+1) {
				paper[x+1][y+1]++
			}
			continue
		case 3:
			paper[x][y]++
			if rangeCheck(x-1,y-1) {
				paper[x-1][y-1]++
			}
			if rangeCheck(x,y-1) {
				paper[x][y-1]++
			}
			if rangeCheck(x+1,y-1) {
				paper[x+1][y-1]++
			}
			if rangeCheck(x-1,y) {
				paper[x-1][y]++
			}
			if rangeCheck(x+1,y) {
				paper[x+1][y]++
			}
			if rangeCheck(x-1,y+1) {
				paper[x-1][y+1]++
			}
			if rangeCheck(x,y+1) {
				paper[x][y+1]++
			}
			if rangeCheck(x+1,y+1) {
				paper[x+1][y+1]++
			}
			if rangeCheck(x,y-2) {
				paper[x][y-2]++
			}
			if rangeCheck(x-2,y) {
				paper[x-2][y]++
			}
			if rangeCheck(x+2,y) {
				paper[x+2][y]++
			}
			if rangeCheck(x,y+2) {
				paper[x][y+2]++
			}
			continue
		}
	}
	count := 0
	max := -1
	for i := range paper {
		for j := range paper[i] {
			if paper[i][j] == 0 {
				count++
			}
			if max >= paper[i][j] {
				max = max
			} else {
				max = paper[i][j]
			}
		}
	}
	fmt.Printf("%d\n%d", count, max)
}

C++: #include<iostream>
using namespace std;
void big(int x,int y,int a[10][10]);
void middle(int x,int y,int a[10][10]);
void small(int x,int y,int a[10][10]);
int main(){
	int a[10][10]={0};
	int x,y,s;
	char c;
	int cnt=0,max=0;
	while(cin>>x>>c>>y>>c>>s){
	if(s==3)big(x,y,a);
	else if(s==2)middle(x,y,a);
	else if(s==1)small(x,y,a);
	
	}
	for(int i=0;i<10;i++){
		for(int j=0;j<10;j++){
			if(a[i][j]==0)cnt++;
			if(a[i][j]>max)max=a[i][j];
			//cout<<a[i][j]<<" ";
		}
		//cout<<endl;
	}
	cout<<cnt<<endl<<max<<endl;
}

void big(int x,int y,int a[10][10]){
	a[x][y]++;
	a[x-2][y]++;a[x][y-2]++;
	a[x-1][y]++;a[x][y-1]++;
	a[x+1][y]++;a[x][y+1]++;
	a[x+2][y]++;a[x][y+2]++;	
	a[x+1][y+1]++;a[x-1][y-1]++;
	a[x+1][y-1]++;a[x-1][y+1]++;
	return ;
}

void middle(int x,int y,int a[10][10]){
	a[x][y]++;
	a[x+1][y]++;a[x][y+1]++;
	a[x-1][y]++;a[x][y-1]++;
	a[x+1][y+1]++;a[x-1][y-1]++;
	a[x+1][y-1]++;a[x-1][y+1]++;
}
void small(int x,int y,int a[10][10]){
	a[x][y]++;
	a[x+1][y]++;a[x][y+1]++;
	a[x-1][y]++;a[x][y-1]++;
}

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

int main(){
	int x1[4] = {-1,0,0,1}, y1[4] = {0,1,-1,0};
	int x2[4] = {-1,-1,1,1}, y2[4] = {-1,1,-1,1};
	int x3[4] = {-2,0,0,2}, y3[4] = {0,-2,2,0};
	int p[10][10], x, y, s, nx, ny, maxl = 0, count = 0;
	for(int i = 0;i < 10;i++)
		for(int j = 0;j < 10;j++)p[i][j] = 0;
	char c;
	while(cin >> x >> c >> y >> c >> s){
		
		//cout << x << " " << y << " " << s << endl;
		//if(s == 0)break;
		
		p[y][x]++;
		for(int i = 0;i < 4;i++){
			nx = x + x1[i];ny = y + y1[i];
			if(nx>=0&&nx<10&&ny>=0&&ny<10)p[ny][nx]++;
		}
		if(s > 1){
			for(int i = 0;i < 4;i++){
				nx = x + x2[i];ny = y + y2[i];
				if(nx>=0&&nx<10&&ny>=0&&ny<10)p[ny][nx]++;
			}
			if(s == 3){
				for(int i = 0;i < 4;i++){
					nx = x + x3[i];ny = y + y3[i];
					if(nx>=0&&nx<10&&ny>=0&&ny<10)p[ny][nx]++;
				}
			}
		}
	}
	/*for(int i = 0;i < 10;i++){
		for(int j = 0;j < 10;j++)cout << p[i][j] << " ";
		cout << endl;
	}*/
	for(int i = 0;i < 10;i++){
		for(int j = 0;j < 10;j++){
			maxl = max(maxl, p[i][j]);
			if(!p[i][j])count++;
		}
	}
	cout << count << endl << maxl << endl;
	return 0; 
}

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

using namespace std;

int main() {

	int x, y, ink, blank=0, max=0, m[10][10];
	int mx[]={0, 1, 0, -1, 1, 1, -1, -1, 0, 2, 0, -2};
	int my[]={1, 0, -1, 0, 1, -1, -1, 1, 2, 0, -2, 0};

	for(int i=0; i<10; i++) {
		for(int j=0; j<10; j++) {
			m[i][j]=0;
		}
	}

	while(scanf("%d, %d, %d", &x, &y, &ink)!=EOF) {
		m[x][y]++;
		for(int i=0; i<ink*4; i++) {
			int dx=x+mx[i];
			int dy=y+my[i];
			if(dx>=0&&dx<=9&&dy>=0&&dy<=9)
				m[dx][dy]++;
		}
	}

	for(int x=0; x<10; x++) {
		for(int y=0; y<10; y++) {
			if(m[y][x]==0)
				blank++;
			if(m[y][x]>max)
				max=m[y][x];
		}
	}

	cout << blank << endl << max << endl;

	return 0;

}

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


template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
    if (v.size()) {
        os << v.front();
        for (auto vi = v.begin() + 1; vi != v.end(); vi++)
            os << " " << *vi;
    }
    return os;
}

struct Paper{

    vector<vector <int>> paper;

    Paper() {
        paper = vector<vector <int>>(10, vector<int>(10, 0));
    }

    void display() {
        for (auto line : paper)
            cout << line << endl;
    }

    void output() {
        int max_value = 0;
        int density_zero = 0;

        for (auto y : paper)
            for (auto x : y)
                if (x == 0)
                    density_zero++;
                else
                    max_value = max(max_value, x);
        cout << density_zero << endl;
        cout << max_value << endl;
    }

    void drop(int x, int y, int size)
    {
        switch (size) {
        case 3:
            put(x + 2, y);
            put(x, y + 2);
            put(x - 2, y);
            put(x, y - 2);
        case 2:
            put(x + 1, y + 1);
            put(x + 1, y - 1);
            put(x - 1, y + 1);
            put(x - 1, y - 1);
        case 1:
            put(x + 1, y);
            put(x, y + 1);
            put(x - 1, y);
            put(x, y - 1);
        }

        put(x, y);
    }

private:
    void put(int x, int y)
    {
        if (0 <= x && x < paper[0].size() &&
            0 <= y && y < paper.size())
            paper[y][x]++;
    }
};


int main()
{
    Paper paper;
    char comma;

    for (int x, y, size; cin >> x >> comma >> y >> comma >> size;)
        paper.drop(x, y, size);

    // paper.display();
    paper.output();

    return 0;
}

C++: #define _USE_MATH_DEFINES
#include <iostream>
#include <queue>
#include <vector>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <cctype>
#include <cstdlib>
using namespace std;

#define INF (1 << 20)
#define EPS (1e-10)
#define EQ(a,b) (fabs((a)-(b)) < EPS)

int main(){
	int field[10][10] = {};
	int dx[13] = {0, -1, 0, 1, 0, -1, 1, 1, -1, -2, 0, 2, 0};//5, 9, 13
	int dy[13] = {0, 0, -1, 0, 1, -1, -1, 1, 1, 0, -2, 0, 2};
	int x, y, size;
	char split;
	while (cin >> x >> split >> y >> split >> size) {
		int m = 1 + 4 * size;
		for (int i = 0; i < m; ++i) {
			if (x + dx[i] >= 0 && x + dx[i] < 10 && y + dy[i] >= 0 && y + dy[i] < 10)
				++field[x+dx[i]][y+dy[i]];
		}
	}
	int zero = 0;
	int maxnum = 0;
	for (int i = 0; i < 10; ++i) {
		for (int j = 0; j < 10; ++j) {
			if (field[i][j] == 0) ++zero;
			maxnum = max(maxnum, field[i][j]);
		}
	}
	cout << zero << endl;
	cout << maxnum << endl;

	return 0;
}