oj.uz

Submission #750408

# Submission time Handle Problem Language Result Execution time Memory
750408 2023-05-29T13:26:27 Z vjudge1 Event Hopping (BOI22_events) C++17
0 / 100
 153 ms 16752 KB 
#include<bits/stdc++.h>
using namespace std;
int sz=0;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	//cout.tie(0);
	int n,m;
	cin>>n>>m;
	vector<int>allind;
	vector<pair<int,int>>all(n);
	for(int i=0;i<n;i++){
		cin>>all[i].first>>all[i].second;
		allind.push_back(all[i].first);
		allind.push_back(all[i].second);
	}
	sort(allind.begin(),allind.end());
	allind.resize(unique(allind.begin(),allind.end())-allind.begin());
	sz=(int)allind.size();
	vector<vector<pair<int,pair<int,int>>>>quer(sz+10);
	vector<vector<int>>addy(sz+1);
	for(int i=0;i<n;i++){
		int p=lower_bound(allind.begin(),allind.end(),all[i].second)-allind.begin();
		int pp=lower_bound(allind.begin(),allind.end(),all[i].first)-allind.begin();
		addy[p].push_back(pp);
	}
	for(int i=0;i<m;i++){
		int l,r;
		cin>>l>>r;
		l--;
		r--;
		int ppp=lower_bound(allind.begin(),allind.end(),all[r].first)-allind.begin();
		int p=lower_bound(allind.begin(),allind.end(),all[r].second)-allind.begin();
		int pp=lower_bound(allind.begin(),allind.end(),all[l].second)-allind.begin();
		quer[p].push_back(make_pair(pp,make_pair(i,ppp)));	
	}
	vector<pair<int,int>>v;
	vector<int>vv;
	vector<int>res(m+10);
	for(int i=0;i<sz;i++){
		for(auto x:addy[i]){
			while((int)v.size()>0&&v.back().first>=x){
				if((int)vv.size()>0&&vv.back()==v.size()){
					vv.pop_back();
				}
				v.pop_back();
			}
			while(v.size()>1&&v[(int)v.size()-2].second>=x){
				if((int)vv.size()>0&&vv.back()==v.size()){
					vv.pop_back();
				}
				v.pop_back();
			}
			if((int)v.size()!=0&&v.back().second==i){
				continue;
			}
			v.push_back(make_pair(x,i));
			if((int)v.size()==1||v[(int)v.size()-2].second<v.back().first){
				vv.push_back((int)v.size());
			}
		}
		//cout<<i<<" "<<allind[i]<<": \n";
		for(auto x:v){
			//cout<<x.first<<" "<<x.second<<"\n";
		}
		for(auto x:vv){
			//cout<<x<<"\n";
		}
		//cout<<"tamam\n";
		for(auto x:quer[i]){
			int z=lower_bound(v.begin(),v.end(),make_pair(x.first+1,-1))-v.begin();
			z--;
			if(x.first<=i&&x.first>=x.second.second){
				res[x.second.first]=0;
				continue;
			}
			//cout<<i<<" "<<allind[i]<<" "<<vv.back()<<" "<<z<<"\n";
			if(x.first>i||((int)vv.size()>0&&vv.back()>z+1)){
				res[x.second.first]=-1;
				continue;
			}
			res[x.second.first]=1+(int)v.size()-1-z;
			if(x.second.second!=v.back().first){
				if((int)v.size()==1||v[(int)v.size()-2].second<x.second.second){
					res[x.second.first]++;
				}
			}
		}
	}
	for(int i=0;i<m;i++){
		if(res[i]==-1){
			cout<<"impossible\n";
		}
		else{
			cout<<res[i]<<"\n";
		}
	}
}

Compilation message

events.cpp: In function 'int main()':
events.cpp:44:35: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     if((int)vv.size()>0&&vv.back()==v.size()){
      |                          ~~~~~~~~~^~~~~~~~~~
events.cpp:50:35: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     if((int)vv.size()>0&&vv.back()==v.size()){
      |                          ~~~~~~~~~^~~~~~~~~~
events.cpp:64:12: warning: variable 'x' set but not used [-Wunused-but-set-variable]
   64 |   for(auto x:v){
      |            ^
events.cpp:67:12: warning: unused variable 'x' [-Wunused-variable]
   67 |   for(auto x:vv){
      |            ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 109 ms 16752 KB Output is correct
3 Correct 115 ms 16408 KB Output is correct
4 Incorrect 126 ms 16252 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 16740 KB Output is correct
2 Correct 153 ms 16412 KB Output is correct
3 Incorrect 116 ms 16204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 109 ms 16752 KB Output is correct
3 Correct 115 ms 16408 KB Output is correct
4 Incorrect 126 ms 16252 KB Output isn't correct
5 Halted 0 ms 0 KB -