# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
758246 | vjudge1 | Money (IZhO17_money) | C++17 | 1 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = 1e6 + 7;
int n, arr[mxN];
int rec(int i, vector<vector<int>> vec) {
if (i == n) {
bool ok = true;
set<int> cur;
for (int i = 0; i < vec.size() && ok; ++i) {
assert(vec[i].size());
auto it1 = cur.upper_bound(vec[i][0]);
auto it2 = cur.upper_bound(vec[i].back());
if (it1 != it2) {
ok = false;
}
for (auto x : vec[i]) {
cur.insert(x);
}
}
return (ok ? vec.size() : n);
}
int res = n;
if (vec.size() && vec.back().back() <= arr[i]) {
vec.back().push_back(arr[i]);
res = min(res, rec(i + 1, vec));
vec.back().pop_back();
}
vec.push_back({arr[i]});
return min(res, rec(i + 1, vec));
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
cout << rec(0, {});
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |