# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673083 | 1bin | 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>
#include "rail.h"
#include <cassert>
using namespace std;
#define all(v) v.begin(), v.end()
typedef long long ll;
/*
int getDistance(int a, int b){
cout << a << ' ' << b << endl;
int x;
cin >> x;
return x;
}*/
void findLocation(int n, int fi, int location[], int stype[]){
vector<pair<int, int>> v;
for(int i = 1; i < n; i++){
int d = getDistance(0, i);
v.emplace_back(d, i);
}
sort(all(v));
location[0] = fi; stype[0] = 1;
if(n == 1) return;
auto [d0, x] = v[0];
location[x] = fi + d0; stype[x] = 2;
int l, r, dr, dl;
l = 0, r = x, dl = d0 * 2, dr = d0;
for(int i = 1; i < n - 1; i++){
auto&[d, x] = v[i];
//cout << "cur is : " << l << ' ' << r << ' ' << x << '\n';
int d1 = getDistance(1, x);
assert(d[0] == v[0].first);
if(d0 + d1 == d){
int xl = getDistance(l, x);
if(l && d == dl + xl){
assert(0);
location[x] = location[l] + xl;
stype[x] = 2;
}
else{
location[x] = fi + 2 * d0 - d;
stype[x] = 1;
if(location[x] < fi) l = x, dl = d;
}
}
else{
int xr = getDistance(r, x);
if(d == dr + xr){
location[x] = fi + dr - xr;
stype[x] = 1;
}
else{
location[x] = fi + d;
stype[x] = 2;
r = x; dr = d;
}
}
}
return;
}
/*
int main(void){
int n = 4, fi = 2, a[4], b[4];
findLocation(n, fi, a, b);
for(int i = 0; i < 4; i++) cout << a[i] << ' ' << b[i] << '\n';
return 0;
}*/