제출 #1311843

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1311843		vtnoo	Stone Arranging 2 (JOI23_ho_t1)	C++20	0 / 100	1 ms	572 KiB

Main

#include <bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define ll long long
#define sz(a) ((int) a.size())
#define all(a) a.begin(), a.end()
#define vi vector<ll>
#define pb emplace_back
#define me(a, x) memset(a, x, sizeof(a))
#define fst first
#define snd second
#define ii pair<ll, ll>
using namespace std;
int main(){
	ios::sync_with_stdio(false); 
	cin.tie(nullptr);
	int n;cin>>n;
	vi a(n+1);
	L(i,0,n-1)cin>>a[i];
	vi upd(n,0);
	map<int,vi>indices;
	L(i,0,n-1){
		if(sz(indices[a[i]])>=1){
			upd[indices[a[i]].back()]=a[i];
			upd[i]=-a[i];
		}
		indices[a[i]].pb(i);
	}
	//~ cout<<"PASS"<<endl;
	int i=0;
	while(i<n){ 
		if(upd[i]!=0){
			int value=upd[i];
			while(i<n){
				a[i]=value;
				if(value==-upd[i]){
					break;
				}
				i++;
			}
		}
		i++;
	}
	L(i,0,n-1)cout<<a[i]<<endl;
}

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