Submission #1186148

#	Time	Username	Problem	Language	Result	Execution time	Memory
1186148		elotelo966	Inspections (NOI23_inspections)	C++20	29 / 100	2097 ms	144120 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define OYY LLONG_MAX
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define fi first
#define se second
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define pb push_back
#define lim 500005

const int mod=1000000007;

int n,m,q;

int l[lim],r[lim];

map<int,int>mp;

int32_t main(){
	faster
	cin>>n>>m>>q;
	
	vector<int> tut;
	
	int ptr=0;
	
	for(int i=1;i<=m;i++){
		cin>>l[i]>>r[i];
		for(int j=l[i];j<=r[i];j++){
			if(mp.find(j)==mp.end())mp[j]=++ptr;
			else{
				tut.pb(ptr-mp[j]);
				mp[j]=++ptr;
			}
		}
	}
	
	sort(tut.begin(),tut.end());
	
	while(q--){
		int x;cin>>x;
		int ind=lower_bound(tut.begin(),tut.end(),x)-tut.begin();
		cout<<tut.size()-ind<<" ";
	}
	
	cout<<'\n';
	
	return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 18 / 18
• Subtask 3: 0 / 22
• Subtask 4: 0 / 26
• Subtask 5: 0 / 23