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[]){
vector<pair<int,int>> v;
for(int i = 1;i<n;i++){
v.push_back({getDistance(0,i),i});
}
sort(v.begin(),v.end());
int x = v[0].second;
stype[0] = 1;
location[0]= first;
stype[x] = 2;
location[x] = v[0].first+first;
for(int i = 1;i<n;i++){
if(i==x)continue;
int dis1 = getDistance(0,i);
int dis2 = getDistance(x,i);
if(dis2<dis1){
stype[i] = 1;
location[i] = first-(dis2-v[0].first);
}else{
stype[i] = 2;
location[i] = first+dis1;
}
}
}
/*
int main(){
int S[] = {10,2,20,30,1};
cout<<findMaxAttraction(5,2,7,S);
}*/
# | 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... |