# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
875993 |
2023-11-21T03:25:34 Z |
Darren0724 |
Rail (IOI14_rail) |
C++17 |
|
43 ms |
604 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);
//cout << a[i] << endl;
p = min(p, {a[i], i});
}
int t = p.second;
for (int i = 0; i < n; i++) {
b[i] = getDistance(t, i);
//cout << b[i] << endl;
}
int second = first + a[t];
type[t] = 2;
ans[t] = second;
for (int i = 1; i < n; i++) {
if (i == t) {
continue;
}
if (a[i] < b[i]) {
type[i] = 2;
ans[i] = first + a[i];
} else {
type[i] = 1;
ans[i] = second - b[i];
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 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 |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
500 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 |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 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 |
0 ms |
512 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 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 |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
43 ms |
604 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 |
- |