19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"CodeViewer"] 1b:I[48988,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"TestCaseDisplay"] 1a:T6ba,#include #include #include using namespace std; int N, K, L, times; int map[102][102]; bool is_snake[102][102]; // left = -1, right = 1; int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; int cur_d; queue> rotates; deque> dq; void init() { cin >> N >> K; for (int i = 0; i < K; i++) { int a, b; cin >> a >> b; map[a][b] = 1; } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; rotates.push({a, b}); } } bool is_valid(int y, int x) { if (y < 1 || y > N) return false; if (x < 1 || x > N) return false; if (is_snake[y][x]) return false; return true; } void move() {} void rotation() { pair cur = rotates.front(); rotates.pop(); if (cur.second ==

제출 #10469

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: