# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1021521 | MarwenElarbi | Rail (IOI14_rail) | C++17 | 39 ms | 652 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;
#define ll long long
#define fi first
#define se second
#define pb push_back
void findLocation(int N, int first, int location[], int stype[])
{
vector<pair<int,int>> a;
location[0]=first;
stype[0]=1;
for (int i = 1; i < N; ++i)
{
a.pb({getDistance(0,i),i});
}
sort(a.begin(),a.end());
int left=0;
int right=a[0].se;
stype[a[0].se]=2;
location[a[0].se]=a[0].fi+first;
for (int i = 1; i < a.size(); ++i)
{
int cura=getDistance(left,a[i].se);
int curb=getDistance(right,a[i].se);
if(cura>curb){
location[a[i].se]=location[right]-curb;
stype[a[i].se]=1;
left=a[i].se;
}else{
location[a[i].se]=location[left]+cura;
stype[a[i].se]=2;
right=a[i].se;
}
}
return;
}
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... |