oj.uz

Submission #399518

# Submission time Handle Problem Language Result Execution time Memory
399518 2021-05-05T23:47:09 Z andremfq Rail (IOI14_rail) C++17
100 / 100
 96 ms 4420 KB 
//chen codou a ideia
#include "rail.h"
#include<bits/stdc++.h>
using namespace std;
 
const int MAXN = 5e5 + 10;
const int MAXM = 1e6 + 10;
 
vector<int> esq, dir;
int dist[2][MAXN];
int id[MAXM];
 
bool cmp(int i, int j){
	return dist[0][i] < dist[0][j];
}
 
void findLocation(int N, int first, int location[], int stype[])
{
	int mini = 1e8, x = 0;
	for(int i = 1; i < N; i++){
		dist[0][i] = getDistance(0, i);
		if(dist[0][i] < mini) mini = dist[0][i], x = i;
	}
	
	memset(id, -1, sizeof(id));
	
	dist[1][0] = dist[0][x];
	location[x] = first + dist[1][0];
	id[location[x]] = x;
	stype[x] = 2;
	location[0] = first;
	id[location[0]] = 0;
	stype[0] = 1;
	
	for(int i = 1; i < N; i++){
		if(i == x) continue;
		dist[1][i] = getDistance(x, i);
		if(dist[1][i] + dist[0][x] == dist[0][i]){
			if(dist[1][i] < dist[0][x]){
				location[i] = location[x] - dist[1][i];
				stype[i] = 1;
				id[location[i]] = i;
			}
			else esq.push_back(i);
		}
		else
			dir.push_back(i);
	}
	
	sort(dir.begin(), dir.end(), cmp);
	sort(esq.begin(), esq.end(), cmp);
	
	int y = x;
	for(int i = 0; i < dir.size(); i++){
		int cur = dir[i];
		int aux = (y == x) ? dist[1][cur] : getDistance(y, cur);
		int d = (dist[0][y] + aux - dist[0][cur]) / 2;
		int j = location[y] - d;
		if(j >= 0 && id[j] != -1 && stype[id[j]] == 2){
			location[cur] = location[y] - aux;
			stype[cur] = 1;
			id[location[cur]] = cur;
		}
		else{
			location[cur] = location[0] + dist[0][cur];
			stype[cur] = 2;
			id[location[cur]] = cur;
			y = cur;
		}
	}
	
	y = 0;
	for(int i = 0; i < esq.size(); i++){
		int cur = esq[i];
		int aux = (y == 0) ? dist[0][cur] : getDistance(y, cur);
		int d = (dist[1][y] + aux - dist[1][cur]) / 2;
		int j = location[y] + d;
		if(j >= 0 && id[j] != -1 && stype[id[j]] == 1){
			location[cur] = location[y] + aux;
			stype[cur] = 2;
			id[location[cur]] = cur;
		}
		else{
			location[cur] = location[x] - dist[1][cur];
			stype[cur] = 1;
			id[location[cur]] = cur;
			y = cur;
		}
	}
}

Compilation message

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:54:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |  for(int i = 0; i < dir.size(); i++){
      |                 ~~^~~~~~~~~~~~
rail.cpp:73:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |  for(int i = 0; i < esq.size(); i++){
      |                 ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 4380 KB Output is correct
2 Correct 90 ms 4368 KB Output is correct
3 Correct 93 ms 4360 KB Output is correct
4 Correct 88 ms 4356 KB Output is correct
5 Correct 85 ms 4360 KB Output is correct
6 Correct 87 ms 4420 KB Output is correct
7 Correct 87 ms 4356 KB Output is correct
8 Correct 85 ms 4368 KB Output is correct
9 Correct 88 ms 4352 KB Output is correct
10 Correct 87 ms 4372 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 4368 KB Output is correct
2 Correct 86 ms 4420 KB Output is correct
3 Correct 92 ms 4368 KB Output is correct
4 Correct 90 ms 4356 KB Output is correct
5 Correct 85 ms 4356 KB Output is correct
6 Correct 86 ms 4352 KB Output is correct
7 Correct 88 ms 4372 KB Output is correct
8 Correct 88 ms 4368 KB Output is correct
9 Correct 86 ms 4364 KB Output is correct
10 Correct 86 ms 4364 KB Output is correct
11 Correct 85 ms 4420 KB Output is correct
12 Correct 86 ms 4420 KB Output is correct
13 Correct 96 ms 4364 KB Output is correct
14 Correct 86 ms 4364 KB Output is correct
15 Correct 85 ms 4420 KB Output is correct
16 Correct 87 ms 4368 KB Output is correct
17 Correct 86 ms 4420 KB Output is correct
18 Correct 85 ms 4372 KB Output is correct
19 Correct 88 ms 4376 KB Output is correct
20 Correct 85 ms 4356 KB Output is correct