# 
Submission time^{} 
Handle 
Problem 
Language 
Result 
Execution time 
Memory 
875990 
20231121T02:49:00 Z 
Darren0724 
Rail (IOI14_rail) 
C++17 

45 ms 
856 KB 
#include "rail.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
void findLocation(int n, int first, int ans[], int type[]) {
ans[0] = first;
vector<int> a(n), b(n);
type[0] = 1;
ans[0] = first;
pair<int, int> p = {INF, 1};
for (int i = 1; i < n; i++) {
a[i] = getDistance(0, i);
p = min(p, {a[i], i});
}
int t = p.first;
for (int i = 0; i < n; i++) {
b[i] = getDistance(t, i);
}
int second = first + a[t];
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
type[i] = 1;
ans[i] = first + a[i];
} else {
type[i] = 2;
ans[i] = second  b[i];
}
}
}
# 
Verdict 
Execution time 
Memory 
Grader output 
1 
Incorrect 
0 ms 
348 KB 
Output isn't correct 
2 
Halted 
0 ms 
0 KB 
 
# 
Verdict 
Execution time 
Memory 
Grader output 
1 
Incorrect 
0 ms 
348 KB 
Output isn't correct 
2 
Halted 
0 ms 
0 KB 
 
# 
Verdict 
Execution time 
Memory 
Grader output 
1 
Incorrect 
45 ms 
856 KB 
Output isn't correct 
2 
Halted 
0 ms 
0 KB 
 
# 
Verdict 
Execution time 
Memory 
Grader output 
1 
Incorrect 
43 ms 
604 KB 
Output isn't correct 
2 
Halted 
0 ms 
0 KB 
 