Submission #928996

#TimeUsernameProblemLanguageResultExecution timeMemory
928996SuPythonyStone Arranging 2 (JOI23_ho_t1)C++17
100 / 100
153 ms14132 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n; cin>>n;
    unordered_map<int,int> f;
    vector<int> cols;
    for (int i=0; i<n; i++) {
        int c; cin>>c;
        cols.push_back(c);
        f[c]=i;
    }
    int prev=cols[0];
    cout<<cols[0]<<"\n";
    for (int i=1; i<n; i++) {
        if (i<=f[prev]) {
            cout<<prev<<"\n";
        } else {
            prev=cols[i];
            cout<<prev<<"\n";
        }
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...