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 "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
vector<pair<int, int> > vec;
int cnt;
ll ans;
vector<ll> ansV;
ll plan_roller_coaster(vector<int> s, vector<int> t) {
n = (int)s.size();
vec.push_back(make_pair(1000000001, -1));
vec.push_back(make_pair(0, 1));
for(int i=0; i<n; i++){
vec.push_back(make_pair(s[i], -1));
vec.push_back(make_pair(t[i], 1));
}
sort(vec.begin(), vec.end());
for(auto p: vec){
if(p.second == -1){
cnt--;
if(cnt < 0) ansV.push_back(p.first);
}
else{
if(cnt < 0) ans += p.first - ansV.back(), ansV.pop_back();
cnt++;
}
}
return ans;
}
# | 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... |