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:T4d4,#include #include #include #include #include using namespace std; struct node { int y; int x; }; int n; vector arr; bool cmp(node a, node b) { if (a.y + a.x < b.y + b.x) return true; if (a.y + a.x > b.y + b.x) return false; return false; } int visited[101]; void bfs(int y, int x) { queue q; q.push({ y, x }); int num = 0; visited[num] = 1; while (!q.empty()) { node now = q.front(); q.pop(); for (int i = 0; i <= n; i++) { node next = arr[i]; int dist = abs(now.y - next.y) + abs(now.x - next.x); if (dist > 1000) continue; if (visited[i + 1] > -1) continue; visited[num + 1] = visited[num] + 1; num++; q.push({ next.y, next.x }); } } } int main() { int t; cin >> t; for (int tc = 1; tc <= t; tc++) { arr.clear(); memset(visited, -1, sizeof(visited)); cin >> n; int sy, sx; int ey, ex; cin >> sy >> sx; for (int i = 0; i < n; i++) { int y

제출 #68044

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: