#include <bits/stdc++.h>
using namespace std;
int n;
pair<int,int> a[200007];
int ind[200007],curr;
bool cmp(int x,int y){
return a[x].second>a[y].second;
}
int tree[4*200007],pos,cnt;
void build(int v,int l,int r){
if(l==r){
tree[v]=l;
}else{
int tt=(l+r)/2;
build(2*v,l,tt);
build(2*v+1,tt+1,r);
tree[v]=l;
}
}
void update(int v,int l,int r,int pos){
if(l==r){
tree[v]=n+1;
}else{
int tt=(l+r)/2;
if(pos<=tt)update(2*v,l,tt,pos);
else update(2*v+1,tt+1,r,pos);
tree[v]=min(tree[2*v],tree[2*v+1]);
}
}
int getmin(int v,int l,int r,int ll,int rr){
if(ll>rr)return n+1;
if(l==ll and r==rr){
return tree[v];
}else{
int tt=(l+r)/2;
return min( getmin(2*v,l,tt,ll,min(tt,rr)) , getmin(2*v+1,tt+1,r,max(tt+1,ll),rr) );
}
}
long long plan_roller_coaster(vector<int> s,vector<int> t){
n=s.size();
for(int i=1;i<=n;i++){
a[i]={s[i-1],t[i-1]};
ind[i]=i;
}
sort(a+1,a+n+1);
sort(ind+1,ind+n+1,cmp);
build(1,1,n);
for(int i=1;i<=n;i++){
curr=ind[i];
int l=0,r=n+1,tt;
while(l+1<r){
tt=(l+r)/2;
if(a[curr].second<=a[tt].first){
r=tt;
}else{
l=tt;
}
}
pos=getmin(1,1,n,r,n);
if(pos==curr)pos=getmin(1,1,n,pos+1,n);
if(pos==n+1)cnt++;
else update(1,1,n,pos);
}
if(cnt>1)return 1;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
n = 2 |
2 |
Correct |
1 ms |
212 KB |
n = 2 |
3 |
Correct |
0 ms |
212 KB |
n = 2 |
4 |
Correct |
0 ms |
212 KB |
n = 2 |
5 |
Correct |
1 ms |
212 KB |
n = 2 |
6 |
Incorrect |
0 ms |
212 KB |
answer is not correct: 1 instead of 523688153 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
n = 2 |
2 |
Correct |
1 ms |
212 KB |
n = 2 |
3 |
Correct |
0 ms |
212 KB |
n = 2 |
4 |
Correct |
0 ms |
212 KB |
n = 2 |
5 |
Correct |
1 ms |
212 KB |
n = 2 |
6 |
Incorrect |
0 ms |
212 KB |
answer is not correct: 1 instead of 523688153 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
133 ms |
7844 KB |
n = 199999 |
2 |
Correct |
137 ms |
7964 KB |
n = 199991 |
3 |
Correct |
147 ms |
7844 KB |
n = 199993 |
4 |
Correct |
99 ms |
6476 KB |
n = 152076 |
5 |
Correct |
60 ms |
3904 KB |
n = 93249 |
6 |
Correct |
122 ms |
7836 KB |
n = 199910 |
7 |
Correct |
132 ms |
10940 KB |
n = 199999 |
8 |
Correct |
120 ms |
10568 KB |
n = 199997 |
9 |
Correct |
138 ms |
10224 KB |
n = 171294 |
10 |
Correct |
122 ms |
8936 KB |
n = 140872 |
11 |
Correct |
162 ms |
10608 KB |
n = 199886 |
12 |
Correct |
132 ms |
11064 KB |
n = 199996 |
13 |
Correct |
128 ms |
10688 KB |
n = 200000 |
14 |
Correct |
124 ms |
10820 KB |
n = 199998 |
15 |
Correct |
123 ms |
10828 KB |
n = 200000 |
16 |
Correct |
169 ms |
11220 KB |
n = 199998 |
17 |
Correct |
79 ms |
11584 KB |
n = 200000 |
18 |
Correct |
138 ms |
11376 KB |
n = 190000 |
19 |
Correct |
81 ms |
10640 KB |
n = 177777 |
20 |
Correct |
74 ms |
6072 KB |
n = 100000 |
21 |
Correct |
138 ms |
11600 KB |
n = 200000 |
22 |
Correct |
206 ms |
11712 KB |
n = 200000 |
23 |
Correct |
157 ms |
11720 KB |
n = 200000 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
n = 2 |
2 |
Correct |
1 ms |
212 KB |
n = 2 |
3 |
Correct |
0 ms |
212 KB |
n = 2 |
4 |
Correct |
0 ms |
212 KB |
n = 2 |
5 |
Correct |
1 ms |
212 KB |
n = 2 |
6 |
Incorrect |
0 ms |
212 KB |
answer is not correct: 1 instead of 523688153 |
7 |
Halted |
0 ms |
0 KB |
- |