Submission #745183

#TimeUsernameProblemLanguageResultExecution timeMemory
745183sword060Osumnjičeni (COCI21_osumnjiceni)C++17
10 / 110
1087 ms4172 KiB
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int x,q,l[N],r[N],nxt[N];
int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	cin>>x;
	for(int i=1;i<=x;i++)cin>>l[i]>>r[i];
	for(int i=x;i>=1;i--){
		nxt[i]=(i<x?nxt[i+1]:i+1);
		for(int j=x;j>i;j--)
			if(max(l[i],l[j])<=min(r[i],r[j]))
				nxt[i]=min(nxt[i],j);
	}
	cin>>q;
	while(q--){
		int c1,c2,ans=0;cin>>c1>>c2;
		while(c1<=c2){
			ans++;
			c1=nxt[c1];
		}
		cout<<ans<<"\n";
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...