oj.uz

Submission #106297

# Submission time Handle Problem Language Result Execution time Memory
106297 2019-04-17T19:46:44 Z Kepperoni Rail (IOI14_rail) C++14
8 / 100
 83 ms 512 KB 
#include "rail.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll MAXN = 5000 + 10;

ll dist[MAXN];
int ind[MAXN];

void findLocation(int N, int first, int location[], int stype[])
{
	stype[0] = 1;
	location[0] = first;
	for(int i=1; i<N; i++){
		dist[i] = getDistance(0, i);
		ind[i] = i;
	}

	sort(ind, ind+N, [](int fi, int se){return dist[fi] < dist[se];});

	int cc = 0, cd = ind[1];		
	stype[cd] = 2;
	location[cd] = first + dist[cd];

	for(int i=2; i<N; i++){
		int ci = ind[i];
		ll distc = getDistance(cc, ci);		
		ll distd = getDistance(cd, ci);		

		if(distc > distd){
			stype[ci] = 1;
			location[ci] = location[cd] - distd;
			if(distd > location[cd] - location[cc])
				cc = ci;
		} else {
			stype[ci] = 2;
			location[ci] = location[cc] + distc;
			if(distc > location[cd] - location[cc])
				cd = ci;
		}
	}
}

Subtask #1
8.0 / 8.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 73 ms 512 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 460 KB Output isn't correct
2 Halted 0 ms 0 KB -