답안 #1103536

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1103536	2024-10-21T07:50:27 Z	stdfloat	Money (IZhO17_money)	C++17	0 / 100	1 ms	520 KB

money

#include <bits/stdc++.h>
using namespace std;

#define ff	first
#define ss	second
#define pii	pair<int, int>

#define sz(v)	(int)(v).size()
#define all(v)	(v).begin(), (v).end()

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int n;
	cin >> n;

	vector<int> a(n);
	for (auto &i : a) {
		cin >> i; i--;
	}

	int mn = INT_MAX;
	for (int mk = 0; mk < 1 << (n - 1); mk++) {
		bool tr = true;
		int pre = -1, cnt = 0;
		map<int, vector<int>> m;
		for (int i = 0; i < n && tr; i++) {
			if (i != n - 1 && !((mk >> i) & 1)) continue;

			for (int j = pre + 1; j < i && tr; j++) {
				tr = (a[j] <= a[j + 1]);
				m[a[j]].push_back(a[j + 1]);
			}

			cnt++; pre = i;
		}

		if (!tr) continue;
	
		set<int> s = {INT_MAX};
		for (auto i : m) {
			for (auto j : i.ss) {
				if (*s.upper_bound(i.ff) < j) {
					tr = false; break;
				}
			}

			if (!tr) break;

			for (auto j : i.ss)
				s.insert(j);
		}

		if (tr) mn = min(mn, cnt);
	}

	assert(mn != INT_MAX);

	cout << mn;
}

Subtask #1

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	512 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	520 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Incorrect	1 ms	336 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #2

0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	512 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	520 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Incorrect	1 ms	336 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	512 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	520 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Incorrect	1 ms	336 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #4

0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	512 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	520 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Incorrect	1 ms	336 KB	Output isn't correct
11	Halted	0 ms	0 KB	-