# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
161867 | 2019-11-05T01:23:12 Z | AQT | 컴퓨터 네트워크 (BOI14_network) | C++14 | 125 ms | 8632 KB |
#include <bits/stdc++.h> #include "network.h" using namespace std; vector<int> dist[1005]; void findRoute(int N, int A, int B){ int D = ping(A, B)+1; for(int n = 1; n<=N; n++){ if(n != A && n != B){ int k = ping(A, B); dist[k+1].push_back(n); } } int crnt = A; for(int d = D-1; d; d--){ int lst = crnt; for(int n : dist[d]){ if(ping(crnt, n) == 0){ crnt = n; travelTo(n); break; } } assert(crnt != lst); } travelTo(B); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 125 ms | 8568 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 112 ms | 8568 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 112 ms | 8632 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 113 ms | 8576 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |