Submission #135012

#TimeUsernameProblemLanguageResultExecution timeMemory
135012nxteruRail (IOI14_rail)C++14
100 / 100
89 ms928 KiB
#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); if(o!=dr.end()&&a==*o-(l[mad]-b)+*o-l[mic])l[x]=l[mad]-b,t[x]=1; else if(d==l[p[0].S]*2-f-(l[mad]-b))l[x]=l[mad]-b,t[x]=1; else l[x]=l[mic]+a,t[x]=2; } if(t[x]==1){ cr.insert(l[x]); if(l[mic]>l[x])mic=x; }else{ dr.insert(l[x]); if(l[mad]<l[x])mad=x; } } }

Compilation message (stderr)

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:22:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<p.size();i++){
              ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...