oj.uz

Submission #16048

# Submission time Handle Problem Language Result Execution time Memory
16048 2015-08-10T12:12:40 Z kriii Computer Network (BOI14_network) C++14
0 / 100
 156 ms 5216 KB 
#include "network.h"
#include <vector>
using namespace std;

vector<int> p[1001];
void findRoute (int N, int a, int b)
{
	int dist = ping(a,b) + 1;
	for (int i=1;i<=N;i++) if (i != a){
		p[ping(a,i)+1].push_back(i);
	}

	for (int d=1;d<=dist;d++){
		bool ed = 0;
		for (int i=1;i<p[d].size();i++){
			if (ping(a,p[d][i]) == 0){
				if (d + ping(b,p[d][i]) + 1 == dist){
					travelTo(p[d][i]);
					ed = 1;
					break;
				}
			}
		}
		if (!ed) travelTo(p[d][0]);
	}
}

Subtask #1
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 5216 KB Output is correct
2 Incorrect 144 ms 5216 KB Output isn't correct - Travelling to nonadjacent computer
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 5216 KB Output isn't correct - Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 43 ms 5216 KB Output isn't correct - Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 88 ms 5216 KB Output isn't correct - Travelling to nonadjacent computer
2 Halted 0 ms 0 KB -