Submission #1175696

#TimeUsernameProblemLanguageResultExecution timeMemory
1175696bahaktlStone Arranging 2 (JOI23_ho_t1)C++20
100 / 100
138 ms16488 KiB
#include <bits/stdc++.h>   
using namespace std;
#define int long long
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
const int inf=1e16;
const int N=2e5+10;
const int mod=1e9+7;
int t[N*4],a[N];
int ans[N];
unordered_map<int,int>mp;
signed main () {
	ios_base::sync_with_stdio(false); cin.tie(nullptr);
	int n;
	cin>>n;
	map<int,int>mp;
	for(int i=1;i<=n;i++) {
		cin>>a[i];
		mp[a[i]]=i;
	}
	int pos=1;
	for(int i=1;i<=n;i++) {
		cout<<a[pos]<<"\n";
		if(mp[a[pos]]==i && a[pos]==a[i]) pos=i+1;
	}
}   
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...