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;
const int MX=4e5+5;
long long deg[MX];
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = (int) s.size();
vector<int> v;
for(int i=0 ; i<n ; i++){
v.push_back(s[i]);
v.push_back(t[i]);
}
sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
for(int i=0 ; i<n ; i++){
deg[lower_bound(v.begin(),v.end(),s[i])-v.begin()]++;
deg[lower_bound(v.begin(),v.end(),t[i])-v.begin()]--;
}
if(v.size()==1)return 0;
deg[1]+=deg[0]-1;
for(int i=1 ; i<(int)v.size()-1 ; i++){
deg[i+1]+=deg[i];
}
if(deg[v.size()-1]==-1)return 0;
return 0;
}
# | 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... |