# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763706 | Ahmed57 | Rail (IOI14_rail) | C++17 | 45 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 <bits/stdc++.h>
using namespace std;
void findLocation(int n,int first,int location[],int stype[]){
vector<pair<int,int>> v;
for(int i = 1;i<n;i++){
v.push_back({getDistance(0,i),i});
}
sort(v.begin(),v.end());
stype[0] = 1;
location[0]= first;
for(int i = 0;i<v.size();i++){
stype[i+1] = 2;
location[v[i].second] = first+v[i].first;
}
}
/*
int main(){
int S[] = {10,2,20,30,1};
cout<<findMaxAttraction(5,2,7,S);
}*/
Compilation message (stderr)
# | 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... |