oj.uz

답안 #295183

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
295183 2020-09-09T14:10:04 Z shivensinha4 Kralj (COCI16_kralj) C++17
140 / 140
 796 ms 43500 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#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

# 결과 실행 시간 메모리 Grader output
1 Correct 796 ms 34924 KB Output is correct
2 Correct 457 ms 34156 KB Output is correct
3 Correct 598 ms 42604 KB Output is correct
4 Correct 601 ms 43500 KB Output is correct
5 Correct 401 ms 19704 KB Output is correct
6 Correct 337 ms 20088 KB Output is correct
7 Correct 460 ms 23288 KB Output is correct
8 Correct 370 ms 21912 KB Output is correct
9 Correct 476 ms 24568 KB Output is correct
10 Correct 394 ms 21880 KB Output is correct