# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1190575 | Abdalaziz_Alshami | Stone Arranging 2 (JOI23_ho_t1) | C++20 | 336 ms | 13352 KiB |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n; cin>>n;
map<int,int>m;
int a[n],ans[n]; for(int i=0;i<n;i++) cin>>a[i],ans[i]=0,m[a[i]]=i;
for(int i=0;i<n;i++)
{
for(int j=i;j<=m[a[i]];j++) ans[j]=a[i];
i=m[a[i]];
}
for(int i=0;i<n;i++) cout<<ans[i]<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |