oj.uz

Submission #386269

# Submission time Handle Problem Language Result Execution time Memory
386269 2021-04-06T08:49:56 Z kshitij_sodani Kralj (COCI16_kralj) C++14
140 / 140
 732 ms 45452 KB 
//#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'


int n;
int aa[500001];
int bb[500001];
int ind[500001];

int co[500001];
vector<int> ss[500001];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>ind[i];
		ind[i]--;
		co[ind[i]]++;
	}

	for(int i=0;i<n;i++){
		cin>>aa[i];

	}
	for(int i=0;i<n;i++){
		cin>>bb[i];
	}
	for(int i=0;i<n;i++){
		ss[ind[i]].pb(bb[i]);
	}
	for(int i=1;i<n;i++){
		co[i]+=co[i-1];
	}
	pair<int,int> mi={n+1,-1};
	for(int i=0;i<n;i++){
		co[i]-=(i+1);
		if(co[i]<mi.a){
			mi={co[i],i};
		}
	}
	int xx=(mi.b+1);
	if(xx==n){
		xx=0;
	}
	set<int> cur;
	int ans=0;
	for(int i=0;i<n;i++){
		for(auto j:ss[xx]){
			cur.insert(j);
		}
		auto k=cur.upper_bound(aa[xx]);
		if(k!=cur.end()){
			ans++;
			cur.erase(k);
		}
		else{
			cur.erase(cur.begin());
		}
		xx=(xx+1);
		if(xx==n){
			xx=0;
		}
	}




	cout<<ans<<endl;









 
 
	return 0;
}

Subtask #1
140.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 732 ms 38756 KB Output is correct
2 Correct 447 ms 38116 KB Output is correct
3 Correct 576 ms 44772 KB Output is correct
4 Correct 642 ms 45452 KB Output is correct
5 Correct 344 ms 22636 KB Output is correct
6 Correct 291 ms 22892 KB Output is correct
7 Correct 398 ms 25836 KB Output is correct
8 Correct 334 ms 25280 KB Output is correct
9 Correct 417 ms 26476 KB Output is correct
10 Correct 343 ms 24064 KB Output is correct