# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132447 | Sorting | Rail (IOI14_rail) | C++14 | 0 ms | 0 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>
using namespace std;
int getDistance(int i, int j);
void findLocation(int n, int first, int location[], int stype[]){
location[0] = first;
stype[0] = 1;
for(int i = 1; i < n; i++){
location[i] = getDistance(0, i) + first;
stype[i] = 2;
}
}