| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1006094 | VMaksimoski008 | Stone Arranging 2 (JOI23_ho_t1) | C++17 | 169 ms | 14492 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
vector<int> v(n);
map<int, int> mp;
for(int i=0; i<n; i++) cin >> v[i], mp[v[i]] = i;
for(int i=0; i<n-1; i++)
if(mp[v[i]] > i) v[i+1] = v[i];
for(int &x : v) cout << x << '\n';
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
