| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 348841 |
2021-01-15T21:37:13 Z |
dennisstar |
Rail (IOI14_rail) |
C++17 |
|
91 ms |
876 KB |
#include <bits/stdc++.h>
#include "rail.h"
#define gd getDistance
#define eb emplace_back
using namespace std;
void findLocation(int N, int first, int L[], int T[]) {
vector<int> D(N), S;
for (int i=1; i<N; i++) S.eb(i), D[i]=gd(0, i);
sort(S.begin(), S.end(), [&](int x, int y) { return D[x]<D[y]; });
int l=0, r=S[0];
L[l]=0, L[r]=D[r];
T[l]=1, T[r]=2;
map<int, int> M;
M[0]=1, M[D[r]]=2;
for (int i=1; i<N-1; i++) {
int n=S[i];
int d1=gd(l, n), d2=gd(r, n), x=(L[l]+L[r]+d1-d2)/2;
if (M[x]==1||(M[x]==0&&x>0)) {
int dn=L[l]+d1;
L[n]=dn;
T[n]=2;
M[dn]=2;
if (dn>L[r]) r=n;
}
else {
int dn=L[r]-d2;
L[n]=dn;
T[n]=1;
M[dn]=1;
if (dn<L[l]) l=n;
}
}
for (int i=0; i<N; i++) L[i]=L[i]+first;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
0 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Correct |
1 ms |
364 KB |
Output is correct |
| 10 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
0 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Correct |
1 ms |
364 KB |
Output is correct |
| 10 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
89 ms |
748 KB |
Output is correct |
| 2 |
Correct |
83 ms |
748 KB |
Output is correct |
| 3 |
Correct |
89 ms |
748 KB |
Output is correct |
| 4 |
Correct |
84 ms |
748 KB |
Output is correct |
| 5 |
Correct |
85 ms |
748 KB |
Output is correct |
| 6 |
Correct |
85 ms |
780 KB |
Output is correct |
| 7 |
Correct |
84 ms |
748 KB |
Output is correct |
| 8 |
Correct |
83 ms |
748 KB |
Output is correct |
| 9 |
Correct |
85 ms |
876 KB |
Output is correct |
| 10 |
Correct |
84 ms |
876 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
84 ms |
748 KB |
Output is correct |
| 2 |
Correct |
84 ms |
748 KB |
Output is correct |
| 3 |
Correct |
91 ms |
876 KB |
Output is correct |
| 4 |
Correct |
86 ms |
748 KB |
Output is correct |
| 5 |
Correct |
83 ms |
748 KB |
Output is correct |
| 6 |
Correct |
84 ms |
748 KB |
Output is correct |
| 7 |
Correct |
85 ms |
748 KB |
Output is correct |
| 8 |
Correct |
84 ms |
748 KB |
Output is correct |
| 9 |
Correct |
85 ms |
748 KB |
Output is correct |
| 10 |
Correct |
84 ms |
748 KB |
Output is correct |
| 11 |
Correct |
83 ms |
748 KB |
Output is correct |
| 12 |
Correct |
84 ms |
748 KB |
Output is correct |
| 13 |
Correct |
84 ms |
748 KB |
Output is correct |
| 14 |
Correct |
85 ms |
876 KB |
Output is correct |
| 15 |
Correct |
85 ms |
748 KB |
Output is correct |
| 16 |
Correct |
84 ms |
748 KB |
Output is correct |
| 17 |
Correct |
84 ms |
748 KB |
Output is correct |
| 18 |
Correct |
83 ms |
748 KB |
Output is correct |
| 19 |
Correct |
84 ms |
748 KB |
Output is correct |
| 20 |
Correct |
85 ms |
748 KB |
Output is correct |
