| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 585570 | SeDunion | Rail (IOI14_rail) | C++17 | 68 ms | 500 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 "rail.h"
#include<iostream>
using namespace std;
int n;
void findLocation(int N, int first, int location[], int stype[]) {
n = N;
location[0] = first;
stype[0] = 1;
for (int i = 1 ; i < n ; ++ i) {
stype[i] = 2;
}
for (int i = 1 ; i < n ; ++ i) {
location[i] = getDistance(0, i) + first;
}
}
| # | 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... | ||||
