Submission #1241392

#	Time	Username	Problem	Language	Result	Execution time	Memory
1241392		M_SH_O	Stone Arranging 2 (JOI23_ho_t1)	C++20	100 / 100	125 ms	16336 KiB

Main

/*#pragma GCC optimize("O3")
#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")*/
#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000007
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(time(0));
ll randll(ll l, ll r) {
    return uniform_int_distribution<ll>(l, r)(rng);
}

vector<vector<pair<ll, pll>>> g;

int main(){
    speed;
    srand(time(0));

    ll n;
    cin >> n;
    vll a(n);
    map<ll, vll> m;
    for (int i = 0; i < n ;i ++) {
        cin >> a[i];
    }

    vpll v;
    set<ll> s;
    for (int i =0; i < n; i ++) {
        if (s.find(a[i]) == s.end()) {
            s.insert(a[i]);
            v.pb({a[i], 1});
        }
        else{
            ll k = 1;
            while (v.back().fr != a[i]) {
                k += v.back().se;
                s.erase(v.back().fr);
                v.pop_back();
            }
            v.back().se += k;
        }
    }
    for (auto i : v) {
        for (int j = 0; j < i.se; j ++) {
            cout << i.fr << endl;
        }
    }
    

}

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