# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
218280 | 2020-04-01T19:30:20 Z | dolphingarlic | 컴퓨터 네트워크 (BOI14_network) | C++14 | 118 ms | 4508 KB |
#include"network.h" #include<vector> int d[1001];std::vector<int> f[1001];void findRoute(int N, int a, int b) {for(;N;N--){if(N==b)continue;d[N]=ping(N,b);f[d[N]].push_back(N);}for(N=d[a];N;N--)for(int j:f[N-1])if(!ping(a,j)){travelTo(j);a=j;break;}travelTo(b);}
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 111 ms | 4344 KB | Output is correct |
2 | Correct | 110 ms | 4348 KB | Output is correct |
3 | Correct | 103 ms | 4344 KB | Output is correct |
4 | Correct | 110 ms | 4508 KB | Output is correct |
5 | Correct | 102 ms | 4344 KB | Output is correct |
6 | Correct | 104 ms | 4344 KB | Output is correct |
7 | Correct | 4 ms | 384 KB | Output is correct |
8 | Correct | 4 ms | 384 KB | Output is correct |
9 | Correct | 4 ms | 384 KB | Output is correct |
10 | Correct | 5 ms | 640 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 112 ms | 4344 KB | Output is correct |
2 | Correct | 30 ms | 2304 KB | Output is correct |
3 | Correct | 113 ms | 4348 KB | Output is correct |
4 | Correct | 104 ms | 4344 KB | Output is correct |
5 | Correct | 118 ms | 4344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 112 ms | 4216 KB | Output is correct |
2 | Correct | 30 ms | 2296 KB | Output is correct |
3 | Correct | 116 ms | 4344 KB | Output is correct |
4 | Correct | 99 ms | 4268 KB | Output is correct |
5 | Correct | 115 ms | 4264 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 110 ms | 4316 KB | Output is correct |
2 | Correct | 30 ms | 2296 KB | Output is correct |
3 | Correct | 112 ms | 4348 KB | Output is correct |
4 | Correct | 107 ms | 4344 KB | Output is correct |
5 | Correct | 112 ms | 4344 KB | Output is correct |