Submission #1364474

#TimeUsernameProblemLanguageResultExecution timeMemory
1364474clemmy14Stone Arranging 2 (JOI23_ho_t1)C++20
100 / 100
154 ms13480 KiB
#include<bits/stdc++.h>
using namespace std;

signed main() {
    int n; cin >> n;
    vector<int> v(n);
    for(int i=0; i<n; i++) cin >> v[i];
    map<int, int> lastSeen;
    for(int i=0; i<n; i++) {
        lastSeen[v[i]]=i;
    }
    vector<int> ans;
    int idx=0;
    while(idx != n) {
        int last = lastSeen[v[idx]];
        for(int i=idx; i<=last; i++) ans.push_back(v[idx]);
        idx=last+1;
    }
    for(auto x : ans) cout << x << '\n';
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...