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 <bits/stdc++.h>
using namespace std;
int N, A[100009], T[100009];
void findLocation(int n, int first, int location[], int stype[]) {
N = n; A[0] = first; T[0] = 1;
for (int i = 1; i < N; i++) {
int G = getDistance(0, i);
A[i] = G + A[0];
T[i] = 2;
}
for (int i = 0; i < N; i++) { location[i] = A[i]; stype[i] = T[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... |