제출 #977960

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977960		Angus_Yeung	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	175 ms	21680 KiB

Main

#include <bits/stdc++.h>
#define x first
#define y second
#define pii pair<ll, ll>
typedef long long ll;
const ll MOD = 1000000007LL;
const ll INF = 1e15;
using namespace std;

ll n, a[200010], p[200010];
map<ll, ll> f;
stack<ll> stk;

ll find(ll x) {
	if (p[x] == x) return x;
	return p[x] = find(p[x]);
}

int main() {
	cin.tie(0); cout.tie(0);
	ios::sync_with_stdio(0);
	
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		p[i] = i;
		if (!f[a[i]]) stk.push(i), f[a[i]]++;
		else {
			while (!stk.empty() && a[stk.top()] != a[i]) f[a[stk.top()]]--, p[find(stk.top())] = i, stk.pop();
			stk.push(i), f[a[i]]++;
		}
	}
	
	for (int i = 1; i <= n; i++) cout << a[find(i)] << "\n";
	
	return 0;
}
/*



*/

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