Submission #1145475

#	Time	Username	Problem	Language	Result	Execution time	Memory
1145475		fabijan_cikac	Stone Arranging 2 (JOI23_ho_t1)	C++20	100 / 100	124 ms	12228 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int N = 2 * 1e5 + 100;

int n, a[N];
unordered_map<int, int> last;

int main(){
	cin >> n;
	for (int i = 1; i <= n; ++i){
		cin >> a[i]; last[a[i]] = i;
	}
	
	int x = 1;
	while (x <= n){
		int y = last[a[x]] + 1;
		for (int i = x; i < y; ++i)
			cout << a[x] << '\n';
		x = y;
	}
	
	return 0;
}

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