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 <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }

void solve() {
  vector<vi32> board(10, vi32(10));

  auto check = [](int x, int y) {
    if (x < 0 || x >= 10 || y < 0 || y >= 10) return false;
    return true;
  };

  int x, y, s;
  char c1, c2;
  while (cin >> x >> c1 >> y >> c2 >> s) {
    if (s == 1) {
      board[x][y]++;
      rep(i, 4) {
        int dx = x + (i - 1) % 2;
        int dy = y + (i - 2) % 2;
        if (!check(dx, dy)) continue;
        board[dx][dy]++;
      }
    } else if (s == 2) {
      for (int i = -1; i <= 1; i++)
      for (int j = -1; j <= 1; j++) {
        int dx = x + i;
        int dy = y + j;
        if (!check(dx, dy)) continue;
        board[dx][dy]++;
      }
    } else {
      for (int i = -2; i <= 2; i++)
      for (int j = -2; j <= 2; j++) {
        if (abs(i) + abs(j) > 2) continue;
        int dx = x + i;
        int dy = y + j;
        if (!check(dx, dy)) continue;
        board[dx][dy]++;
      }
    }
  }

  int empty = 0, ma = 0;
  rep(i, 10) rep(j, 10) amax(ma, board[i][j]);
  rep(i, 10) rep(j, 10) {
    if (board[i][j] == 0) empty++;
  }
  cout << empty << '\n';
  cout << ma << '\n';
}

C++: #include <iostream>
#include<algorithm>
using namespace std;
int map[11][11];
int dx[] = { 0, 0, 0, 1, -1, 1, 1, -1, -1, 0, 0, 2, -2 };
int dy[] = { 0, 1, -1, 0, 0, -1, 1, 1, -1, 2, -2, 0, 0 };
int ans;
int total;
void draw(int x, int y, int size){
	for (int i = 0; i < size * 4 + 1; i++){
		int xx = x + dx[i];
		int yy = y + dy[i];
		if (xx < 0 || xx >= 10 || yy < 0 || yy >= 10) continue;
		map[yy][xx]++;
		ans = max(ans, map[yy][xx]);
		if (map[yy][xx] == 1)total--;
	}
}
int main(){
	int x, y, size;
	char c;
	total = 10 * 10;
	while (cin >> x >> c >> y >> c >> size){
		draw(x, y, size);
	}
	cout << total << endl;
	cout << ans << endl;
	return 0;
}

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


int tile[10][10];
int whtile = 0;
int mxtile = 0;


void paintS(int x, int y){
	int dx[4] = { 1, 0, -1, 0 };
	int dy[4] = { 0, 1, 0, -1 };
	tile[y][x]++;
	for (int i = 0; i < 4; i++){
		int X = x + dx[i];
		int Y = y + dy[i];
		if (0 <= X && X < 10 && 0 <= Y && Y < 10) tile[Y][X]++;
	}
}


void paintM(int x, int y){
	int dx[8] = { 1, 1, 0, -1, -1, -1, 0, 1 };
	int dy[8] = { 0, 1, 1, 1, 0, -1, -1, -1 };
	tile[y][x]++;
	for (int i = 0; i < 8; i++){
		int X = x + dx[i];
		int Y = y + dy[i];
		if (0 <= X && X < 10 && 0 <= Y && Y < 10) tile[Y][X]++;
	}
}


void paintL(int x, int y){
	int dx[12] = { 1, 1, 0, -1, -1, -1, 0, 1, 2, 0, -2, 0 };
	int dy[12] = { 0, 1, 1, 1, 0, -1, -1, -1, 0, 2, 0, -2 };
	tile[y][x]++;
	for (int i = 0; i < 12; i++){
		int X = x + dx[i];
		int Y = y + dy[i];
		if (0 <= X && X < 10 && 0 <= Y && Y < 10) tile[Y][X]++;
	}
}


void paint(int x, int y, int s){
	if (s == 1) paintS(x, y);
	else if (s == 2) paintM(x, y);
	else paintL(x, y);
}


void solve(){
	for (int i = 0; i < 10; i++){
		whtile += count(begin(tile[i]), end(tile[i]), 0);
		mxtile = max(mxtile, *max_element(begin(tile[i]), end(tile[i])));
	}
}


int main(){
	int x, y, s;
	string in;
	while (cin >> in){
		replace(in.begin(), in.end(), ',', ' ');
		stringstream ss;
		ss << in;
		ss >> x >> y >> s;

		paint(x, y, s);
	}

	solve();

	cout << whtile << endl;
	cout << mxtile << endl;

	return 0;
}