# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1275956 | KALARRY | Stone Arranging 2 (JOI23_ho_t1) | C++20 | 157 ms | 13356 KiB |
//chockolateman
#include<bits/stdc++.h>
using namespace std;
int N,a[200005],nxt[200005];
map<int,int> appear;
int main()
{
scanf("%d",&N);
for(int i = 1 ; i <= N ; i++)
scanf("%d",&a[i]);
for(int i = N ; i >= 1 ; i--)
{
nxt[i] = appear[a[i]];
appear[a[i]] = i;
}
for(int l = 1 ; l <= N ; l++)
{
int r = nxt[l];
if(r!=0)
{
while(l < r)
{
printf("%d\n",a[r]);
l++;
}
l--;
}
else
printf("%d\n",a[l]);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |