#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}; void printA() { cout << "\nprint a\n"; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cout << a[i][j] << ' '; } cout << '\n'; } cout << "=========================\n\n"; } 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() { // cout << " move!! : " << y << ',' << x; 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); // cout << " -> " << ny << ',' << nx ; 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; } // cout << '\n'; return { y, x }; } }; vector sharks; void fight(int s1, int s2) { if (sharks[s1].sizes > sharks[s2].sizes) { sharks[s2].die = true; a[sharks[s1].y][sharks[s1].x] = s1; } else { sharks[s1].die = true; a[sharks[s2].y][sharks[s2].x] = s2; } } int main() { cin >> n >> m >> shark_cnt; // vector sharks(shark_cnt + 1); 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++) { // cout << "position of fisher: " << fisher_pos << '\n'; // cout << "check dying shark: "; // for (int i = 1; i <= shark_cnt; i++) { // if (sharks[i].die) cout << i << ' '; // } // cout << '\n'; // 상어 잡기 for (int row = 1; row <= n; row++) { int shark_index = a[row][fisher_pos]; // cout << " catch? -> " << shark_index << '\n'; if (shark_index && !sharks[shark_index].die) { // cout << " catch position: " << row << ' ' << fisher_pos << '\n'; catch_size += sharks[shark_index].sizes; sharks[shark_index].die = true; break; } } // 상어 이동 vector>> new_positions; for (int i = 1; i <= shark_cnt; i++) { if (sharks[i].die) continue; cout << " shark" << i << " "; a[sharks[i].y][sharks[i].x] = 0; auto next_pos = sharks[i].move(); new_positions.push_back( { i, next_pos } ); // 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 // cout << "fight!! " << i << " vs " << shark_index << '\n'; // if (sharks[i].sizes > already.sizes) { // already.die = true; // cout << " shark" << shark_index << " eaten\n"; // // a[next_pos.first][next_pos.second] = i; // } else { // cout << " shark" << i << " eaten\n"; // sharks[i].die = true; // a[next_pos.first][next_pos.second] = shark_index; // } // } } for (auto p : new_positions) { int shark_idx = p.first; auto pos = p.second; int already_idx = a[pos.first][pos.second]; if (already_idx) fight(shark_idx, already_idx); else a[sharks[shark_idx].y][sharks[shark_idx].x] = shark_idx; } // printA(); } cout << catch_size; }

제출 #57730

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: