Submission #1175340

#	Time	Username	Problem	Language	Result	Execution time	Memory
1175340		bahaktl	Stone Arranging 2 (JOI23_ho_t1)	C++20	35 / 100	19 ms	3956 KiB

Main

#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;
	int a[n+1];	
	for(int i=1;i<=n;i++) {
		cin>>a[i];
		ans[i]=a[i];
	}
	for(int i=n;i>=1;i--){
		if(mp[a[i]]>0){
			continue;
		}
		mp[a[i]]=i;
	}
	int l=1;
	int r=1;
	while(l<n){
		if(mp[a[l]]==l){
			mp[a[l]]=0;
		}
		if(mp[a[l]]==0){
			l++;
			ans[a[l]]=a[l];
			continue;
		}
		int z=mp[a[l]];
		for(int i=l+1;i<=mp[a[l]];i++){
			ans[i]=a[l];
			if(mp[a[i]]==i){
				mp[a[i]]=0;
				continue;
			}
		}
		l=z+1;
	}
	for(int i=1;i<=n;i++){
		cout<<ans[i]<<" ";
	}
}   

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