| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 978767 |
2024-05-09T16:15:18 Z |
bachhoangxuan |
Rail (IOI14_rail) |
C++17 |
|
52 ms |
920 KB |
#include "rail.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=5e3+5;
#define pii pair<int,int>
#define fi first
#define se second
pii a[maxn];
void findLocation(int N, int S, int P[], int T[])
{
map<int,int> mp;
P[0]=S;T[0]=1;
mp[S]=0;
for(int i=1;i<N;i++) a[i]={getDistance(0,i),i};
sort(a+1,a+N);
int l=0,r=a[1].se;
P[r]=S+a[1].fi;T[r]=2;
mp[P[r]]=r;
for(int i=2;i<N;i++){
int x=a[i].se;
int dl=getDistance(l,x),dr=getDistance(r,x);
int m=(P[l]+dl+P[r]-dr)/2;
T[x]=(mp.find(m)==mp.end()?(m>S?2:1):(T[mp[m]]^3));
if(T[x]==2){
P[x]=P[l]+dl;
if(P[x]>P[r]) r=x;
}
else{
P[x]=P[r]-dr;
if(P[x]<P[l]) l=x;
}
mp[P[x]]=x;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
528 KB |
Output is correct |
| 5 |
Correct |
1 ms |
348 KB |
Output is correct |
| 6 |
Correct |
1 ms |
528 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
528 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
1 ms |
344 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
47 ms |
852 KB |
Output is correct |
| 2 |
Correct |
45 ms |
908 KB |
Output is correct |
| 3 |
Correct |
44 ms |
848 KB |
Output is correct |
| 4 |
Correct |
44 ms |
848 KB |
Output is correct |
| 5 |
Correct |
45 ms |
852 KB |
Output is correct |
| 6 |
Correct |
51 ms |
760 KB |
Output is correct |
| 7 |
Correct |
45 ms |
856 KB |
Output is correct |
| 8 |
Correct |
44 ms |
848 KB |
Output is correct |
| 9 |
Correct |
44 ms |
848 KB |
Output is correct |
| 10 |
Correct |
50 ms |
852 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
46 ms |
900 KB |
Output is correct |
| 2 |
Correct |
44 ms |
852 KB |
Output is correct |
| 3 |
Correct |
44 ms |
856 KB |
Output is correct |
| 4 |
Correct |
45 ms |
864 KB |
Output is correct |
| 5 |
Correct |
44 ms |
900 KB |
Output is correct |
| 6 |
Correct |
47 ms |
848 KB |
Output is correct |
| 7 |
Correct |
49 ms |
912 KB |
Output is correct |
| 8 |
Correct |
50 ms |
912 KB |
Output is correct |
| 9 |
Correct |
45 ms |
912 KB |
Output is correct |
| 10 |
Correct |
50 ms |
908 KB |
Output is correct |
| 11 |
Correct |
45 ms |
852 KB |
Output is correct |
| 12 |
Correct |
45 ms |
920 KB |
Output is correct |
| 13 |
Correct |
52 ms |
896 KB |
Output is correct |
| 14 |
Correct |
44 ms |
852 KB |
Output is correct |
| 15 |
Correct |
44 ms |
848 KB |
Output is correct |
| 16 |
Correct |
45 ms |
848 KB |
Output is correct |
| 17 |
Correct |
45 ms |
896 KB |
Output is correct |
| 18 |
Correct |
44 ms |
900 KB |
Output is correct |
| 19 |
Correct |
50 ms |
892 KB |
Output is correct |
| 20 |
Correct |
45 ms |
912 KB |
Output is correct |
