Submission #1174419

#	Time	Username	Problem	Language	Result	Execution time	Memory
1174419		Tsagana	Stone Arranging 2 (JOI23_ho_t1)	C++20	100 / 100	134 ms	16520 KiB

Main

#include<bits/stdc++.h>

#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define int long long
#define pq priority_queue
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pp pop_back
#define F first
#define S second

using namespace std;

void solve () {
	int n;
	cin >> n;
	vector<int> a(n+1);
	map<int, int> mp;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		mp[a[i]] = i;
	}
	for (int i = 1; i <= n; i++) {
		int x = a[i];
		int y = mp[a[i]];
		for (; i <= y; i++) cout << x << '\n';
		i--;
	}
}
signed main() {IOS solve(); return 0;}

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