제출 #1175311

#제출 시각아이디문제언어결과실행 시간메모리
1175311turali12Stone Arranging 2 (JOI23_ho_t1)C++20
0 / 100
1 ms324 KiB
#include<bits/stdc++.h>
using namespace std;
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int n;
    cin>>n;
    map<int,int>mp;
    map<int,int>idx;
    vector<int>v(n);
    for(int i=0;i<n;i++){
        cin>>v[i];
        if(mp[v[i]]+1==1){
            mp[v[i]]++;
            idx[v[i]]=i;
        }
    }
    vector<int>ans(n);
    for(int i=0;i<n;i++){
        if(mp[v[i]]==0){
            mp[v[i]]++;
            idx[v[i]]=i;
        }
        if(i!=idx[v[i]]){
            for(int j=idx[v[i]];j<=i;j++){
                ans[j]=v[i];
                if(v[j]!=v[i]){
                    mp[v[j]]--;
                }
            }
        }
        else{
            ans[i]=v[i];
        }
    }
    for(int i=0;i<n;i++){
        cout<<ans[i]<<'\n';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...