| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1007439 | AtinaR | Stone Arranging 2 (JOI23_ho_t1) | C++14 | 384 ms | 14508 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;
int niza[n];
for(int i=0; i<n; i++)
{
cin>>niza[i];
}
map<int,int> last;
for(int i=0; i<n; i++)
{
last[niza[i]]=i;
}
int i=0;
while(i<n)
{
int next=last[niza[i]];
int val=niza[i];
while(i<=next)
{
cout<<val<<endl;
i++;
}
}
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... | ||||
