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;
int a[MAXN];
long long plan_roller_coaster(vector<int> e,vector<int> s)
{
int n=e.size();
int mx=0,idm=0;
for(int i=0;i<n;i++)
{
v.push_back(make_pair(s[i],e[i]));
if(s[i]>mx)
{
mx=s[i];
idm=i;
}
}
sort(v.begin(),v.end());
long long resp=0;
for(int i=0;i<n;i++)
{
int id=upper_bound(v.begin(),v.end(),make_pair(e[idm],s[idm]))-v.begin();
id--;
resp+=max(0,s[id]-e[idm]);
idm=id;
}
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... |