Submission #774720

#TimeUsernameProblemLanguageResultExecution timeMemory
774720vjudge1Stone Arranging 2 (JOI23_ho_t1)C++17
25 / 100
2079 ms1620 KiB
#include<bits/stdc++.h>

#define MaxN 200005

using namespace std;

int n, a[MaxN];


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);


    cin >> n;
    for(int i = 1; i <= n; ++i) cin >> a[i];


    for(int i = 1; i <= n; ++i) {
        int j;
        for(j = i-1; j >= 1; --j) {
            if (a[j] == a[i]) {
                break;
            }
        }
        if (j > 0) {
            while(j < i) {
                a[j] = a[i];
                ++j;
            }
        }
    }


    for(int i = 1; i <= n; ++i) cout << a[i] << "\n";


    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...