제출 #1036813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1036813		ivaziva	Stone Arranging 2 (JOI23_ho_t1)	C++14	100 / 100	398 ms	19988 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define MAXN 200001

long long n;
long long a[MAXN];
map<long long,long long> poslednji;
long long ans[MAXN];

int main()
{
    cin>>n;
    for (long long i=1;i<=n;i++) cin>>a[i];
    for (long long i=1;i<=n;i++) poslednji[a[i]]=i;
    long long tren=1;
    while (tren<=n)
    {
        ans[tren]=a[tren];
        tren=poslednji[a[tren]];
        ans[tren]=a[tren];tren++;
    }
    for (long long i=2;i<=n;i++)
    {
        if (ans[i]!=0) continue;
        else ans[i]=ans[i-1];
    }
    for (long long i=1;i<=n;i++) cout<<ans[i]<<endl;
}

• Subtask 1: 25 / 25
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40