제출 #537098

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
537098		kshitij_sodani	Arcade (NOI20_arcade)	C++14	100 / 100	287 ms	34036 KiB

Arcade

//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'
 
 
llo n,m;
llo ans[1000001];
llo aa[1000001];
llo bb[1000001];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>m>>n;
	vector<pair<pair<llo,llo>,llo>> ss;
	for(int i=0;i<n;i++){
		cin>>bb[i];
	}
	for(int i=0;i<n;i++){
		cin>>aa[i];
	}
	for(llo i=0;i<n;i++){
	//	cin>>aa[i]>>bb[i];
	//	cout<<aa[i]+bb[i]<<","<<bb[i]-aa[i]<<endl;
		ss.pb({{aa[i]+bb[i],bb[i]-aa[i]},i});
	}
	sort(ss.begin(),ss.end());
	llo ind=1;
	set<pair<llo,llo>> xx;
	for(auto j:ss){
		auto k=xx.upper_bound({j.a.b+1,-1});
		if(k==xx.begin()){
			ans[j.b]=ind;
			ind++;
		}
		else{
			k--;
			//cout<<j.b<<":"<<(*k).b<<endl;
			ans[j.b]=ans[(*k).b];
			xx.erase(k);
		}
		xx.insert({j.a.b,j.b});
	}
	cout<<ind-1<<endl;
	/*for(llo i=0;i<n;i++){
		cout<<aa[i]<<" "<<bb[i]<<" "<<ans[i]<<endl;
	}*/
 
 
 
 
 
 
 
 
	return 0;
}
 

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 21 / 21
• Subtask 5: 14 / 14
• Subtask 6: 20 / 20
• Subtask 7: 15 / 15