#include #include #include #include using namespace std; int r, c, m; map> SharkInfo; // id -> (x, y, v, d, s) int dx[5] = {0, -1, 1, 0, 0}; int dy[5] = {0, 0, 0, 1, -1}; void moveSharks() { map> moved; for (auto& [id, info] : SharkInfo) { auto [x, y, v, d, s] = info; int period = (d == 1 || d == 2) ? 2 * (r - 1) : 2 * (c - 1); if (period != 0) v %= period; for (int i = 0; i < v; ++i) { int nx = x + dx[d]; int ny = y + dy[d]; if (nx < 0 || nx >= r || ny < 0 || ny >= c) { if (d == 1) d = 2; else if (d == 2) d = 1; else if (d == 3) d = 4; else if (d == 4) d = 3; nx = x + dx[d]; ny = y + dy[d]; } x = nx; y = ny; } moved[id] = {x, y, v, d, s}; } map, pair> pos_map; // {x, y} -> {size, id} map> updated; for (auto& [id, info] : moved) { auto [x, y, v, d, s] = info; pair pos = {x, y}; if (!pos_map.count(pos) || pos_map[pos].first < s) { pos_map[pos] = {s, id}; updated[id] = info; } } SharkInfo = updated; } int main() { cin >> r >> c >> m; for (int i = 0; i < m; ++i) { int rs, cs, vs, ds, ss; cin >> rs >> cs >> vs >> ds >> ss; SharkInfo[i] = {rs - 1, cs - 1, vs, ds, ss}; } int ANS = 0; for (int fisher = 0; fisher < c; ++fisher) { int catchId = -1, minX = r; for (auto& [id, info] : SharkInfo) { int x = get<0>(info); int y = get<1>(info); if (y == fisher && x < minX) { minX = x; catchId = id; } } if (catchId != -1) { ANS += get<4>(SharkInfo[catchId]); SharkInfo.erase(catchId); } moveSharks(); } cout << ANS; return 0; }

제출 #51928

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: