Submission #919593

#TimeUsernameProblemLanguageResultExecution timeMemory
919593Younis_DwaiStone Arranging 2 (JOI23_ho_t1)C++14
0 / 100
2 ms2392 KiB
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define in insert
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define mid (l+r)/2
#define pop pop_back
//#define all(v) v.begin(),v.end()
using namespace std;
const int M=998244353;
int n,a[200001],b[200001];
map<int,set<int>> mp;
int32_t main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        mp[a[i]].in(i);
        set<int> s=mp[a[i]];
        if(s.size()>=2){
            for(int j=*prev(prev(s.end()));j<=*prev(s.end());j++){
                    b[j]=a[i];
                    if(mp[a[j]].find(j)!=mp[a[j]].end()) mp[a[j]].erase(j);
            }
        }
    }
    for(int i=1;i<=n;i++) cout<<b[i]<<' ';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...