| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1144648 | Nomio | Stone Arranging 2 (JOI23_ho_t1) | C++20 | 169 ms | 12616 KiB |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
map<int, int> m;
int n;
cin >> n;
int a[n + 1];
for(int i = 1; i <= n; i++) {
cin >> a[i];
m[a[i]] = i;
}
for(int i = 1; i <= n; i++) {
int sz = m[a[i]] - i + 1;
for(int j = 0; j < sz; j++) {
cout << a[i] << '\n';
}
i += (sz - 1);
}
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... | ||||
