Submission #988784

#	Time	Username	Problem	Language	Result	Execution time	Memory
988784		HienTD	Stone Arranging 2 (JOI23_ho_t1)	C++11	100 / 100	170 ms	13536 KiB

Main

#include <bits/stdc++.h>

using namespace std;

void solve(){
    int N; cin >> N;
    vector<int> a(N);
    for(int i = 0; i < N; i ++) cin >> a[i];
    vector<int> ans(N);
    map<int, int> mp;
    for(int i = 0; i < N; i ++) mp[a[i]] = max(mp[a[i]], i);
    int curpos = 0;
    while(curpos != N){
        int nextpos = mp[a[curpos]] + 1;
        for(int i = curpos; i < nextpos; i ++) ans[i] = a[curpos];
        curpos = nextpos;
    }
    for(int i = 0; i < N; i ++) cout << ans[i] << '\n';
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    solve();
}

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