oj.uz

Submission #588254

# Submission time Handle Problem Language Result Execution time Memory
588254 2022-07-02T22:11:27 Z AlperenT Rail (IOI14_rail) C++17
100 / 100
 119 ms 656 KB 
#include <bits/stdc++.h>
#include "rail.h"

using namespace std;

void findLocation(int n, int A, int location[], int stype[]){
	location[0] = A;
	stype[0] = 1;

	A = 0;
	
	if(n == 1) return;

	int distA[n] = {};
	int distB[n] = {};

	for(int i = 1; i < n; i++){
		distA[i] = getDistance(A, i);
	}

	int B = min_element(distA + 1, distA + n) - distA;

	location[B] = location[A] + distA[B];
	stype[B] = 2;

	vector<pair<int, int>> lft, rght;

	for(int i = 1; i < n; i++){
		if(i != B){
			distB[i] = getDistance(B, i);

			if(distA[i] == distA[B] + distB[i]) lft.push_back({distB[i], i});
			else rght.push_back({distA[i], i});
		}
	}

	sort(lft.begin(), lft.end());

	if(!lft.empty()){
		int C = lft.front().second;

		location[C] = location[B] - distB[C];
		stype[C] = 1;

		for(int i = 1; i < lft.size(); i++){
			int X = lft[i].second;

			int dist = getDistance(C, X);

			pair<int, int> p = {location[C], C};

			for(int i = 0; i < n; i++){
				if(stype[i] == 1 && location[i] < location[C] + dist) p = max(p, {location[i], i});
			}

			if(distB[X] == distB[p.second] + ((location[C] + dist) - location[p.second])){
				location[X] = location[C] + dist;
				stype[X] = 2;
			}
			else{
				location[X] = location[B] - distB[X];
				stype[X] = 1;
				C = X;
			}
		}
	}

	sort(rght.begin(), rght.end());

	if(!rght.empty()){
		int D = rght.front().second;
 
		location[D] = location[A] + distA[D];
		stype[D] = 2;
 
		for(int i = 1; i < rght.size(); i++){
			int X = rght[i].second;
 
			int dist = getDistance(D, X);

			pair<int, int> p = {location[D], D};

			for(int i = 0; i < n; i++){
				if(stype[i] == 2 && location[i] > location[D] - dist) p = min(p, {location[i], i});
			}
 
			if(distA[X] == distA[p.second] + (location[p.second] - (location[D] - dist))){
				location[X] = location[D] - dist;
				stype[X] = 1;
			}
			else{
				location[X] = location[A] + distA[X];
				stype[X] = 2;
				D = X;
			}
		}
	}
}

Compilation message

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:45:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |   for(int i = 1; i < lft.size(); i++){
      |                  ~~^~~~~~~~~~~~
rail.cpp:76:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |   for(int i = 1; i < rght.size(); i++){
      |                  ~~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 468 KB Output is correct
2 Correct 105 ms 576 KB Output is correct
3 Correct 106 ms 572 KB Output is correct
4 Correct 110 ms 468 KB Output is correct
5 Correct 112 ms 592 KB Output is correct
6 Correct 115 ms 596 KB Output is correct
7 Correct 104 ms 504 KB Output is correct
8 Correct 109 ms 616 KB Output is correct
9 Correct 107 ms 504 KB Output is correct
10 Correct 115 ms 508 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 468 KB Output is correct
2 Correct 104 ms 468 KB Output is correct
3 Correct 108 ms 468 KB Output is correct
4 Correct 119 ms 468 KB Output is correct
5 Correct 107 ms 472 KB Output is correct
6 Correct 104 ms 592 KB Output is correct
7 Correct 107 ms 588 KB Output is correct
8 Correct 118 ms 620 KB Output is correct
9 Correct 108 ms 592 KB Output is correct
10 Correct 107 ms 624 KB Output is correct
11 Correct 104 ms 600 KB Output is correct
12 Correct 108 ms 504 KB Output is correct
13 Correct 115 ms 592 KB Output is correct
14 Correct 111 ms 596 KB Output is correct
15 Correct 105 ms 588 KB Output is correct
16 Correct 109 ms 588 KB Output is correct
17 Correct 108 ms 656 KB Output is correct
18 Correct 107 ms 500 KB Output is correct
19 Correct 105 ms 520 KB Output is correct
20 Correct 106 ms 600 KB Output is correct