# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
730295 | ogibogi2004 | Rail (IOI14_rail) | C++14 | 90 ms | 772 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;
void findLocation(int N, int first, int location[], int stype[])
{
memset(stype,0,sizeof(stype));
memset(location,0,sizeof(location));
location[0]=first;
stype[0]=1;
map<int,int> mtype;
mtype[location[0]]=1;
vector<pair<int,int> >distances;
vector<int>dist0(N);
vector<int>dist1(N);
for(int i=1;i<N;i++)
{
distances.push_back({getDistance(0, i),i});
dist0[i]=distances.back().first;
}
sort(distances.begin(),distances.end());
location[distances[0].second]=location[0]+distances[0].first;
stype[distances[0].second]=2;
mtype[location[distances[0].second]]=2;
set<int>cs;
set<int>ds;
int minc=0,maxd=distances[0].second,sec=maxd;
cs.insert(location[0]);
ds.insert(location[distances[0].second]);
for(int i=1;i<N;i++)
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... |