# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
45097 | 2018-04-11T09:04:43 Z | nibnalin | 컴퓨터 네트워크 (BOI14_network) | C++17 | 197 ms | 14448 KB |
#include <iostream> #include <cstdio> #include <vector> #include "network.h" using namespace std; const int maxn = int(1e3)+5; int D[maxn]; void findRoute (int n, int a, int b) { for(int i = 1;i <= n;i++) { if(i != b) D[i] = ping(b, i)+1; //cout << i << " " << D[0][i] << " " << D[1][i] << "\n"; } int cur = a; while(cur != b) { for(int i = 1;i <= n;i++) { if(D[i] == D[cur]-1 && ping(cur, i) == 0) { travelTo(i); cur = i; break; } } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 130 ms | 4264 KB | Output is correct |
2 | Correct | 133 ms | 4584 KB | Output is correct |
3 | Correct | 106 ms | 4584 KB | Output is correct |
4 | Correct | 115 ms | 4584 KB | Output is correct |
5 | Correct | 105 ms | 4592 KB | Output is correct |
6 | Correct | 107 ms | 4592 KB | Output is correct |
7 | Correct | 2 ms | 4592 KB | Output is correct |
8 | Correct | 2 ms | 4592 KB | Output is correct |
9 | Correct | 2 ms | 4592 KB | Output is correct |
10 | Correct | 2 ms | 4592 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 109 ms | 4676 KB | Output is correct |
2 | Correct | 27 ms | 4676 KB | Output is correct |
3 | Correct | 135 ms | 4676 KB | Output is correct |
4 | Correct | 99 ms | 4676 KB | Output is correct |
5 | Correct | 128 ms | 4704 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 197 ms | 4720 KB | Output is correct |
2 | Correct | 29 ms | 4720 KB | Output is correct |
3 | Correct | 131 ms | 4720 KB | Output is correct |
4 | Correct | 158 ms | 4720 KB | Output is correct |
5 | Correct | 127 ms | 4720 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 112 ms | 4720 KB | Output is correct |
2 | Correct | 40 ms | 4720 KB | Output is correct |
3 | Correct | 127 ms | 8816 KB | Output is correct |
4 | Correct | 95 ms | 10812 KB | Output is correct |
5 | Correct | 125 ms | 14448 KB | Output is correct |