oj.uz

Submission #295179

# Submission time Handle Problem Language Result Execution time Memory
295179 2020-09-09T14:08:33 Z shivensinha4 Kralj (COCI16_kralj) C++17
140 / 140
 774 ms 43628 KB 
#include <bits/stdc++.h> 
using namespace std; 
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
//#define endl '\n'


int main() {
	#ifdef shiven
	freopen("test.in", "r", stdin);
	#endif
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n; cin >> n;
	vi a(n), b(n), advPref(n);
	vector<vi> elfHere(n);
	for_(i, 0, n) {
		int k; cin >> k;
		k -= 1;
		advPref[k] += 1;
		elfHere[k].push_back(i);
	}
	for_(i, 0, n) cin >> a[i];
	for_(i, 0, n) cin >> b[i];
	
	int mn = INT_MAX, mnIdx = -1;
	for_(i, 0, n) {
		if (i > 0) advPref[i] += advPref[i-1];
		if (advPref[i]-i < mn) {
			mn = advPref[i]-i;
			mnIdx = i;
		}
	}

	//cout << "mn: " << mnIdx << endl;
	mnIdx += 1;
	int ans = 0;
	set<int> s;
	for_(idx, 0, n) {
		int i = (mnIdx + idx);
		if (i >= n) i -= n;
		for (auto j: elfHere[i]) s.insert(b[j]);
		auto pt = s.lower_bound(a[i]);
		if (pt == s.end()) {
			s.erase(s.begin());
		} else {
			ans += 1;
			s.erase(pt);
		}
	}
	
	cout << ans << endl;

	return 0;
}

Subtask #1
140.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 774 ms 35052 KB Output is correct
2 Correct 480 ms 34160 KB Output is correct
3 Correct 596 ms 42476 KB Output is correct
4 Correct 602 ms 43628 KB Output is correct
5 Correct 404 ms 19832 KB Output is correct
6 Correct 342 ms 20088 KB Output is correct
7 Correct 466 ms 23416 KB Output is correct
8 Correct 382 ms 21752 KB Output is correct
9 Correct 479 ms 24568 KB Output is correct
10 Correct 402 ms 21932 KB Output is correct