oj.uz

Submission #16039

# Submission time Handle Problem Language Result Execution time Memory
16039 2015-08-10T11:40:17 Z hongjun7 Computer Network (BOI14_network) C++
50 / 100
 120 ms 5076 KB 
#include "network.h"
int d[2005];
void findRoute(int N, int a, int b) {
	int dist = ping(a, b);
	for (int i = 1; i <= N; i++) d[i] = 0;
	for (int i = 1; i <= N; i++) {
		if (i != a)
			d[i] = ping(a, i) + 1;
	}
	for (int i = 1; i <= dist; i++) {
		for (int j = 1; j <= N; j++) {
			if (d[j] - d[a] == 1) {
				int v = ping(j, b);
				if (dist == v + d[a] + 1 && ping(a, j) == 0) {
					a = j;
					travelTo(j);
					break;
				}
			}
		}
	}
	travelTo(b);
}

Subtask #1
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 118 ms 5076 KB Output isn't correct - Too many calls to ping
2 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 5076 KB Output is correct
2 Correct 32 ms 5076 KB Output is correct
3 Correct 77 ms 5076 KB Output is correct
4 Correct 98 ms 5076 KB Output is correct
5 Correct 117 ms 5076 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 5076 KB Output is correct
2 Correct 32 ms 5076 KB Output is correct
3 Correct 120 ms 5076 KB Output is correct
4 Correct 103 ms 5076 KB Output is correct
5 Correct 112 ms 5076 KB Output is correct

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 96 ms 5076 KB Output isn't correct - Too many calls to ping
2 Halted 0 ms 0 KB -