| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 399525 |
2021-05-06T00:25:45 Z |
bigg |
Rail (IOI14_rail) |
C++14 |
|
91 ms |
716 KB |
#include "rail.h"
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 5100;
int dist[MAXN], v[MAXN];
int getdistance(int i, int j){
return getDistance(i,j);
}
bool cmp(int i, int j){
return dist[i] < dist[j];
}
map<int, int> ma;
void findLocation(int n, int first, int location[], int stype[])
{
location[0] = first, stype[0] = 1;
if(n == 1) return;
for(int i = 1; i < n; i++){
dist[i] = getdistance(0,i);
v[i] = i;
}
sort(v, v + n, cmp);
int L, R;
L = 0, R = v[1];
location[R] = first + dist[R];
stype[R] = 2;
ma[location[L]] = 1;
ma[location[R]] = 2;
for(int i = 2; i < n; i++){
int x = v[i];
int dL = getdistance(L,x);
int dR = getdistance(R,x);
int mid = (location[L] + dL + location[R] - dR)/2;
if(ma[mid] == 1 || (ma[mid] == 0 && location[0] < mid)){
location[x] = location[L] + dL;
stype[x] = 2;
if(location[x] > location[R]) R= x;
}
else{
location[x] = location[R] - dR;
stype[x] = 1;
if(location[x] < location[L]) L = x;
}
ma[location[x]] = stype[x];
}
return;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
308 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
332 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
1 ms |
312 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
308 KB |
Output is correct |
| 9 |
Correct |
1 ms |
312 KB |
Output is correct |
| 10 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
85 ms |
636 KB |
Output is correct |
| 2 |
Correct |
86 ms |
692 KB |
Output is correct |
| 3 |
Correct |
83 ms |
684 KB |
Output is correct |
| 4 |
Correct |
87 ms |
704 KB |
Output is correct |
| 5 |
Correct |
85 ms |
716 KB |
Output is correct |
| 6 |
Correct |
84 ms |
684 KB |
Output is correct |
| 7 |
Correct |
85 ms |
692 KB |
Output is correct |
| 8 |
Correct |
84 ms |
696 KB |
Output is correct |
| 9 |
Correct |
91 ms |
688 KB |
Output is correct |
| 10 |
Correct |
85 ms |
708 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
87 ms |
680 KB |
Output is correct |
| 2 |
Correct |
85 ms |
700 KB |
Output is correct |
| 3 |
Correct |
85 ms |
692 KB |
Output is correct |
| 4 |
Correct |
86 ms |
700 KB |
Output is correct |
| 5 |
Correct |
85 ms |
700 KB |
Output is correct |
| 6 |
Correct |
85 ms |
688 KB |
Output is correct |
| 7 |
Correct |
87 ms |
696 KB |
Output is correct |
| 8 |
Correct |
85 ms |
696 KB |
Output is correct |
| 9 |
Correct |
86 ms |
692 KB |
Output is correct |
| 10 |
Correct |
85 ms |
680 KB |
Output is correct |
| 11 |
Correct |
84 ms |
708 KB |
Output is correct |
| 12 |
Correct |
84 ms |
708 KB |
Output is correct |
| 13 |
Correct |
85 ms |
680 KB |
Output is correct |
| 14 |
Correct |
85 ms |
688 KB |
Output is correct |
| 15 |
Correct |
85 ms |
708 KB |
Output is correct |
| 16 |
Correct |
85 ms |
692 KB |
Output is correct |
| 17 |
Correct |
84 ms |
692 KB |
Output is correct |
| 18 |
Correct |
84 ms |
708 KB |
Output is correct |
| 19 |
Correct |
85 ms |
688 KB |
Output is correct |
| 20 |
Correct |
84 ms |
696 KB |
Output is correct |
