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 double ld;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const ll INF=1e18+7;
ll plan_roller_coaster(vector<int>S, vector<int>T) {
int n=S.size();
vector<pair<ll,ll>>V;
rep(i, n) {
V.pb({S[i], 1});
V.pb({T[i], -1});
}
sort(all(V));
ll lst=V[0].st, sum=-1, ans=0;
int czy=0;
for(auto i : V) {
ans+=(i.st-lst)*max(sum, 0ll);
if(i.st!=lst) {
if(sum!=0) {
if(czy==2) {
return 1;
}
czy=1;
} else if(czy==1) czy=2;
}
sum+=i.nd;
lst=i.st;
}
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... |