Submission #342931

#	Time	Username	Problem	Language	Result	Execution time	Memory
342931		vonatlus	Money (IZhO17_money)	C++17	0 / 100	1 ms	364 KiB

money

/// wa 

#pragma GCC optimize("O3")
//#pragma comment(linker, "/STACK:36777216")

#include<bits/stdc++.h>

#define x first
#define y second
#define pb push_back
#define sz(x) (int) x.size()
#define all(z) (z).begin(), (z).end()
 
using namespace std;

using ll = long long;
using pii = pair<int, int>;                                   

const int MOD = 1e9 + 7; 
const int INF = 1e9 + 1e2;
  
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void fin() {
#ifdef AM
    freopen(".in", "r", stdin);
#endif        
}                   

const bool flag = 0;

const int N = 1e5+10;

void ma1n() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int& x : a) {
        cin >> x;
    }
    int cnt = 0;
    vector<int> v, cur;
    for (int i = 0; i < n; ++i) {
        if (i && a[i] >= a[i-1]) {
            cur.pb(a[i]);
        } else {
            cnt++;
            if (!cur.empty()) {
                v.insert(upper_bound(all(v), cur[0]), all(cur));
            }
            cur = {a[i]};
        }
    }
    if (!cur.empty()) {
        v.insert(upper_bound(all(v), cur[0]), all(cur));
    }
    if (is_sorted(all(v))) {
        cout << cnt;
    } else {
        cout << n;
    }
} 

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr), fin();
    int ts = 1;
    if (flag) {
        cin >> ts;
    }
    while (ts--) {
        ma1n(); 
    }
    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 20
• Subtask 4: 0 / 55