Submission #936966

#	Time	Username	Problem	Language	Result	Execution time	Memory
936966		tianyaochiun	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	142 ms	17140 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#define ll long long
#define pii pair<long long,long long> 
#define F first
#define S second
#define pb emplace_back
#define endl "\n"
#define all(a) a.begin(),a.end()
#define int long long

void solve(){
	int n;
	cin>>n;
	vector<pii> a;
	set<int> vis;
	for(int i=0;i<n;i++){
		int x;
		cin>>x;
		if(vis.find(x)==vis.end()){
			vis.insert(x);
			a.pb(x,i);
		}
		else{
			while(a.back().F!=x){
				vis.erase(a.back().F);
				a.pop_back();
			}
		}
	}
	int color,now=0;
	vector<int> ans;
	for(int i=0;i<n;i++){
		if(now<(int)a.size()&&a[now].S==i) color=a[now].F,now++;
		cout<<color<<endl;
	}
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

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