#include #include #include using namespace std; int N,L,K; vector> board; vector dirVec; enum Edir { DIR_RIGHT = 0, DIR_DOWN = 1, DIR_LEFT = 2, DIR_UP = 3, DIR_COUNT }; enum Espin { SPIN_LEFT = 1, SPIN_RIGHT = 2, }; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> N; board.resize(N+1, vector(N+1,0)); dirVec.resize(10'001 , 0); cin >> K; //사과 입력 for (int i=0; i> x >> y; board[x][y] = 1; } //이동 입력 cin >> L; for (int i=0; i < L ; i++) { char dirChar; int time; cin >> time >> dirChar; dirVec[time] = dirChar == 'L' ? (int)SPIN_LEFT : (int)SPIN_RIGHT; } queue> snakePos; // start pos; snakePos.push(make_pair(1,1)); int currentDIr = DIR_RIGHT; int time = 1; while (true) { int nx,ny; //cout << time << currentDIr << "(" << snakePos.front().first << snakePos.front().second << ")\n"; if (currentDIr == (int)DIR_RIGHT) { nx = snakePos.back().first; ny = snakePos.back().second+1; } else if (currentDIr == (int)DIR_LEFT) { nx = snakePos.back().first; ny = snakePos.back().second-1; } else if (currentDIr == (int)DIR_DOWN) { nx = snakePos.back().first+1; ny = snakePos.back().second; } else if (currentDIr == (int)DIR_UP) { nx = snakePos.back().first-1; ny = snakePos.back().second; } //벽에 닿으면 종료 if (nx < 1 || nx > N) {break;} if (ny < 1 || ny > N) {break;} bool found = false; for (int i=0; i < snakePos.size(); i++) { if (snakePos.front().first == nx && snakePos.front().second == ny) { found = true; break; } pair f = snakePos.front(); snakePos.pop(); snakePos.push(f); } if (found) break; snakePos.push(make_pair(nx,ny)); // 해당칸에 사과가 없으면 꼬리 줄이기 if (board[nx][ny] == 0) snakePos.pop(); // 다음 방향 지정하기 if (dirVec[time] == (int)SPIN_LEFT) { currentDIr =((currentDIr - 1) + DIR_COUNT) % DIR_COUNT; } else if (dirVec[time] == (int)SPIN_RIGHT) { currentDIr =(currentDIr + 1) % DIR_COUNT; } time++; } cout << time; }

제출 #131388

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: