oj.uz

Submission #121559

# Submission time Handle Problem Language Result Execution time Memory
121559 2019-06-26T18:50:40 Z WhipppedCream Rail (IOI14_rail) C++17
100 / 100
 95 ms 4476 KB 
#include "rail.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;

int n;

const int maxn = 5005;

int dist0[maxn];
int distu[maxn];

const int maxs = 4e6+5;

int typ[maxs];

bool cmp1(int a, int b)
{
	return dist0[a]< dist0[b];
}

bool cmp2(int a, int b)
{
	return distu[a]< distu[b];
}

void findLocation(int N, int first, int location[], int stype[])
{
	location[0] = first;
	typ[first] = 1;
	stype[0] = 1;
	n = N;
	ii near = {1e9, 0};
	for(int i = 1; i< N; i++)
	{
		dist0[i] = getDistance(0, i);
		near = min(near, {dist0[i], i});
	}
	int u = near.Y;
	location[u] = first+dist0[u];
	stype[u] = 2;
	typ[location[u]] = 2;
	distu[0] = dist0[u];
	vector<int> tol, tor;
	// printf("u = %d\n", u);
	for(int i = 1; i< N; i++)
	{
		if(i == u) continue;
		distu[i] = getDistance(u, i);
		if(dist0[i] == dist0[u]+distu[i])
		{
			if(distu[i]< dist0[u])
			{
				tor.pb(i);
			}
			else tol.pb(i);
		}
		else tor.pb(i);
	}
	sort(tor.begin(), tor.end(), cmp1);
	int y = u;
	for(int z : tor)
	{
		int k = dist0[z]-dist0[y]-getDistance(y, z);
		k = -k;
		k /= 2;
		// printf("for %d to be type 1 there must be 2 at %d\n", z, location[y]-k); 
		if(typ[location[y]-k] == 2)
		{
			//type c
			int mid = location[y]-k;
			assert(dist0[z]> mid-first);
			location[z] = mid-(dist0[z]-(mid-first));
			// printf("location[%d] = %d\n", z, location[z]);
			typ[location[z]] = 1;
			stype[z] = 1;
		}
		else
		{
			//type d
			location[z] = first+dist0[z];
			typ[location[z]] = 2;
			stype[z] = 2;
			y = z;
		}
	}
	y = 0;
	sort(tol.begin(), tol.end(), cmp2);
	for(int z : tol)
	{
		int k = distu[z]-distu[y]-getDistance(y, z);
		k = -k;
		k /= 2;
		if(typ[location[y]+k] == 1)
		{
			//type d
			int mid = location[y]+k;
			location[z] = mid+(distu[z]-(location[u]-mid));
			typ[location[z]] = 2;
			stype[z] = 2;
		}
		else
		{
			//type c
			location[z] = location[u]-distu[z];
			typ[location[z]] = 1;
			stype[z] = 1;
			y = z;
		}
	}
	// for(int i = 0; i< n; i++) printf("%d %d\n", stype[i], location[i]);
}

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 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 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 512 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 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 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 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 #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 4092 KB Output is correct
2 Correct 78 ms 4236 KB Output is correct
3 Correct 82 ms 4344 KB Output is correct
4 Correct 80 ms 4344 KB Output is correct
5 Correct 78 ms 4344 KB Output is correct
6 Correct 79 ms 4092 KB Output is correct
7 Correct 95 ms 4216 KB Output is correct
8 Correct 75 ms 4220 KB Output is correct
9 Correct 89 ms 4188 KB Output is correct
10 Correct 79 ms 4344 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 4088 KB Output is correct
2 Correct 75 ms 4232 KB Output is correct
3 Correct 77 ms 4332 KB Output is correct
4 Correct 78 ms 4476 KB Output is correct
5 Correct 81 ms 4344 KB Output is correct
6 Correct 82 ms 4216 KB Output is correct
7 Correct 83 ms 4344 KB Output is correct
8 Correct 74 ms 4476 KB Output is correct
9 Correct 75 ms 4244 KB Output is correct
10 Correct 80 ms 4316 KB Output is correct
11 Correct 83 ms 4188 KB Output is correct
12 Correct 72 ms 4336 KB Output is correct
13 Correct 75 ms 4244 KB Output is correct
14 Correct 73 ms 4316 KB Output is correct
15 Correct 73 ms 4336 KB Output is correct
16 Correct 75 ms 4472 KB Output is correct
17 Correct 72 ms 4344 KB Output is correct
18 Correct 79 ms 4344 KB Output is correct
19 Correct 82 ms 4344 KB Output is correct
20 Correct 77 ms 4472 KB Output is correct