| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1108273 | Ariadna | Rail (IOI14_rail) | C++14 | 46 ms | 592 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "rail.h"
using namespace std;
void findLocation(int n, int first, int location[], int stype[]) {
location[0] = first;
stype[0] = 1;
for (int i = 1; i < n; ++i) {
int d1 = getDistance(i, 0), d2 = getDistance(0, i);
if (d1 < d2) {
location[i] = location[0]-d1;
stype[i] = 1;
} else {
location[i] = location[0]+d2;
stype[i] = 2;
}
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
