#include #include #include #include using namespace std; struct shk { int x; int y; int s; int d; int z; int live = 1; }; vector v[5]; int a, b, c; int ans; shk shark[10001]; int map[101][101]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> a >> b >> c; for (int i = 1; i < c + 1; i++) { int x, y, s, d, z; cin >> x >> y >> s >> d >> z; shark[i].x = x; shark[i].y = y; shark[i].s = s; shark[i].d = d; shark[i].z = z; map[x][y] = i; } for (int i = a; i > 1; i--) v[1].push_back(i); for (int i = 1; i < a; i++) v[1].push_back(i); for (int i = 1; i < a + 1; i++) v[2].push_back(i); for (int i = a - 1; i > 1; i--) v[2].push_back(i); for (int i = 1; i < b + 1; i++) v[3].push_back(i); for (int i = b - 1; i > 1; i--) v[3].push_back(i); for (int i = b; i > 1; i--) v[4].push_back(i); for (int i = 1; i < b; i++) v[4].push_back(i); for (int i = 1; i < b + 1; i++) { //tame shark for (int j = 1; j < a + 1; j++) { if (map[j][i]) { shark[map[j][i]].live = 0; ans += shark[map[j][i]].z; break; } } //move shark for (int j = 1; j < c + 1; j++) { if (shark[j].live == 0) continue; int t; if (shark[j].d == 1) { shark[j].x -= a; shark[j].x -= shark[j].s; shark[j].x *= -1; t = shark[j].x / (a); shark[j].x %= (a * 2 - 2); shark[j].x = v[1][shark[j].x]; if (t % 2 == 1) shark[j].d = 2; } else if (shark[j].d == 2) { shark[j].x += (shark[j].s) - 1; if (shark[j].x > a - 1) t = (shark[j].x - 1) / a; else t = 0; shark[j].x %= (a * 2 - 2); shark[j].x = v[2][shark[j].x]; if (t % 2 == 1) shark[j].d = 1; } else if (shark[j].d == 3) { shark[j].y += shark[j].s - 1; if (shark[j].y > b - 1) t = (shark[j].y - 1) / b; else t = 0; shark[j].y %= (b * 2 - 2); shark[j].y = v[3][shark[j].y]; if (t % 2 == 1) shark[j].d = 4; } else if (shark[j].d == 4) { shark[j].y -= b; shark[j].y -= shark[j].s; shark[j].y *= -1; t = shark[j].y / (b); shark[j].y %= (b * 2 - 2); shark[j].y = v[4][shark[j].y]; if (t % 2 == 1) shark[j].d = 3; } } for (int j = 1; j < a + 1; j++) { for (int k = 1; k < b + 1; k++) map[j][k] = 0; } //eat shark for (int j = 1; j < c + 1; j++) { if (!shark[j].live) continue; int x = shark[j].x; int y = shark[j].y; if (!map[x][y]) map[x][y] = j; else { if (shark[map[x][y]].z < shark[j].z) { shark[map[x][y]].live = 0; map[x][y] = j; } else shark[j].live = 0; } } } cout << ans; return 0; }

제출 #112736

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: