| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 50183 | Just_Solve_The_Problem | Rail (IOI14_rail) | C++11 | 87 ms | 692 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;
int n;
void findLocation(int N, int first, int location[], int stype[]) {
n = N;
for (int i = 1; i < n; i++) {
stype[i] = 2;
}
stype[0] = 1;
location[0] = first;
for (int i = 1; i < n; i++) {
location[i] = first + getDistance(0, i);
}
}
| # | 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... | ||||
