| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1370024 | Charizard2021 | Stone Arranging 2 (JOI23_ho_t1) | C++20 | 184 ms | 13168 KiB |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(1 + n);
map<int, int> mp;
for(int i = 1; i <= n; i++){
cin >> a[i];
mp[a[i]] = i;
}
vector<int> ans(1 + n);
int idx = 1;
while(idx <= n){
for(int i = idx; i <= mp[a[idx]]; i++){
ans[i] = a[idx];
}
idx = mp[a[idx]] + 1;
}
for(int i = 1; i <= n; i++){
cout << ans[i] << "\n";
}
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
