#include #include #include using namespace std; struct info { int idx; int y; int x; int speed; int dir; int size; bool live; }; struct compare { bool operator()(info left, info right)const { if (left.size < right.size) { return true; } else { return false; } } }; priority_queue, compare>map[102][102]; int sharkMap[102][102]; vectorshark; int y, x, sharkCnt; int point = 0; int dy[5] = { 0,-1,1,0,0 }; int dx[5] = { 0,0,0,1,-1 }; void printShark(int turn) { for (int i = 0; i < 102; ++i) { for (int j = 0; j < 102; ++j) { sharkMap[i][j] = 0; } } for (int i = 0; i < shark.size(); i++) { int idx = shark[i].idx; int y = shark[i].y; int x = shark[i].x; bool live = shark[i].live; if (live == 1) { sharkMap[y][x] = idx; } } cout << "Turn : " << turn << endl; cout << "==================================" << endl; for (int i = 1; i < y; ++i) { for (int j = 1; j < x; ++j) { cout << sharkMap[i][j] << " "; } cout << endl; } cout << "==================================" << endl; } void initMap() { for (int i = 0; i < 102; ++i) { for (int j = 0; j < 102; ++j) { map[i][j] = priority_queue, compare>(); } } } void initVar() { shark.clear(); } void input() { cin >> y >> x >> sharkCnt; y++; x++; //initMap(); initVar(); shark.push_back({ 0,0,0,0,-1, 0,false }); int r, c, d, s, z; for (int i = 1; i <= sharkCnt; i++) { cin >> r >> c >> s >> d >> z; info tmp; tmp.idx = i; tmp.y = r; tmp.x = c; tmp.dir = d; tmp.speed = s; tmp.size = z; tmp.live = true; shark.push_back(tmp); } } int reverseDir(int dir) { if (dir == 1)return 2; if (dir == 2)return 1; if (dir == 3)return 4; if (dir == 4)return 3; } void setShark() { for (int i = 0; i < shark.size(); i++) { int idx = shark[i].idx; int y = shark[i].y; int x = shark[i].x; int speed = shark[i].speed; int dir = shark[i].dir; int size = shark[i].size; bool live = shark[i].live; if (live) { map[y][x].push({ idx, y, x, speed, dir, size, live }); } } } int catchShark(int x) { for (int i = 1; i < y; i++) { if (map[i][x].size() > 0) { return map[i][x].top().idx; } } return 0; } void moveShark() { for (int idx = 1; idx < shark.size(); idx++) { int cy = shark[idx].y; int cx = shark[idx].x; int speed = shark[idx].speed; int dir = shark[idx].dir; int live = shark[idx].live; if (live) { if (dir == 1 || dir == 2) { int height = y - 2; if (speed >= height * 2) { speed = speed % height; } } else if (dir == 3 || dir == 4) { int width = x - 2; if (speed >= width * 2) { speed = speed % width; } } for (int i = 0; i < speed; i++) { int ny = cy + dy[dir]; int nx = cx + dx[dir]; if (ny < 1 || nx < 1 || ny >= y || nx >= x) { dir = reverseDir(dir); ny = cy + dy[dir]; nx = cx + dx[dir]; } cy = ny; cx = nx; } shark[idx].y = cy; shark[idx].x = cx; shark[idx].dir = dir; } } } void eatShark() { for (int i = 1; i < y; i++) { for (int j = 1; j < x; j++) { // map에 한마리 이상의 상어가 존재할 시 if (map[i][j].size() > 1) { int idx = map[i][j].top().idx; int y = map[i][j].top().y; int x = map[i][j].top().x; int speed = map[i][j].top().speed; int dir = map[i][j].top().dir; int size = map[i][j].top().size; bool live = map[i][j].top().live; while (!map[i][j].empty()) { int tmp_idx = map[i][j].top().idx; shark[tmp_idx].live = false; map[i][j].pop(); } shark[idx].live = true; map[i][j].push({ idx, y, x, speed, dir, size, live }); } } } } int main(void) { input(); //printShark(0); //initMap(); setShark(); for (int i = 1; i < x; i++) { int catched = catchShark(i); shark[catched].live = false; point += shark[catched].size; //cout << shark[catched].size << endl; moveShark(); initMap(); setShark(); eatShark(); //printShark(i); } cout << point; return 0; }

제출 #54902

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: