Submission #887628

#	Time	Username	Problem	Language	Result	Execution time	Memory
887628		GordonRemzi007	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	231 ms	14528 KiB

Main

#include <iostream>
#include <vector>
#include <map>

using namespace std;

int main() {
    int n, skip = -1;
    cin >> n;
    vector<int> a(n);
    map<int,int> last;
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        last[a[i]] = max(last[a[i]], i);
    }
    for(int i = 0; i < n; i++) {
        if(skip == -1) {
            if(last[a[i]] != i) skip = last[a[i]];
            cout << a[i] << "\n";
        } else cout << a[skip] << "\n";
        if(skip == i) skip = -1;
    }
}

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