competitive-programming/DroppingInk.cpp at master · tangziyi001/competitive-programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
/*
 *	Aizu 0026
 *	Created by Ziyi Tang
 *
 */

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
using namespace std;
#define INF (int)1E9
#define INFL (long)1E18
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pi> vpi;
typedef vector<vpi> vvpi;
const int dir[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};

bool check(int x, int y, int sx, int sy){
	if (x < 0 || x > sx-1 || y < 0 || y > sy-1){
		return false;
	}
	return true;
}

int main(){
	int all[10][10];
	int maxm = 0;
	memset(all,0,sizeof(all));
	string line;
	int count = 0;

	while (getline(cin, line) && line != ""){
		int x,y,sz;

		x = stoi(line.substr(0,1));
		y = stoi(line.substr(2,3));
		sz = stoi(line.substr(4,5));
		if (sz == 1){
			all[x][y] += 1;
			maxm = max(maxm, all[x][y]);
			for(int i = 0; i < 4;i++){
				int tx = x+ dir[i][0];
				int ty = y+ dir[i][1];
				if(check(tx,ty,10,10)){
					all[tx][ty] += 1;
					maxm = max(maxm, all[tx][ty]);
				}
			}
		}
		if (sz == 2){
			for (int i = x-1; i <= x+1; i++){
				for (int j = y-1; j <= y+1; j++){
					if(check(i,j,10,10)){
						all[i][j] += 1;
						maxm = max(maxm, all[i][j]);
					}
				}
			}
		}
		if (sz == 3){
			for (int i = x-1; i <= x+1; i++){
				for (int j = y-1; j <= y+1; j++){
					if(check(i,j,10,10)){
						all[i][j] += 1;
						maxm = max(maxm, all[i][j]);
					}
				}
			}
			if (check(x-2,y,10,10)){
				all[x-2][y] += 1;
				maxm = max(maxm, all[x-2][y]);
			}
			if (check(x+2,y,10,10)){
				all[x+2][y] += 1;
				maxm = max(maxm, all[x+2][y]);
			}
			if (check(x,y-2,10,10)){
				all[x][y-2] += 1;
				maxm = max(maxm, all[x][y-2]);
			}
			if (check(x,y+2,10,10)){
				all[x][y+2] += 1;
				maxm = max(maxm, all[x][y+2]);
			}
		}


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

				if (all[i][j] ==0){
					count++;
				}
			}
		}
	cout << count << endl;
	cout << maxm << endl;


	return 0;
}