白天澜云 • 2天前
#include <bits/stdc++.h>
using namespace std;
int n, m, k, i, j, dt[2001][2001] = {0}, num = 0, ans = 0;
int main() {
cin >> n >> m >> k;
num = m;
for (i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
dt[a][b] = 1;
}
for (i = 1; i <= k; ++i) {
int gy, o;
cin >> gy >> o;
int y = 1, x = gy;
while (1 < n) {
if (y > n)
break;
if (dt[x][y] == 1) {
dt[x][y] = 0;
num--;
if (o == 0)
o = 1;
else
o = 0;
continue;
}
if (o == 0) {
if (x - 1 == 0) {
o = 1;
continue;
}
x--;
y++;
}
if (o == 1) {
if (x + 1 > n) {
o = 0;
continue;
}
x++;
y++;
}
}
}
cout << num;
return 0;
}
评论:
请先登录,才能进行评论