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>
using namespace std;
#include "railroad.h"
const int MAXN=212345;
vector<pair<int,int> > v;
long long plan_roller_coaster(vector<int> e,vector<int> s)
{
int n=e.size();
for(int i=0;i<n;i++)
{
v.push_back(make_pair(e[i],s[i]));
}
sort(v.begin(),v.end());
long long resp=0,rsp=0;
for(int i=0;i<n;i++)
{
int id=i+1;
id%=n;
rsp+=v[i].second-v[id].first;
}
resp=rsp;
for(int i=0;i<n;i++)
{
int id=i+1;
id%=n;
long long k=v[i].second-v[id].first;
resp=min(rsp-k,resp);
}
return resp;
}
# | 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... |