Submission #464836

#	Time	Username	Problem	Language	Result	Execution time	Memory
464836		TeaTime	Money (IZhO17_money)	C++17	0 / 100	1 ms	312 KiB

money

//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>

using namespace std;

#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);

typedef long long ll;
typedef long double ld;

const ll INF = 1e9;

ll n;
vector<ll> vec;

signed main() {
    fastInp;

    cin >> n;
    vec.resize(n);

    for (auto& c : vec) cin >> c;

    set<ll> left;
    for (int i = 1; i <= n; i++) left.insert(i);

    ll ans = 0;
    left.insert(n + 1);
    while (!vec.empty()) {
        ans++;
        ll cur = vec.back();
        vector<ll> del;
        del.push_back(cur);
        vec.pop_back();
        while (vec.size() > 0 && left.size() > 0 && (*left.upper_bound(vec.back())) == cur) {
            cur = vec.back();
            vec.pop_back();
            del.push_back(cur);
        }

        for (auto c : del) left.erase(c);
    }

    cout << ans;
   
    return 0;
}

/*
3 4
RGWR
GRGG
RGWW

4 4
RGWR
GRRG
WGGW
WWWR

5 5
RGRGW
GRRGW
WGGWR
RWRGW
RGWGW
*/

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