답안 #792095

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
792095	2023-07-24T15:02:17 Z	denniskim	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	140 ms	18860 KB

Main

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef __int128 lll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
#define MAX 9223372036854775807LL
#define MIN -9223372036854775807LL
#define INF 0x3f3f3f3f3f3f3f3f
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed; cout.precision(10);
#define sp << " "
#define en << "\n"
#define compress(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end())

ll n;
ll a[200010];
stack<pll> stk;
set<ll> st;
ll last;
ll ans[200010];

int main(void)
{
	fastio
	
	cin >> n;
	
	for(ll i = 1 ; i <= n ; i++)
		cin >> a[i];
	
	for(ll i = 1 ; i <= n ; i++)
	{
		if(st.find(a[i]) == st.end())
		{
			stk.push({a[i], i});
			st.insert(a[i]);
		}
		
		else
		{
			while(!stk.empty() && stk.top().fi != a[i])
			{
				st.erase(stk.top().fi);
				stk.pop();
			}
			
			stk.pop();
			stk.push({a[i], i});
		}
	}
	
	while(!stk.empty())
	{
		pll qq = stk.top();
		stk.pop();
		
		if(!stk.empty())
			last = stk.top().se + 1;
		else
			last = 1;
		
		for(ll i = last ; i <= qq.se ; i++)
			ans[i] = qq.fi;
	}
	
	for(ll i = 1 ; i <= n ; i++)
		cout << ans[i] en;
	
	return 0;
}

Subtask #1
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	480 KB	Output is correct
18	Correct	1 ms	508 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	2 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct

Subtask #2
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	27 ms	4152 KB	Output is correct
18	Correct	30 ms	4236 KB	Output is correct
19	Correct	27 ms	4160 KB	Output is correct
20	Correct	22 ms	4028 KB	Output is correct
21	Correct	22 ms	4184 KB	Output is correct
22	Correct	22 ms	4176 KB	Output is correct
23	Correct	33 ms	4196 KB	Output is correct
24	Correct	22 ms	4128 KB	Output is correct
25	Correct	22 ms	4180 KB	Output is correct
26	Correct	24 ms	4208 KB	Output is correct
27	Correct	33 ms	4204 KB	Output is correct
28	Correct	21 ms	4180 KB	Output is correct
29	Correct	21 ms	4124 KB	Output is correct
30	Correct	20 ms	4164 KB	Output is correct
31	Correct	20 ms	4152 KB	Output is correct

Subtask #3
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	480 KB	Output is correct
18	Correct	1 ms	508 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	2 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	0 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	336 KB	Output is correct
37	Correct	0 ms	340 KB	Output is correct
38	Correct	0 ms	340 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	1 ms	340 KB	Output is correct
41	Correct	1 ms	340 KB	Output is correct
42	Correct	1 ms	344 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	1 ms	340 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	1 ms	344 KB	Output is correct
47	Correct	27 ms	4152 KB	Output is correct
48	Correct	30 ms	4236 KB	Output is correct
49	Correct	27 ms	4160 KB	Output is correct
50	Correct	22 ms	4028 KB	Output is correct
51	Correct	22 ms	4184 KB	Output is correct
52	Correct	22 ms	4176 KB	Output is correct
53	Correct	33 ms	4196 KB	Output is correct
54	Correct	22 ms	4128 KB	Output is correct
55	Correct	22 ms	4180 KB	Output is correct
56	Correct	24 ms	4208 KB	Output is correct
57	Correct	33 ms	4204 KB	Output is correct
58	Correct	21 ms	4180 KB	Output is correct
59	Correct	21 ms	4124 KB	Output is correct
60	Correct	20 ms	4164 KB	Output is correct
61	Correct	20 ms	4152 KB	Output is correct
62	Correct	32 ms	6108 KB	Output is correct
63	Correct	106 ms	11112 KB	Output is correct
64	Correct	99 ms	9748 KB	Output is correct
65	Correct	33 ms	5956 KB	Output is correct
66	Correct	32 ms	5952 KB	Output is correct
67	Correct	31 ms	6092 KB	Output is correct
68	Correct	32 ms	6100 KB	Output is correct
69	Correct	33 ms	6128 KB	Output is correct
70	Correct	33 ms	6128 KB	Output is correct
71	Correct	33 ms	6188 KB	Output is correct
72	Correct	41 ms	6128 KB	Output is correct
73	Correct	98 ms	12364 KB	Output is correct
74	Correct	83 ms	12520 KB	Output is correct
75	Correct	108 ms	18828 KB	Output is correct
76	Correct	140 ms	18800 KB	Output is correct
77	Correct	106 ms	18808 KB	Output is correct
78	Correct	108 ms	18860 KB	Output is correct

답안 #792095

Compilation message

Subtask #1 25.0 / 25.0

Subtask #2 35.0 / 35.0

Subtask #3 40.0 / 40.0

Subtask #1
25.0 / 25.0

Subtask #2
35.0 / 35.0

Subtask #3
40.0 / 40.0