# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
70405 | 2018-08-22T19:42:02 Z | Googal | 컴퓨터 네트워크 (BOI14_network) | C++14 | 187 ms | 32372 KB |
#include <iostream> #include <vector> #include "network.h" using namespace std; const int NMAX = 1e2; vector < int > p[1 + NMAX]; void findRoute (int n, int a, int b) { int dist = ping(a, b); for(int i = 1; i <= n; i++) if (i != a) p[ping(a, i) + 1].push_back(i); for(int d = 1; d <= dist; d++) { bool ok = false; for(int i = 1; i < p[d].size(); i++) { if(ping(a, p[d][i]) == 0) { if(d + ping(p[d][i], b) == dist) { a = p[d][i]; travelTo(a); ok = true; break; } } } if (ok == false) { a = p[d][0]; travelTo(a); } } travelTo(b); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 187 ms | 12212 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 106 ms | 14744 KB | Output is correct |
2 | Correct | 29 ms | 14744 KB | Output is correct |
3 | Runtime error | 134 ms | 19156 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 139 ms | 21676 KB | Output is correct |
2 | Correct | 29 ms | 21676 KB | Output is correct |
3 | Runtime error | 125 ms | 25960 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 121 ms | 28256 KB | Output is correct |
2 | Correct | 31 ms | 28256 KB | Output is correct |
3 | Runtime error | 138 ms | 32372 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
4 | Halted | 0 ms | 0 KB | - |