oj.uz

Submission #862743

# Submission time Handle Problem Language Result Execution time Memory
862743 2023-10-19T00:55:40 Z Ahmed_Solyman Osumnjičeni (COCI21_osumnjiceni) C++14
10 / 110
 1000 ms 19032 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],Log[N];
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;
    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;
    	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 32 ms 18776 KB Output is correct
2 Correct 31 ms 18772 KB Output is correct
3 Correct 32 ms 18924 KB Output is correct
4 Correct 32 ms 18892 KB Output is correct
5 Correct 32 ms 19024 KB Output is correct
6 Correct 28 ms 18772 KB Output is correct
7 Correct 31 ms 18776 KB Output is correct
8 Correct 32 ms 18780 KB Output is correct
9 Correct 36 ms 18756 KB Output is correct
10 Correct 38 ms 18772 KB Output is correct
11 Execution timed out 1070 ms 4436 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 4440 KB Output is correct
2 Correct 22 ms 4444 KB Output is correct
3 Correct 22 ms 4444 KB Output is correct
4 Correct 23 ms 4440 KB Output is correct
5 Correct 23 ms 4600 KB Output is correct
6 Correct 26 ms 4444 KB Output is correct
7 Correct 20 ms 4596 KB Output is correct
8 Correct 21 ms 4440 KB Output is correct
9 Correct 18 ms 4444 KB Output is correct
10 Correct 12 ms 4444 KB Output is correct
11 Correct 39 ms 4444 KB Output is correct
12 Correct 31 ms 4444 KB Output is correct
13 Correct 31 ms 4444 KB Output is correct
14 Correct 34 ms 4444 KB Output is correct
15 Correct 35 ms 4540 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 76 ms 4568 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4440 KB Output is correct
2 Correct 22 ms 4444 KB Output is correct
3 Correct 22 ms 4444 KB Output is correct
4 Correct 23 ms 4440 KB Output is correct
5 Correct 23 ms 4600 KB Output is correct
6 Correct 26 ms 4444 KB Output is correct
7 Correct 20 ms 4596 KB Output is correct
8 Correct 21 ms 4440 KB Output is correct
9 Correct 18 ms 4444 KB Output is correct
10 Correct 12 ms 4444 KB Output is correct
11 Correct 39 ms 4444 KB Output is correct
12 Correct 31 ms 4444 KB Output is correct
13 Correct 31 ms 4444 KB Output is correct
14 Correct 34 ms 4444 KB Output is correct
15 Correct 35 ms 4540 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 76 ms 4568 KB Output is correct
18 Correct 885 ms 5324 KB Output is correct
19 Correct 781 ms 5420 KB Output is correct
20 Correct 914 ms 5460 KB Output is correct
21 Correct 784 ms 5352 KB Output is correct
22 Correct 816 ms 5200 KB Output is correct
23 Correct 912 ms 5456 KB Output is correct
24 Correct 767 ms 5460 KB Output is correct
25 Correct 803 ms 5380 KB Output is correct
26 Correct 689 ms 5360 KB Output is correct
27 Correct 448 ms 5112 KB Output is correct
28 Correct 60 ms 4748 KB Output is correct
29 Correct 66 ms 4688 KB Output is correct
30 Correct 69 ms 4692 KB Output is correct
31 Correct 75 ms 4816 KB Output is correct
32 Correct 67 ms 4692 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Execution timed out 1049 ms 5076 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 19028 KB Output is correct
2 Correct 49 ms 19024 KB Output is correct
3 Correct 49 ms 18980 KB Output is correct
4 Correct 45 ms 18780 KB Output is correct
5 Correct 49 ms 19028 KB Output is correct
6 Correct 45 ms 18780 KB Output is correct
7 Correct 47 ms 18768 KB Output is correct
8 Correct 47 ms 18772 KB Output is correct
9 Correct 56 ms 18768 KB Output is correct
10 Correct 59 ms 19032 KB Output is correct
11 Execution timed out 1006 ms 6664 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 18776 KB Output is correct
2 Correct 31 ms 18772 KB Output is correct
3 Correct 32 ms 18924 KB Output is correct
4 Correct 32 ms 18892 KB Output is correct
5 Correct 32 ms 19024 KB Output is correct
6 Correct 28 ms 18772 KB Output is correct
7 Correct 31 ms 18776 KB Output is correct
8 Correct 32 ms 18780 KB Output is correct
9 Correct 36 ms 18756 KB Output is correct
10 Correct 38 ms 18772 KB Output is correct
11 Execution timed out 1070 ms 4436 KB Time limit exceeded
12 Halted 0 ms 0 KB -