Submission #988772

#	Time	Username	Problem	Language	Result	Execution time	Memory
988772		HienTD	Stone Arranging 2 (JOI23_ho_t1)	C++11	0 / 100	1 ms	604 KiB

Main

#include <bits/stdc++.h>

using namespace std;

void solve(){
    int N; cin >> N;
    vector<int> A(N);
    for(int i = 1; i <= N; i ++) cin >> A[i];
    map<int, int> mp;
    for(int i = 1; i <= N; i ++) mp[A[i]] = max(mp[A[i]], i);
    vector<int> answer(N);
    int curpos = 1;
    while(curpos < N){
        int nxtpos = mp[A[curpos]] + 1;
        for(int i = curpos; i <= nxtpos; i ++) answer[i] = A[curpos];
        curpos = nxtpos;
    }
    for(int i = 1; i <= N; i ++) cout << answer[i] << endl;
}

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

    solve();
}

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