# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
989522 | 12345678 | Rail (IOI14_rail) | C++17 | 43 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 "rail.h"
#include <bits/stdc++.h>
using namespace std;
int l, r, st;
void findLocation(int N, int first, int location[], int stype[])
{
location[0]=first;
stype[0]=1;
vector<pair<int, int>> v;
vector<int> d;
for (int i=1; i<N; i++) v.push_back({getDistance(0, i), i});
sort(v.begin(), v.end());
l=0, r=st=v[0].second;
d.push_back(v[0].second);
location[r]=first+v[0].first;
stype[r]=2;
for (int i=1; i<v.size(); i++)
{
int u=v[i].second;
int tmp=location[r]-getDistance(r, u), cost=0;
if (tmp<first) cost=location[st]-tmp+location[st]-location[0];
else cost=*upper_bound(d.begin(), d.end(), tmp)-tmp+*upper_bound(d.begin(), d.end(), tmp)-location[0];
if (cost==v[i].first)
{
stype[u]=1;
location[u]=tmp;
if (location[u]<location[l]) l=u;
}
else
{
stype[u]=2;
location[u]=location[l]+getDistance(l, u);
d.push_back(location[u]);
if (location[u]>location[r]) r=u;
}
}
}
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... |