| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 524004 | Nursik | Money (IZhO17_money) | C++14 | 1514 ms | 6224 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>
#define pb push_back
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair
const ll maxn = 1e6 + 1, maxm = 3e5 + 1, maxk = 61;
const ll inf = 1000000000, mod = inf + 7, mod2 = 998244353;
const ll pa = 31, block = 400;
using namespace std;
int n;
int a[maxn];
int main(){
cin >> n;
for (int i = 1; i <= n; ++i){
cin >> a[i];
}
int pos = 1, ans = 0;
vector<int> v;
v.pb(0), v.pb(inf);
while (pos <= n){
int mx = 0, mn = inf, answ = pos;;
for (int j = pos; j <= n; ++j){
if ((j == pos) || (j - 1 >= pos && a[j] >= a[j - 1])){
mx = max(mx, a[j]);
mn = min(mn, a[j]);
int ok = 0;
for (int k = 0; k < v.size() - 1; ++k){
if (v[k] <= mn && mx <= v[k + 1]){
ok = 1;
break;
}
}
if (ok == 1){
answ = j;
}
else{
break;
}
}
else{
// cout << a[j] << " " << a[j - 1] << '\n';
break;
}
}
mn = inf, mx = 0;
for (int j = pos; j <= answ; ++j){
mn = min(mn, a[j]);
mx = max(mx, a[j]);
}
for (int k = 0; k < v.size() - 1; ++k){
if (v[k] <= mn && mx <= v[k + 1]){
vector<int> nw;
for (int i = 0; i <= k; ++i){
nw.pb(v[i]);
}
for (int j = pos; j <= answ; ++j){
nw.pb(a[j]);
}
for (int i = k + 1; i < v.size(); ++i){
nw.pb(v[i]);
}
v = nw;
break;
}
}
ans++;
pos = answ + 1;
}
cout << ans;
}
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... | ||||
