Submission #1249644

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249644		norman165	Stone Arranging 2 (JOI23_ho_t1)	C++20	100 / 100	121 ms	18068 KiB

Main

#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
#define yes() cout << "YES\n"
#define no() cout << "NO\n"

using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;

const int inf = 1e18;
const int mod = 1e9 + 7;
const int maxn = 1e7 + 5e6;
const int mod1 = 998244353;
const int mod2 = 1e18 + 1;
const int mod3 = 1e9 + 9;
const int mod4 = 333333333;
const int mod5 = 200000;
const int mod6 = 10007;
const int k = 300;
const int w = 1e5;
const ld EPS = 1e-8;

int LOG = 30;

void solve() {
    int n;
    cin >> n;

    vector<int> a(n);
    for (int& i : a) cin >> i;

    vector<int> next(n, -1);
    map<int, int> mp;

    for (int i = n - 1; i >= 0; i--) {
        if (!mp.count(a[i])) mp[a[i]] = i;
        else {
            next[i] = mp[a[i]];
            mp[a[i]] = i;
        }
    }

    for (int i = 0; i < n; i++) {
        if (next[i] == -1) continue;
        else {
            int r = next[i];
            for (int j = i; j <= r; j++) a[j] = a[r];
            i = r - 1;
        }
    }

    for (int& i : a) cout << i << " ";
    cout << "\n";
}

signed main() {
    // cout.precision(16);

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;

    while (t--) {
        solve();
    }
}

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