oj.uz

Submission #159893

# Submission time Handle Problem Language Result Execution time Memory
159893 2019-10-25T09:54:33 Z oolimry Rail (IOI14_rail) C++14
100 / 100
 160 ms 1016 KB 
#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
void findLocation(int N, int first, int location[], int stype[])
{
	typedef pair<int,int> ii;
	int n = N;
	vector<ii> order;
	int zeroDist[n];
	zeroDist[0] = 0;
	for(int i = 1;i < n;i++){
		zeroDist[i] = getDistance(i,0);
		order.push_back(ii(zeroDist[i],i));
	}
	sort(order.begin(),order.end());
	int a = order[0].second;
	int aDist[n];
	aDist[a] = 0;
	for(int i = 0;i < n;i++){
		if(i == a) continue;
		aDist[i] = getDistance(i,a);
	}
	
	int dd = order[0].first;
	stype[0] = 1;
	stype[a] = 2;
	location[0] = first;
	location[a] = first + dd;
	int second = first + dd;
	int l = 0;
	int r = a;
	map<int,int> mm;
	mm[first] = 1;
	mm[first+dd] = 2;
	for(int k = 1;k < (int) order.size();k++){
		int u = order[k].second;
		//cout << u << "\n";
		///left of a
		if(zeroDist[u] == aDist[u] + dd){
			///corner case, in between 0 and a
			if(aDist[u] < dd){
				stype[u] = 1;
				location[u] = location[a] - aDist[u];
				mm[location[u]] = stype[u];
			}
			///upwards
			else{
				int kk = getDistance(l,u);
				int x = kk - aDist[u] + aDist[l];
				x /= 2;
				int pos = location[l] + x;
				//cout << u << " " << pos << "\n";
				if(mm[pos] == 1){
					location[u] = location[l] + kk;
					stype[u] = 2;
					mm[location[u]] = stype[u];
				}
				else{
					location[u] = second - aDist[u];
					stype[u] = 1;
					mm[location[u]] = stype[u];
					l = u;
				} 
			}
		}
		else{
			int kk = getDistance(r,u);
			int x = kk - zeroDist[u] + zeroDist[r];
			x /= 2;
			int pos = location[r] - x;
			//cout << u << " " << pos << "\n";
			if(mm[pos] == 2){
				location[u] = location[r] - kk;
				stype[u] = 1;
				mm[location[u]] = stype[u];
			}
			else{
				location[u] = first + zeroDist[u];
				stype[u] = 2;
				mm[location[u]] = stype[u];
				r = u;
			} 
		}
	}

}

Subtask #1
8.0 / 8.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 888 KB Output is correct
2 Correct 86 ms 888 KB Output is correct
3 Correct 85 ms 888 KB Output is correct
4 Correct 86 ms 760 KB Output is correct
5 Correct 85 ms 760 KB Output is correct
6 Correct 87 ms 888 KB Output is correct
7 Correct 86 ms 760 KB Output is correct
8 Correct 88 ms 888 KB Output is correct
9 Correct 85 ms 888 KB Output is correct
10 Correct 86 ms 940 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 760 KB Output is correct
2 Correct 87 ms 888 KB Output is correct
3 Correct 84 ms 796 KB Output is correct
4 Correct 87 ms 760 KB Output is correct
5 Correct 84 ms 1016 KB Output is correct
6 Correct 87 ms 888 KB Output is correct
7 Correct 86 ms 888 KB Output is correct
8 Correct 85 ms 888 KB Output is correct
9 Correct 86 ms 888 KB Output is correct
10 Correct 87 ms 888 KB Output is correct
11 Correct 87 ms 764 KB Output is correct
12 Correct 90 ms 888 KB Output is correct
13 Correct 92 ms 888 KB Output is correct
14 Correct 86 ms 888 KB Output is correct
15 Correct 160 ms 760 KB Output is correct
16 Correct 89 ms 888 KB Output is correct
17 Correct 85 ms 764 KB Output is correct
18 Correct 85 ms 888 KB Output is correct
19 Correct 87 ms 888 KB Output is correct
20 Correct 153 ms 888 KB Output is correct