#include #include using namespace std; const int dx[4] = { -1, 0, 1, 0 }; const int dy[4] = { 0, 1, 0, -1 }; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int N, Apples, Turns; int board[101][101] = {0}; //1 body, 2 apple cin >> N >> Apples; for (int i = 0; i < Apples; i++) { int x, y; cin >> x >> y; board[x][y] = 2; } queue> q; cin >> Turns; for (int i = 0; i < Turns; i++) { int time; char cDir; cin >> time >> cDir; q.push({ time, cDir }); } //초기화 int time = 0; int curDir = 1; //오른쪽 int postDir = curDir; int hx = 1; int hy = 1; int tx = hx; int ty = hy; board[hx][hy] = 1; int limitTime = q.front().first; char nxtDir = q.front().second; q.pop(); queue dirs; while (time < N * N) { time++; hx += dx[curDir]; hy += dy[curDir]; if (hx <= 0 || hx > N || hy <= 0 || hy > N)//벽에 부딪힘 { //cout << hx << " = " << hy << " " << "\n"; break; } else if(board[hx][hy] == 1)//&&(hx!=tx || hy!=ty)) // 몸에 부딪힘, 꼬리는 해당X { //cout << hx << " == " << hy<< " "<< "\n"; break; } else if (board[hx][hy] == 2) // 사과 있음 { board[hx][hy] = 1; } else//빈칸이나 꼬리랑 같음 { //cout << "여기 들어오잖아\n"; board[hx][hy] = 1; board[tx][ty] = 0; //꼬리 방향 바뀜 int tmpX = tx + dx[postDir]; int tmpY = ty + dy[postDir]; if ((tmpX <= 0 || tmpX > N || tmpY <= 0 || tmpY > N) || board[tmpX][tmpY] == 0 || board[tmpX][tmpY] == 2) { if (!dirs.empty()) { postDir = dirs.front(); dirs.pop(); } } tx += dx[postDir]; ty += dy[postDir]; } if (limitTime == time) { //방향 바꿈 if (nxtDir == 'L')//왼쪽 curDir = ((curDir - 1) + 4) % 4; else if (nxtDir == 'D')//오른쪽 curDir = (curDir + 1) % 4; //cout << "방향바꿈 " << limitTime << " " << nxtDir << "\n"; dirs.push(curDir); //다음 방향 후보 업데이트 if (!q.empty()) { limitTime = q.front().first; nxtDir = q.front().second; q.pop(); } } /*cout << "time : " << time << " limited " << limitTime; cout << "head : " << hx << " : " << hy << "\n"; cout << "tail : " << tx << " : " << ty << "\n"; for (int i = 1; i < N; i++) { for (int j = 1; j < N; j++) cout << board[i][j] << " "; cout << "\n"; }*/ } cout << time; return 0; }

제출 #54696

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: