Submission #1179647

#TimeUsernameProblemLanguageResultExecution timeMemory
1179647user736482Stone Arranging 2 (JOI23_ho_t1)C++20
100 / 100
162 ms21732 KiB
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define MOD 1000000009
#define INF 1000000019
#define INFL 1000000000000000099LL

ll n,q,s,t,a,b,c,ans=INFL,k,m;
vector<ll>v2;
vector<pair<ll,ll>>v;
map<ll,ll>ile;
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n;
    for(ll i=0;i<n;i++){
        cin>>a;
        if(!ile[a]){
            v.pb({i,a});
            ile[a]++;
        }
        else
            while(v.back().ss!=a){
                ile[v.back().ss]--;
                v.pop_back();
            }
    }
    for(ll i=n-1;i>=0;i--){
        if(v.back().ff>i)v.pop_back();
        v2.pb(v.back().ss);
    }
    for(ll i=n-1;i>=0;i--)cout<<v2[i]<<" ";
    
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...