1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T54f,#include using namespace std; constexpr pair kDelta[] = { {0, 1}, {1, 0}, {0, -1}, {-1, 0}}; bool apples[101][101]; bool snake[101][101]; pair memo[10001]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; while (k--) { int y, x; cin >> y >> x; apples[y][x] = true; } auto mb = memo, me = memo; *me++ = {1, 1}; snake[1][1] = true; int cy = 1, cx = 1, dt = 0; int l, cur = 1; cin >> l; while (l--) { char cmd; int t; cin >> t >> cmd; auto [dy, dx] = kDelta[dt]; for (int i = cur; i < t; i++) { cy += dy, cx += dx; if (!(0 < cy && cy <= n && 0 < cx && cx <= n) || snake[cy][cx]) { cout << i + 1; return 0; } snake[cy][cx] = true; *me++ = {cy, cx}; if (!apples[cy][cx]) { snake[mb->first][mb->second] = false; ++mb; } } dt = (dt + 4 +

제출 #29281

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: