oj.uz

Submission #598801

# Submission time Handle Problem Language Result Execution time Memory
598801 2022-07-19T05:45:20 Z fuad27 Rail (IOI14_rail) C++17
30 / 100
 71 ms 468 KB 
#include "rail.h"
#include<bits/stdc++.h>
using namespace std;
void findLocation(int N, int first, int location[], int stype[])
{
	stype[0]=1;
	location[0]=first;
	int mn = 1e9, idx=0;
	for(int i =1;i<N;i++) {
		int k = getDistance(0,i);
		if(k < mn) {
			mn=k;
			idx=i;
		}
	}
	stype[idx]=2;
	location[idx]=first+mn;
	for(int i = 1;i<N;i++) {
		if(i==idx)continue;
		int k1=getDistance(0,i), k2=getDistance(idx,i);
		if(k1 < k2) {
			stype[i]=2;
			location[i]=first+k1;
		}
		else {
			stype[i]=1;
			location[i]=location[idx]-k2;
		}
	}
//	for(int i = 1;i<N;i++) {
//		cout << stype[i] << " " << location[i] << "\n";
//	}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 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 0 ms 340 KB Output is correct
6 Correct 0 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 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
22.0 / 22.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 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 66 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Incorrect 71 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -