#include "network.h"
#include<vector>
using namespace std;
vector<int> node[1000];
void findRoute (int N, int a, int b)
{
int nowPing;
for(int i=1;i<=N;i++)
{
if(i==b) continue;
int res=ping(i,b);
node[res].push_back(i);
if(i==a) nowPing=res;
}
int now=a;
while(nowPing)
{
for(int i=0;i<node[nowPing-1].size();i++)
{
int dest=node[nowPing-1][i];
int res=ping(now,dest);
if(res==0)
{
travelTo(dest);
now=dest;
nowPing--;
break;
}
}
}
travelTo(b);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
133 ms |
5216 KB |
Output is correct |
2 |
Correct |
109 ms |
5216 KB |
Output is correct |
3 |
Correct |
54 ms |
5216 KB |
Output is correct |
4 |
Correct |
66 ms |
5216 KB |
Output is correct |
5 |
Correct |
112 ms |
5216 KB |
Output is correct |
6 |
Correct |
109 ms |
5216 KB |
Output is correct |
7 |
Correct |
0 ms |
5216 KB |
Output is correct |
8 |
Correct |
0 ms |
5216 KB |
Output is correct |
9 |
Correct |
0 ms |
5216 KB |
Output is correct |
10 |
Correct |
0 ms |
5216 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
77 ms |
5216 KB |
Output is correct |
2 |
Correct |
26 ms |
5216 KB |
Output is correct |
3 |
Correct |
112 ms |
5216 KB |
Output is correct |
4 |
Correct |
74 ms |
5216 KB |
Output is correct |
5 |
Correct |
120 ms |
5216 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
117 ms |
5216 KB |
Output is correct |
2 |
Correct |
28 ms |
5216 KB |
Output is correct |
3 |
Correct |
146 ms |
5216 KB |
Output is correct |
4 |
Correct |
58 ms |
5216 KB |
Output is correct |
5 |
Correct |
120 ms |
5216 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
32 ms |
5216 KB |
Output is correct |
2 |
Correct |
25 ms |
5216 KB |
Output is correct |
3 |
Correct |
112 ms |
5216 KB |
Output is correct |
4 |
Correct |
99 ms |
5216 KB |
Output is correct |
5 |
Correct |
146 ms |
5216 KB |
Output is correct |