#include using namespace std; int R, C, M, r, c, s, d, z, res; int dy[] = { -1, 1, 0, 0 }; int dx[] = { 0, 0, 1, -1 }; struct fish { int r, c, s, d, z; }; vector f; int mp[102][102]; int get_fish(int here) { int size = 0; for (int i = 0; i < f.size(); ++i) { if (f[i].c == here) { size = f[i].z; mp[f[i].r][f[i].c] = 0; f.erase(f.begin() + i); break; } } return size; } void fish_move() { map, fish> new_map; for (auto& a : f) { mp[a.r][a.c] = 0; int speed = a.s; if (a.d == 0 || a.d == 1) speed %= (2 * (R - 1)); else speed %= (2 * (C - 1)); for (int i = 0; i < speed; ++i) { if (a.d == 0 && a.r == 0) a.d = 1; else if (a.d == 1 && a.r == R - 1) a.d = 0; else if (a.d == 2 && a.c == C - 1) a.d = 3; else if (a.d == 3 && a.c == 0) a.d = 2; a.r += dy[a.d]; a.c += dx[a.d]; } if (new_map.count({ a.r, a.c }) == 0 || new_map[{a.r, a.c}].z < a.z) { new_map[{a.r, a.c}] = a; } } f.clear(); for (auto it : new_map) { f.push_back(it.second); mp[it.second.r][it.second.c] = 1; } } void fish_check() { map, fish> new_map; for (auto& a : f) { if (new_map.count({ a.r, a.c }) == 0 || new_map[{a.r, a.c}].z < a.z) { new_map[{a.r, a.c}] = a; } } f.clear(); for (auto it : new_map) { f.push_back(it.second); mp[it.second.r][it.second.c] = 1; } } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> R >> C >> M; for (int i = 0; i < M; ++i) { cin >> r >> c >> s >> d >> z; r--, c--, d--; f.push_back({ r, c, s, d, z }); mp[r][c] = 1; } int player = -1; while (player < C - 1) { player++; res += get_fish(player); fish_move(); fish_check(); } cout << res; }

제출 #33387

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: