# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
551542 | krit3379 | Rail (IOI14_rail) | C++17 | 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;
#define N 5005
struct A{
int x,id;
bool operator<(const A& o)const{
return x<o.x;
}
};
A l,r;
vector<A> v;
map<int,int> mp;
void findLocation(int n, int first, int location[], int stype[]){
int i,pos;
location[0]=first;
stype[0]=1;
if(n==1)return ;
l={first,0};
mp[l.x]=1;
for(i=1;i<n;i++)v.push_back({getDistance(0,i),i});
sort(v.begin(),v.end());
r={l.x+v[0].x,v[0].id};
location[v[0].id]=r.x;
stype[v[0].id]=2;
mp[r.x]=2;
for(i=1;i<v.size();i++){
int xl,xr;
xl=getDistance(v[i].id,l.id);
xr=getDistance(v[i].id,r.id);
pos=l.x+xl;
int val=(pos+r.x-xr)/2;
if((mp.count(val)&&mp[val]==1)||(!mp.count(val)&&val>first)){
A temp={pos,v[i].id};
location[v[i].id]=pos;
stype[v[i].id]=2;
r=max(r,temp);
mp[pos]=2;
continue;
}
pos=r.x-xr;
A temp={pos,v[i].id};
location[v[i].id]=pos;
stype[v[i].id]=1;
l=min(l,temp);
mp[pos]=1;
}
return ;
}