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>
#include "railroad.h"
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,S[200009],T[200009];
map <int, int> m;
map <int, int>::iterator it;
long long plan_roller_coaster(std::vector<int> Ss, std::vector<int> Tt) {
a=Ss.size();
for(i=1; i<=a; i++){
S[i]=Ss[i-1];T[i]=Tt[i-1];
}
for(i=1; i<=a; i++){
m[S[i]]++;m[T[i]]--;
}
zx=0;
for(it=m.begin(); it!=m.end(); it++){
zx+=(*it).second;
if(zx>1) return 1;
}
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... |