oj.uz

Submission #862745

# Submission time Handle Problem Language Result Execution time Memory
862745 2023-10-19T00:57:03 Z Ahmed_Solyman Osumnjičeni (COCI21_osumnjiceni) C++14
10 / 110
 1000 ms 18416 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];
    }
    for(int i=n;i>=1;i--){
    	dp[i][0]=n+1;
    	for(int j=i+1;j<=n;j++){
    		if(!(l[j]>r[i] || r[j]<l[i])){
    			dp[i][0]=j;
    			break;
    		}
    	}
    	if(i<n)dp[i][0]=min(dp[i][0],dp[i+1][0]);
    }
    int q;cin>>q;
    while(q--){
    	int a,b;cin>>a>>b;
    	if(a==b){
    		cout<<1<<endl;
    		continue;
    	}
    	int ans=0;
    	while(a<=b)a=dp[a][0],ans++;
    	cout<<ans<<endl;
    }
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 18348 KB Output is correct
2 Correct 35 ms 18260 KB Output is correct
3 Correct 31 ms 18184 KB Output is correct
4 Correct 32 ms 18268 KB Output is correct
5 Correct 33 ms 18232 KB Output is correct
6 Correct 29 ms 18268 KB Output is correct
7 Correct 30 ms 18268 KB Output is correct
8 Correct 33 ms 18124 KB Output is correct
9 Correct 37 ms 18168 KB Output is correct
10 Correct 44 ms 18264 KB Output is correct
11 Execution timed out 1033 ms 5712 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4784 KB Output is correct
2 Correct 22 ms 4700 KB Output is correct
3 Correct 22 ms 4776 KB Output is correct
4 Correct 26 ms 4796 KB Output is correct
5 Correct 22 ms 4700 KB Output is correct
6 Correct 27 ms 4700 KB Output is correct
7 Correct 20 ms 4700 KB Output is correct
8 Correct 21 ms 4776 KB Output is correct
9 Correct 18 ms 4700 KB Output is correct
10 Correct 12 ms 4776 KB Output is correct
11 Correct 34 ms 4696 KB Output is correct
12 Correct 31 ms 4688 KB Output is correct
13 Correct 32 ms 4692 KB Output is correct
14 Correct 34 ms 4696 KB Output is correct
15 Correct 35 ms 4696 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 76 ms 4780 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4784 KB Output is correct
2 Correct 22 ms 4700 KB Output is correct
3 Correct 22 ms 4776 KB Output is correct
4 Correct 26 ms 4796 KB Output is correct
5 Correct 22 ms 4700 KB Output is correct
6 Correct 27 ms 4700 KB Output is correct
7 Correct 20 ms 4700 KB Output is correct
8 Correct 21 ms 4776 KB Output is correct
9 Correct 18 ms 4700 KB Output is correct
10 Correct 12 ms 4776 KB Output is correct
11 Correct 34 ms 4696 KB Output is correct
12 Correct 31 ms 4688 KB Output is correct
13 Correct 32 ms 4692 KB Output is correct
14 Correct 34 ms 4696 KB Output is correct
15 Correct 35 ms 4696 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 76 ms 4780 KB Output is correct
18 Correct 892 ms 5472 KB Output is correct
19 Correct 779 ms 5460 KB Output is correct
20 Correct 921 ms 5832 KB Output is correct
21 Correct 794 ms 5512 KB Output is correct
22 Correct 829 ms 5392 KB Output is correct
23 Correct 915 ms 5748 KB Output is correct
24 Correct 769 ms 5720 KB Output is correct
25 Correct 801 ms 5580 KB Output is correct
26 Correct 669 ms 5316 KB Output is correct
27 Correct 454 ms 5640 KB Output is correct
28 Correct 58 ms 4944 KB Output is correct
29 Correct 58 ms 4944 KB Output is correct
30 Correct 60 ms 4944 KB Output is correct
31 Correct 59 ms 4944 KB Output is correct
32 Correct 66 ms 4948 KB Output is correct
33 Correct 0 ms 2392 KB Output is correct
34 Execution timed out 1091 ms 5372 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 18260 KB Output is correct
2 Correct 59 ms 18416 KB Output is correct
3 Correct 63 ms 18256 KB Output is correct
4 Correct 49 ms 18260 KB Output is correct
5 Correct 47 ms 18364 KB Output is correct
6 Correct 46 ms 18312 KB Output is correct
7 Correct 44 ms 18204 KB Output is correct
8 Correct 51 ms 18284 KB Output is correct
9 Correct 72 ms 18068 KB Output is correct
10 Correct 56 ms 18260 KB Output is correct
11 Execution timed out 1018 ms 5712 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 18348 KB Output is correct
2 Correct 35 ms 18260 KB Output is correct
3 Correct 31 ms 18184 KB Output is correct
4 Correct 32 ms 18268 KB Output is correct
5 Correct 33 ms 18232 KB Output is correct
6 Correct 29 ms 18268 KB Output is correct
7 Correct 30 ms 18268 KB Output is correct
8 Correct 33 ms 18124 KB Output is correct
9 Correct 37 ms 18168 KB Output is correct
10 Correct 44 ms 18264 KB Output is correct
11 Execution timed out 1033 ms 5712 KB Time limit exceeded
12 Halted 0 ms 0 KB -