oj.uz

답안 #862766

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862766 2023-10-19T01:39:05 Z Ahmed_Solyman Osumnjičeni (COCI21_osumnjiceni) C++14
0 / 110
 191 ms 72740 KB 
/*
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];
struct segtree{
	vector<int>tree,lazy;
	int size;
	void init(int n){
		size=n;
		tree.assign(n*4+5,1e9);
		lazy.assign(n*4+5,-1);
	}
	void push_lazy(int l,int r,int p){
		if(~lazy[p]){
			tree[p]=lazy[p];
			if(l!=r){
				tree[p*2]=lazy[p];
				tree[p*2+1]=lazy[p];
			}
			lazy[p]=-1;
		}
	}
	void set(int l,int r,int p,int lq,int rq,int v){
		push_lazy(l,r,p);
		if(l>=lq && r<=rq){
			tree[p]=v;
			if(l!=r){
				lazy[p*2]=lazy[p*2+1]=v;
			}
			return;
		}
		if(r<lq || l>rq){
			return;
		}
		int mid=(l+r)/2;
		set(l,mid,p*2,lq,rq,v);
		set(mid+1,r,p*2+1,lq,rq,v);
		tree[p]=min(tree[p*2],tree[p*2+1]);
	}
	void set(int l,int r,int v){
		set(1,size,1,l,r,v);
	}
	int query(int l,int r,int p,int l_q,int r_q){
		push_lazy(l,r,p);
		if(l>=l_q && r<=r_q){
			return tree[p];
		}
		if(r<l_q || l>r_q){
			return 1e9;
		}
		int mid=(l+r)/2;
		return min(query(l,mid,p*2,l_q,r_q),query(mid+1,r,p*2+1,l_q,r_q));
	}
	int query(int l,int r){
		return query(1,size,1,l,r);
	}
};
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
    int n;cin>>n;
	vector<int>v;
    for(int i=1;i<=n;i++){
    	cin>>l[i]>>r[i];
    	v.push_back(l[i]);
    	v.push_back(r[i]);
    }
    sort(all(v));
    int cnt=1;
    unordered_map<int,int>mp;
    for(auto i:v){
    	mp[i]=cnt++;
    }
    for(int i=1;i<=n;i++){
    	l[i]=mp[l[i]];
    	r[i]=mp[r[i]];
    }
    cnt++;
    segtree s;
    s.init(4e5+5);
    for(int i=n;i>=1;i--){
    	int x=n+1;
    	for(int j=i+1;j<=n;j++){
    		if(!(l[j]>r[i] || r[j]<l[i])){
    			x=j;
    			break;
    		}
    	}
    	dp[i][0]=s.query(l[i],r[i]);
    	dp[i][0]=min(dp[i][0],n+1);
    	if(i<n)dp[i][0]=min(dp[i][0],dp[i+1][0]);
    	s.set(l[i],r[i],i);
    	assert(x==dp[i][0]);
    }
    dp[n+1][0]=n+1;
    for(int j=1;j<=20;j++){
    	for(int i=1;i<=n+1;i++){
    		dp[i][j]=dp[dp[i][j-1]][j-1];
    	}
    }
    int q;cin>>q;
    while(q--){
    	int a,b;cin>>a>>b;
    	int ans=1;
    	for(int i=20;i>=0;i--){
    		if(dp[a][i]<=b){
    			a=dp[a][i];
    			ans+=(1<<i);
    		}
    	}
    	cout<<ans<<endl;
    }
    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 150 ms 71540 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 35160 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 35160 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 191 ms 72740 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 150 ms 71540 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -