| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 786102 | 12345678 | Stone Arranging 2 (JOI23_ho_t1) | C++17 | 281 ms | 14192 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;
int n;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n;
vector<int> v(n), c(n);
map<int, int> m;
for (int i=0; i<n; i++) cin>>v[i], m[v[i]]=i;
int i=0;
while (i<n)
{
int cl=v[i];
while (i<=m[cl]) c[i]=cl, i++;
}
for (auto x:c) cout<<x<<'\n';
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
