| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 888210 | ace5 | Stone Arranging 2 (JOI23_ho_t1) | C++17 | 307 ms | 15452 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 main()
{
int n;
cin >> n;
int64_t a[n];
map<int,int> ls;
for(int i = 0;i < n;++i)
{
cin >> a[i];
ls[a[i]] = i+1;
}
for(int i = 0;i < n;++i)
{
if(ls[a[i]] > i)
{
for(int j = i;j < ls[a[i]];++j)
{
cout << a[i] << "\n";
}
i = ls[a[i]]-1;
}
else
{
cout << a[i] << "\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... | ||||
