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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
| #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &a){
T w=1; a=0;
char ch=getchar();
for(;ch < '0' || ch > '9';ch=getchar()) if(ch == '-') w=-1;
for(;ch>='0'&&ch<='9';ch=getchar()) a=(a<<3)+(a<<1)+(ch^48);
a*=w;
}
template <typename T> inline void ckmax(T &a, T b){a = a > b ? a : b;}
template <typename T> inline void ckmin(T &a, T b){a = a < b ? a : b;}
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define Debug(x) cout << #x << " = " << x << endl
#define For(i,l,r) for (int i = l; i <= r; ++i)
#define foR(i,l,r) for (int i = l; i >= r; --i)
#define mck insert
#define era erase
const int N = 10;
int n, m;
int Id (int x, int y) { return (x - 1) * n + y; }
set <int> emp;
int val[N][N], res[N][N];
pii gra[N * N];
inline void cache () {
For (i, 1, n) For (j, 1, n)
res[i][j] = val[i][j];
}
inline bool diff () {
For (i, 1, n) For (j, 1, n)
if (res[i][j] != val[i][j]) return true;
return false;
}
inline void upd (int k, int v) {
int top = 0;
for (auto x : emp) {
top++;
if (top == k) {
val[gra[x].fi][gra[x].se] = v;
emp.era(x);
break;
}
}
}
inline void Mckenna (int x, int y, int fx, int fy) {
val[x][y] = val[fx][fy];
emp.era(Id(x, y));
emp.mck(Id(fx, fy));
val[fx][fy] = 0;
}
inline void move (int to) {
if (to == 0) {
For (i, 1, n - 1) For (j, 1, n) {
if (!val[i][j])
For (k, i + 1, n)
if (val[k][j]) {
Mckenna(i, j, k, j);
break;
}
}
}
if (to == 1) {
foR (i, n, 2) For (j, 1, n) {
if (!val[i][j]) {
foR (k, i - 1, 1)
if (val[k][j]) {
Mckenna(i, j, k, j);
break;
}
}
}
}
if (to == 2) {
For (j, 1, n - 1) For (i, 1, n) {
if (!val[i][j])
For (k, j + 1, n)
if (val[i][k]) {
Mckenna(i, j, i, k);
break;
}
}
}
if (to == 3) {
foR (j, n, 2) For (i, 1, n) {
if (!val[i][j])
foR (k, j - 1, 1)
if (val[i][k]) {
Mckenna(i, j, i, k);
break;
}
}
}
}
int tmp;
inline void merge (int to) {
if (to == 0) {
For (i, 1, n - 1) For (j, 1, n) {
if (val[i][j] == val[i + 1][j] && val[i][j]) {
tmp += val[i][j] * 2;
val[i + 1][j] = 0;
val[i][j] *= 2;
emp.mck(Id(i + 1, j));
}
}
}
if (to == 1) {
foR (i, n, 2) For (j, 1, n) {
if (val[i][j] == val[i - 1][j] && val[i][j]) {
tmp += val[i][j] * 2;
val[i - 1][j] = 0;
val[i][j] *= 2;
emp.mck(Id(i - 1, j));
}
}
}
if (to == 2) {
For (j, 1, n - 1) For (i, 1, n) {
if (val[i][j] == val[i][j + 1] && val[i][j]) {
tmp += val[i][j] * 2;
val[i][j + 1] = 0;
val[i][j] *= 2;
emp.mck(Id(i, j + 1));
}
}
}
if (to == 3) {
foR (j, n, 2) For (i, 1, n) {
if (val[i][j] == val[i][j - 1] && val[i][j]) {
tmp += val[i][j] * 2;
val[i][j - 1] = 0;
val[i][j] *= 2;
emp.mck(Id(i, j - 1));
}
}
}
}
inline void print () {
For (i, 1, n) {
For (j, 1, n) cout << val[i][j] << " ";
puts("");
}
puts("");
}
int main() {
read(n); read(m);
For (i, 1, n) For (j, 1, n)
emp.mck(Id(i, j)), gra[Id(i,j)] = mp(i, j);
int x, y, v;
read(x), read(y), read(v);
emp.era(Id(x, y)); val[x][y] = v;
read(x), read(y), read(v);
emp.era(Id(x, y)); val[x][y] = v;
int Ans1 = 0, Ans2 = 0;
For (i, 1, m) {
int d, k, v; read(d); read(k); read(v);
cache();
move(d);
tmp = 0;
merge(d);
move(d);
Ans2 += tmp;
if ( diff () ) Ans1++;
else break;
int r = emp.size();
upd (1 + (k % r), v);
}
printf ("%d\n%d", Ans1, Ans2);
return 0;
}
|
