# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135012 | nxteru | Rail (IOI14_rail) | C++14 | 89 ms | 928 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;
typedef pair<int,int> P;
#define F first
#define S second
#define PB push_back
int mad,mic;
vector<P>p;
int h[5005];
set<int>cr,dr;
void findLocation(int n, int f, int l[], int t[]){
l[0]=f,t[0]=1;
cr.insert(f);
for(int i=1;i<n;i++)p.PB(P(getDistance(0,i),i));
sort(p.begin(),p.end());
mad=p[0].S;
l[p[0].S]=f+p[0].F;
h[p[0].S]=p[0].F;
t[p[0].S]=2;
dr.insert(l[p[0].S]);
for(int i=1;i<p.size();i++){
int d=p[i].F,x=p[i].S;
h[x]=d;
int a=getDistance(mic,x),b=getDistance(mad,x);
auto o=cr.upper_bound(l[mic]+a);
o--;
if(b==l[mad]-*o+l[mic]+a-*o)l[x]=l[mic]+a,t[x]=2;
else{
o=dr.upper_bound(l[mad]-b);
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... |