Submission #557570

# Submission time Handle Problem Language Result Execution time Memory
557570 2022-05-05T13:19:13 Z Pherokung Rail (IOI14_rail) C++14
30 / 100
84 ms 516 KB
#include<bits/stdc++.h>
#include "rail.h"
using namespace std;

void findLocation(int n, int first, int location[], int stype[]){
	location[0] = first;
	stype[0] = 1;
	
	int mi = 2e9, pos = -1, dis1[5005], dis2[5005];
	for(int i=1;i<=n-1;i++){
		dis1[i] = getDistance(0,i);
		if(dis1[i] < mi){
			mi = dis1[i];
			pos = i;
		}
	}
	
	location[pos] = first + mi;
	stype[pos] = 2;
	
	for(int i=1;i<=n-1;i++){
		if(i == pos) continue;
		dis2[i] = getDistance(pos,i);
		
		if(dis1[i] < dis2[i]){
			location[i] = location[0] + dis1[i];
			stype[i] = 2;
		}
		else{
			location[i] = location[pos] - dis2[i];
			stype[i] = 1;
		}
	} 
	
//	for(int i=0;i<n;i++){
//		printf("{%d %d} ",location[i],stype[i]);
//	}
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 388 KB Output is correct
3 Correct 1 ms 380 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 388 KB Output is correct
10 Correct 1 ms 388 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 76 ms 516 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 84 ms 500 KB Output isn't correct
2 Halted 0 ms 0 KB -