#include #include using namespace std; int n, m, shark_cnt, a[105][105]; // a에 컴포넌트 : 상어의 index: 1 ~ int dy[] = {0, -1, 1, 0, 0}; int dx[] = {0, 0, 0, 1, -1}; struct Shark { int index, y, x, speed, direction, sizes; bool die = false; Shark() {} Shark(int r, int c, int s, int d, int z) : y(r), x(c), speed(s), direction(d), sizes(z) {} pair move() { int dis = speed; while (dis > 0) { int ny = max(min(y + dy[direction] * dis, n), 1); int nx = max(min(x + dx[direction] * dis, m), 1); dis -= max(abs(ny - y), abs(nx - x)); y = ny; x = nx; if (direction == 1 && y == 1) direction = 2; else if (direction == 2 && y == n) direction = 1; else if (direction == 3 && x == m) direction = 4; else if (direction == 4 && x == 1) direction = 3; } return { y, x }; } }; vector sharks; int main() { cin >> n >> m >> shark_cnt; sharks.resize(shark_cnt + 1); for (int i = 1; i <= shark_cnt; i++) { int r, c, s, d, z; cin >> r >> c >> s >> d >> z; Shark shark(r, c, s, d, z); sharks[i] = shark; a[r][c] = i; } int catch_size = 0; for (int fisher_pos = 1; fisher_pos <= m; fisher_pos++) { // 상어 잡기 for (int row = 1; row <= n; row++) { int shark_index = a[row][fisher_pos]; if (shark_index && !sharks[shark_index].die) { catch_size += sharks[shark_index].sizes; sharks[shark_index].die = true; break; } } // 상어 이동 for (int i = 1; i <= shark_cnt; i++) { if (sharks[i].die) continue; pair origin_pos = { sharks[i].y, sharks[i].x }; auto next_pos = sharks[i].move(); if (origin_pos == next_pos) continue; a[origin_pos.first][origin_pos.second] = 0; int shark_index = a[next_pos.first][next_pos.second]; a[next_pos.first][next_pos.second] = i; if (shark_index && shark_index != i) { Shark &already = sharks[shark_index]; // fight if (sharks[i].sizes > already.sizes) { already.die = true; } else { sharks[i].die = true; a[next_pos.first][next_pos.second] = shark_index; } } } } cout << catch_size; }

제출 #57696

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: