oj.uz

Submission #218279

# Submission time Handle Problem Language Result Execution time Memory
218279 2020-04-01T19:29:24 Z dolphingarlic Computer Network (BOI14_network) C++14
100 / 100
 113 ms 4344 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

network.cpp: In function 'void findRoute(int, int, int)':
network.cpp:7:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
         if(N==b)continue;
         ^~
network.cpp:8:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   d[N]=ping(N,b);
   ^
grader.c: In function 'int main()':
grader.c:48:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d%d%d%d", &N, &a, &b, &M);
     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
grader.c:51:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &distance[u][v]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 4344 KB Output is correct
2 Correct 109 ms 4344 KB Output is correct
3 Correct 102 ms 4216 KB Output is correct
4 Correct 107 ms 4344 KB Output is correct
5 Correct 105 ms 4344 KB Output is correct
6 Correct 103 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 4 ms 512 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 4216 KB Output is correct
2 Correct 32 ms 2428 KB Output is correct
3 Correct 111 ms 4344 KB Output is correct
4 Correct 98 ms 4344 KB Output is correct
5 Correct 111 ms 4344 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 4216 KB Output is correct
2 Correct 30 ms 2296 KB Output is correct
3 Correct 113 ms 4320 KB Output is correct
4 Correct 99 ms 4344 KB Output is correct
5 Correct 112 ms 4236 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 4216 KB Output is correct
2 Correct 39 ms 2400 KB Output is correct
3 Correct 112 ms 4344 KB Output is correct
4 Correct 98 ms 4344 KB Output is correct
5 Correct 111 ms 4344 KB Output is correct