Submission #1042557

#	Time	Username	Problem	Language	Result	Execution time	Memory
1042557		Whisper	Money (IZhO17_money)	C++17	100 / 100	128 ms	22908 KiB

money

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX             1000005
int nArr;
int A[MAX];

struct FenwickTree{
    vector<int> F;
    int n;
    FenwickTree(int _n = 0){
        this -> n = _n;
        F.resize(n + 5, 0);
    }
    int low_bit(int p){
        return p & (-p);
    }

    void upd(int p){
        for (; p <= n; p += low_bit(p)){
            F[p]++;
        }
    }
    int query(int p){
        int res = 0;
        for (; p > 0; p -= low_bit(p)){
            res += F[p];
        }
        return res;
    }
    int query(int l, int r){
        return query(r) - query(l - 1);
    }
};

void process(void){
    cin >> nArr;
    for (int i = 1; i <= nArr; ++i) cin >> A[i];

    int ans = 1;
    int lim = *max_element(A + 1, A + nArr + 1);
    int head = 1;
    FenwickTree ft(lim);

    ft.upd(A[1]);
    for (int i = 2; i <= nArr; ++i){
        if (A[i] < A[i - 1]){
            while(head < i) ft.upd(A[head++]);
            ++ans;
            continue;
        }
        if(ft.query(A[head] + 1, A[i] - 1) > 0){
            while(head < i) ft.upd(A[head++]);
            ++ans;
        }
    }
    cout << ans;
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

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