Submission #798831

#	Time	Username	Problem	Language	Result	Execution time	Memory
798831		vjudge1	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	241 ms	12896 KiB

Main

#include <bits/stdc++.h>

#define fi first
#define se second

const int N = 200200;
const int mod = 1e9 + 7;

using namespace std;

int main() {
    #ifdef zxc
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    int n;
    cin >> n;
    vector<int> a(n);
    map<int, int> last;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        last[a[i]] = i;
    }
    for (int i = 0; i < n; i++) {
        for (int j = i; j <= last[a[i]]; j++) {
            a[j] = a[i];
        }
        i = last[a[i]];
    }
    for (int x : a) {
        cout << x << "\n";
    }
}

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