Submission #764206

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
764206	2023-06-23T08:36:08 Z	vjudge1	Exam (eJOI20_exam)	C++14	26 / 100	1000 ms	295344 KB

exam

//srand(time(0)) - always changing
//order_of_key(k): Number of items strictly smaller than k .
//find_by_order(k): K-th element in a set (counting from zero).
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>

using namespace std;

int n, ans = 0;
vector <int> a, b;
map <vector <int>, bool> was;

void rec(vector <int> a) {
	if (was[a]) return;
	else was[a] = 1;
	for (int i = 0; i < n - 1; i++) {
		int mn = a[i];
		int mx = a[i];
		for (int j = i + 1; j < n; j++) {
			mn = min(mn, a[j]);
			mx = max(mx, a[j]);
			if (mn < mx) {
				vector <int> act = a;
				for (int k = i; k <= j; k++) {
					act[k] = mx;
				}
				rec(act);
			}
		}
	}
	int cnt = 0;
	for (int i = 0; i < n; i++) {
		if (a[i] == b[i]) cnt++;
	}
	ans = max(ans, cnt);
}

		bool used[100004];

void solve() {
	bool sub1 = true;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		a.push_back(x);
	}
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		b.push_back(x);
		if (i > 1) {
			if (b[i - 1] != b[i - 2]) sub1 = false;
		}
	}
	if (sub1) {
		int cnt = 0;
		for (int i = 0; i < n; i++) {
			if (a[i] != b[i] || used[i]) continue;
			cnt++;
			for (int j = i - 1; j >= 0; j--) {
				if (a[j] >= a[i] || used[j]) break;
				a[j] = a[i];
				used[j] = 1;
				cnt++;
//				cout << j << ' ' << a[j] << ' ' << cnt << '\n';
			}
			for (int j = i + 1; j < n; j++) {
				if (a[j] >= a[i] || used[j]) break;
				a[j] = a[i];
				cnt++;
				used[j] = 1;
//				cout << j << ' ' << a[j] << ' ' << cnt << '\n';
			}
			used[i] = 1;
		}		
		cout << cnt;
		return;
	}
	rec(a);
	cout << ans;
}

const bool Cases = 0;

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int TT = 1;
	if (Cases) cin >> TT;
	while (TT--) {
		solve();
	}
}

Subtask #1

14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	102 ms	2380 KB	Output is correct

Subtask #2

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	5 ms	540 KB	Output is correct
3	Correct	11 ms	1348 KB	Output is correct
4	Correct	9 ms	1412 KB	Output is correct
5	Correct	16 ms	1424 KB	Output is correct
6	Correct	9 ms	1428 KB	Output is correct
7	Correct	10 ms	1508 KB	Output is correct
8	Correct	17 ms	1468 KB	Output is correct

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	456 ms	8504 KB	Output is correct
2	Execution timed out	1074 ms	3544 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1093 ms	295344 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	102 ms	2380 KB	Output is correct
7	Correct	10 ms	432 KB	Output is correct
8	Execution timed out	1085 ms	1784 KB	Time limit exceeded
9	Halted	0 ms	0 KB	-

Subtask #6

0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	102 ms	2380 KB	Output is correct
7	Correct	456 ms	8504 KB	Output is correct
8	Execution timed out	1074 ms	3544 KB	Time limit exceeded
9	Halted	0 ms	0 KB	-