#include #include #include #include #include #define EMPTY 0 #define APPLE 1 #define BODY 2 #define LEFT 0 #define UP 1 #define RIGHT 2 #define DOWN 3 using namespace std; int NextPos[4][2] = { { 0, -1 }, { -1, 0 }, { 0, 1}, { 1, 0 } }; typedef struct Pos { Pos() {} Pos(int y, int x) { this->y = y; this->x = x; } int y; int x; shared_ptr next = nullptr; shared_ptr prev = nullptr; }; typedef struct Command { int time; int dir; }; typedef struct List { shared_ptr Head = nullptr; shared_ptr Tail = nullptr; }; vector> Map; queue q; void Init() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n; cin >> n; for (int i = 0; i < n; i++) { vector temp(n, EMPTY); Map.push_back(temp); } cin >> n; for (int i = 0; i < n; i++) { int y, x; cin >> y >> x; Map[y - 1][x - 1] = APPLE; } cin >> n; for (int i = 0; i < n; i++) { int time; char cmd; cin >> time; cin.ignore(); cin >> cmd; cin.ignore(); q.push(Command{ .time = time, .dir = (cmd == 'L' ? -1 : 1) }); } } bool CanGo(int y, int x) { int size = Map.size(); return (0 <= y && y < size && 0 <= x && x < size && Map[y][x] != BODY); } void Start() { List lst; { auto head = make_shared(); head->x = 0; head->y = 0; auto tail = make_shared(); tail->x = 0; tail->y = 0; lst.Head = head; lst.Tail = tail; tail->next = head; head->prev = tail; } int direction = RIGHT; int dy = NextPos[direction][0]; int dx = NextPos[direction][1]; int time = 0; while (true) { int ny = lst.Head->y + dy; int nx = lst.Head->x + dx; if (CanGo(ny, nx) == false) break; if (Map[ny][nx] == EMPTY) { Map[lst.Tail->y][lst.Tail->x] = EMPTY; if (lst.Tail->next != nullptr) { lst.Tail = lst.Tail->next; lst.Tail->prev = nullptr; } } if (lst.Head->y == lst.Tail->y && lst.Head->x == lst.Tail->x) { lst.Head->y = ny; lst.Head->x = nx; } else { auto newHead = make_shared(ny, nx); auto oldHead = lst.Head; oldHead->next = newHead; newHead->prev = oldHead; lst.Head = newHead; } time++; Map[lst.Head->y][lst.Head->x] = BODY; if (q.empty() == false && q.front().time == time) { direction = (direction + q.front().dir) % 4; dy = NextPos[direction][0]; dx = NextPos[direction][1]; q.pop(); } } cout << time + 1 << endl; } int main() { Init(); Start(); return 0; }

제출 #72370

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: