# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1253600 | mingga | Stone Arranging 2 (JOI23_ho_t1) | C++20 | 105 ms | 12700 KiB |
// Author: caption_mingle
#include "bits/stdc++.h"
using namespace std;
#define ln "\n"
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define ll long long
const int mod = 1e9 + 7;
const int inf = 2e9;
const int N = 2e5 + 7;
int n, a[N], nxt[N];
map<int, int> mp;
signed main() {
cin.tie(0) -> sync_with_stdio(0);
#define task ""
if(fopen(task ".INP", "r")) {
freopen(task ".INP", "r", stdin);
freopen(task ".OUT", "w", stdout);
}
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = n; i > 0; i--) {
if(mp.count(a[i])) {
nxt[i] = mp[a[i]];
}
mp[a[i]] = i;
}
for(int i = 1; i <= n; i++) {
if(nxt[i]) {
for(int j = i; j < nxt[i]; j++) {
a[j] = a[i];
}
i = nxt[i] - 1;
}
}
for(int i = 1; i <= n; i++) cout << a[i] << ln;
cerr << "\nTime: " << clock() * 1000 / CLOCKS_PER_SEC;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |