제출 #1325378

#제출 시각아이디문제언어결과실행 시간메모리
1325378PoonYaPatStone Arranging 2 (JOI23_ho_t1)C++20
100 / 100
204 ms13336 KiB
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n; cin>>n;
    map<int,int> cnt;
    vector<pii> v;
    for (int i=1; i<=n; ++i) {
        int x; cin>>x;
        if (cnt[x]) {
            int cc=1;
            while (v.size() && v.back().first!=x) {
                cc+=v.back().second;
                cnt[v.back().first]-=v.back().second;
                v.pop_back();
            }
            cnt[x]+=cc;
            int temp=v.back().second+cc;
            v.pop_back();
            v.push_back(pii(x,temp));
        } else {
            ++cnt[x];
            v.push_back(pii(x,1));
        }
    }
    for (auto s : v) {
        for (int i=0; i<s.second; ++i) cout<<s.first<<"\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...