oj.uz

Submission #354328

# Submission time Handle Problem Language Result Execution time Memory
354328 2021-01-21T18:20:33 Z Mefarnis Rail (IOI14_rail) C++14
30 / 100
 83 ms 620 KB 
#include <bits/stdc++.h>
#include "rail.h"
#define maxn 5000
using namespace std;

void findLocation(int n, int loc0, int loc[], int type[]) {
	loc[0] = loc0;
	type[0] = 1;
	int dist[n];
	if(n > 1) {
		int closest = -1;
		for( int i = 1 ; i < n ; i++ ) {
			dist[i] = getDistance(0,i);
			if(closest == -1 || dist[i] < dist[closest])
				closest = i;
		}
		int locc = loc[closest] = loc0 + dist[closest];
		type[closest] = 2;
		for( int i = 1 ; i < n ; i++ )
			if(i != closest) {
				int dic = getDistance(i,closest);
				if(dist[i] < dic) {
					loc[i] = loc0 + dist[i];
					type[i] = 2;
				}
				else {
					loc[i] = locc - dic;
					type[i] = 1;
				}
			}
	}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 83 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Incorrect 83 ms 620 KB Output isn't correct
2 Halted 0 ms 0 KB -