제출 #1156496

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1156496		dosts	Stone Arranging 2 (JOI23_ho_t1)	C++20	100 / 100	89 ms	25316 KiB

Main

//Siga Siga?! YES!
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<    
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>

const int inf = 1e18,N = 3e3+1,MOD =  998244353;


void solve() {  
    int n;
    cin >> n;
    vi a(n+1);
    for (int i=1;i<=n;i++) cin >> a[i];
    unordered_map<int,vector<int>> mp;
    vi pq;
    for (int i=1;i<=n;i++) {
        while (!pq.empty() && !mp[a[i]].empty() && pq.back() > mp[a[i]].back()) {
            mp[a[pq.back()]].pop_back();
            pq.pop_back();
        }
        mp[a[i]].push_back(i);
        pq.push_back(i);
    }
    vi ans(n+1,0);
    int ptr = n;
    while (!pq.empty()) {
        while (pq.back() <= ptr) ans[ptr--] = a[pq.back()];
        pq.pop_back();
    }
    for (int i=1;i<=n;i++) cout << ans[i] << '\n';
}


int32_t main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #ifdef Dodi 
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t;
    while (t --> 0) solve();
}

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