Submission #1277534

#	Time	Username	Problem	Language	Result	Execution time	Memory
1277534		nanaseyuzuki	Stone Arranging 2 (JOI23_ho_t1)	C++20	100 / 100	159 ms	21196 KiB

Main

#include <bits/stdc++.h>
// Author: Kazuki_Will_Win_VOI_8703 
#define fi first
#define se second
#define pii pair<int, int>
#define int long long
#define all(a) a.begin(), a.end()
using namespace std;

const int mn = 2e5 + 5, inf = 1e18;

int n, q, a[mn], w[mn], ans[mn];
map<int, int> on;

void solve(){
    cin >> n;
    stack <int> st;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        if(!on[a[i]]){
            on[a[i]] = i;
            w[i] = 1;
            st.push(i);
        }
        else{
            while(st.size() && st.top() > on[a[i]]){
                if(w[st.top()]){
                    w[st.top()] = 0;
                    on[a[st.top()]] = 0;
                }
                st.pop();
            }
        }
    }
    for(int i = n; i >= 1; i--){
        if(st.top() > i) st.pop();
        ans[i] = a[st.top()];
    }
    for(int i = 1; i <= n; i++) cout << ans[i] << "\n";
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int t = 1;
    // cin >> t;
    while(t--) solve();
}

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