oj.uz

Submission #445368

# Submission time Handle Problem Language Result Execution time Memory
445368 2021-07-17T17:00:48 Z wind_reaper Computer Network (BOI14_network) C++17
100 / 100
 111 ms 7876 KB 
#include <bits/stdc++.h>
#include "network.h"

using namespace std;

int _ping(int u, int v){
	return (u == v ? -1 : ping(u, v));
}

void findRoute(int N, int u, int v){
	int dist[N + 1];
	for(int i = 1; i <= N; i++)
		dist[i] = _ping(v, i);

	int cur = u;
	for(int i = dist[u] - 1; i >= 0; --i)
		for(int j = 1; j <= N; j++){
			if(dist[j] == i && ping(cur, j) == 0){
				travelTo(j);
				cur = j;
				break;
			}
		}

	travelTo(v);
}

Compilation message

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]
   48 |     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]
   51 |             scanf("%d", &distance[u][v]);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 4228 KB Output is correct
2 Correct 103 ms 4224 KB Output is correct
3 Correct 96 ms 4180 KB Output is correct
4 Correct 99 ms 4164 KB Output is correct
5 Correct 98 ms 4300 KB Output is correct
6 Correct 96 ms 4212 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 4104 KB Output is correct
2 Correct 25 ms 2820 KB Output is correct
3 Correct 111 ms 7768 KB Output is correct
4 Correct 93 ms 6080 KB Output is correct
5 Correct 105 ms 7876 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 4140 KB Output is correct
2 Correct 26 ms 2756 KB Output is correct
3 Correct 106 ms 7736 KB Output is correct
4 Correct 95 ms 6212 KB Output is correct
5 Correct 105 ms 7804 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 4220 KB Output is correct
2 Correct 24 ms 2764 KB Output is correct
3 Correct 105 ms 7748 KB Output is correct
4 Correct 91 ms 6124 KB Output is correct
5 Correct 104 ms 7840 KB Output is correct