Submission #1121343

#	Time	Username	Problem	Language	Result	Execution time	Memory
1121343		Tymond	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	306 ms	34920 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
 
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }
 
    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    int n;
    cin >> n;
    vi a(n);
    map<int, set<int>> m;
    vector<pii> vec;
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }

    for(int i = 0; i < n; i++){
        if(sz(vec) && vec.back().fi == a[i]){
            m[a[i]].erase(i - 1);
            vec.back().se++;
            m[a[i]].insert(i);
            continue;
        }

        if(sz(m[a[i]]) == 0){
            m[a[i]].insert(i);
            vec.pb(mp(a[i], i));
            continue;
        }

        int idx = *(--m[a[i]].end());
        while(vec.back().se > idx){
            m[vec.back().fi].erase(vec.back().se);
            vec.pop_back();
        }

        m[a[i]].erase(idx);
        vec.back().se = i;
        m[a[i]].insert(i);
    }

    int wsk = 0;
    for(int i = 0; i < n; i++){
        if(i > vec[wsk].se){
            wsk++;
        }

        cout << vec[wsk].fi << '\n';
    }

    return 0;
}

• Subtask 1: 25 / 25
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40