#include #include #include using namespace std; const int dx[5] = {0, -1, 1, 0, 0}; const int dy[5] = {0, 0, 0, 1, -1}; struct sharkinfo { int r, c, s, d, z; }; // index 1부터 시작! int main(){ int R, C, M; cin >> R >> C >> M; vector shark(M); vector> map(R + 1, vector(C + 1)); for (int m = 0; m < M; m++) { cin >> shark[m].r >> shark[m].c >> shark[m].s >> shark[m].d >> shark[m].z; } int weight = 0; for (int j = 1; j <= C; j++) { sharkinfo target = {R + 1, 0, 0, 0, 0}; int index = -1; for (int m = 0; m < M; m++) { if (shark[m].c == j && shark[m].r < target.r) { target = shark[m]; index = m; } } if (index != -1) { weight += target.z; shark.erase(shark.begin() + index); M--; } for (int n = 0; n < M; n++) { int speed = shark[n].s; int dist; if (shark[n].r == 1 && shark[n].d == 1) shark[n].d = 2; if (shark[n].r == R && shark[n].d == 2) shark[n].d = 1; if (shark[n].c == C && shark[n].d == 3) shark[n].d = 4; if (shark[n].c == 1 && shark[n].d == 4) shark[n].d = 3; if (shark[n].d == 1 || shark[n].d == 2) { if ((speed / (R - 1)) % 2 == 0) { shark[n].r += (speed % (2 * (R - 1))) * dx[shark[n].d]; } else { shark[n].r += (speed % (2 * (R - 1))) * dx[shark[n].d]; shark[n].d = 3 - shark[n].d; } } else { if ((speed / (C - 1)) % 2 == 0) { shark[n].c += (speed % (2 * (C - 1))) * dy[shark[n].d]; } else { shark[n].c += (speed % (2 * (C - 1))) * dy[shark[n].d]; shark[n].d = 7 - shark[n].d; } } } for (int n = 0; n < M; n++) { for (int already = n + 1; already < M; already++) { if (shark[n].r == shark[already].r && shark[n].c == shark[already].c) { if (shark[n].z > shark[already].z) { shark.erase(shark.begin() + already); M--; already--; continue; } else { shark.erase(shark.begin() + n); M--; n--; if (n == -1) break; already--; continue; } } } } } cout << weight << "\n"; return 0; }

제출 #54651

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: