Submission #30703

# Submission time Handle Problem Language Result Execution time Memory
30703 2017-07-26T07:45:39 Z rondojim Rail (IOI14_rail) C++14
100 / 100
101 ms 892 KB
#include <bits/stdc++.h>
 
using namespace std;
 
#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end(); it++)
typedef long long ll;
typedef pair < int, int > ii;
 
const int inf = 1e9 + 333;
const ll linf = 1e18 + inf;
 
#include "rail.h"
 
const int N = 5000 + 5;
 
ii a[N];
 
void findLocation(int n, int first, int location[], int stype[]) {
	for(int i = 1; i < n; i++) {
		a[i].first = getDistance(0, i);
		a[i].second = i;
	}
	sort(a + 1, a + n);
	int second = a[1].second;
	location[0] = first;
	stype[0] = 1;
	location[second] = first + a[1].first;
	stype[second] = 2;
	int L = 0, R = second;
	set < int > sd, su;
	sd.insert(location[L]);
	su.insert(location[R]);
	for(int it = 2; it < n; it++) {
		int dist = a[it].first;
		int i = a[it].second;
		int distSecond = getDistance(second, i);
		if(dist == distSecond + a[1].first and location[second] - distSecond < first) {
			int distL = getDistance(L, i);
			int p = location[L] + distL;
			type(sd) it = sd.lower_bound(p);
			it--;
			int bef = *it;
			if(location[second] - bef + p - bef == distSecond) {
				location[i] = p;
				stype[i] = 2;
			}
			else {
				location[i] = location[second] - distSecond;
				stype[i] = 1;
				sd.insert(location[i]);
				L = i;
			}
		}
		else {
			int distR = getDistance(R, i);
			int p = location[R] - distR;
			type(su) it = su.upper_bound(p);
			int aft = *it;
			if(aft - first + aft - p == dist) {
				location[i] = p;
				stype[i] = 1;
			}
			else {
				location[i] = first + dist;
				stype[i] = 2;
				su.insert(location[i]);
				R = i;
			}
		}
	}
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 2 ms 616 KB Output is correct
3 Correct 2 ms 616 KB Output is correct
4 Correct 2 ms 616 KB Output is correct
5 Correct 2 ms 616 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 85 ms 836 KB Output is correct
2 Correct 91 ms 836 KB Output is correct
3 Correct 94 ms 876 KB Output is correct
4 Correct 92 ms 876 KB Output is correct
5 Correct 93 ms 876 KB Output is correct
6 Correct 93 ms 876 KB Output is correct
7 Correct 95 ms 876 KB Output is correct
8 Correct 90 ms 876 KB Output is correct
9 Correct 88 ms 876 KB Output is correct
10 Correct 90 ms 876 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 89 ms 876 KB Output is correct
2 Correct 89 ms 876 KB Output is correct
3 Correct 91 ms 876 KB Output is correct
4 Correct 87 ms 876 KB Output is correct
5 Correct 91 ms 876 KB Output is correct
6 Correct 93 ms 876 KB Output is correct
7 Correct 92 ms 876 KB Output is correct
8 Correct 89 ms 876 KB Output is correct
9 Correct 90 ms 876 KB Output is correct
10 Correct 87 ms 876 KB Output is correct
11 Correct 88 ms 876 KB Output is correct
12 Correct 101 ms 876 KB Output is correct
13 Correct 93 ms 876 KB Output is correct
14 Correct 90 ms 876 KB Output is correct
15 Correct 91 ms 876 KB Output is correct
16 Correct 88 ms 876 KB Output is correct
17 Correct 85 ms 876 KB Output is correct
18 Correct 85 ms 876 KB Output is correct
19 Correct 92 ms 876 KB Output is correct
20 Correct 95 ms 892 KB Output is correct