/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
cout<<(x?"YES":"NO")<<endl;
}
const int N=2e5+5;
int l[N],r[N],dp[N][21],Log[N],l2[N],r2[N];
struct wavelet_tree{
int x,y;///this node contains values in [x,y]
wavelet_tree *left,*right;
vector<int>b;
wavelet_tree(int *from,int *to,int lo,int hi){
///[from,to] is array indices
///[lo,hi] is values interval
left=NULL;
right=NULL;
x=lo;y=hi;
if(x==y || from>=to){
return;
}
int mid=x+(y-x)/2;
auto isleft=[mid](int a){
return a<=mid;
};
b.reserve(to-from+1);
b.pb(0);
for(auto i=from;i!=to;i++){
b.pb(b.back()+isleft(*i));
}
auto pivot=stable_partition(from,to,isleft);
left=new wavelet_tree(from,pivot,x,mid);
right=new wavelet_tree(pivot,to,mid+1,y);
}
int LTE(int l,int r,int k) {
if(l>r||k<x)return 0;
if(y<=k) return r-l+1;
int lb=b[l-1],rb=b[r];
return this->left->LTE(lb+1,rb,k)+this->right->LTE(l-lb,r-rb,k);
}
int count(int l,int r,int k) {
if(l>r||k<x||k>y) return 0;
if(x==y) return r-l+1;
int lb=b[l-1],rb=b[r],mid=(x+y)/2;
if(k<=mid) return this->left->count(lb+1,rb,k);
return this->right->count(l-lb,r-rb,k);
}
~wavelet_tree(){
if(left)delete left;
if(right)delete right;
}
};
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
#ifndef ONLINE_JUDGE
//freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
#endif
fast
Log[1]=0;
for(int i=2;i<N;i++)Log[i]=Log[i/2]+1;
int n;cin>>n;
set<int>s;
for(int i=1;i<=n;i++){
cin>>l[i]>>r[i];
s.insert(l[i]);
s.insert(r[i]);
l2[i]=l[i];
r2[i]=r[i];
}
int cnt=0;
map<int,int>mp;
for(auto i:s){
mp[i]=cnt++;
}
for(int i=1;i<=n;i++){
l2[i]=mp[l2[i]];
r2[i]=mp[r2[i]];
l[i]=l2[i];
r[i]=r2[i];
}
wavelet_tree w1(l2+1,l2+n+1,0,4e5+5);
wavelet_tree w2(r2+1,r2+n+1,0,4e5+5);
for(int i=1;i<=n;i++){
if(i==n){
dp[i][0]=n+1;
break;
}
int L=i+1,R=n;
dp[i][0]=n+1;
while(L<=R){
int mid=L+R>>1;
int cnt1=mid-i-w1.LTE(i+1,mid,r[i]);
int cnt2=w2.LTE(i+1,mid,l[i])-w2.count(i+1,mid,l[i]);
if(cnt1+cnt2==mid-i){
L=mid+1;
}
else{
dp[i][0]=mid;
R=mid-1;
}
}
}
dp[n+1][0]=n+1;
for(int j=1;j<=20;j++){
dp[n+1][j]=n+1;
for(int i=1;i<=n;i++){
dp[i][j]=dp[dp[i][j-1]][j-1];
}
}
int q;cin>>q;
while(q--){
int a,b;cin>>a>>b;
if(a==b){
cout<<1<<endl;
continue;
}
int ans=1;
for(int j=20;j>=0;j--){
if(dp[a][j]<=b){
a=dp[a][j];
ans+=1<<j;
}
}
cout<<ans<<endl;
}
return 0;
}
Compilation message
Main.cpp: In function 'int main()':
Main.cpp:126:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
126 | int mid=L+R>>1;
| ~^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1051 ms |
165380 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
21 ms |
8540 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
21 ms |
8540 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1046 ms |
170056 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1051 ms |
165380 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
