Submission #878458

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
878458	2023-11-24T11:49:52 Z	phoenix0423	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	194 ms	143104 KB

Main

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define pb push_back
#define eb emplace_back
#define f first
#define s second
const int maxn = 2e5 + 5;
int n;
vector<int> val;
int getid(int x){
	return lower_bound(val.begin(), val.end(), x) - val.begin() + 1;
}
int tag[maxn * 4];
void push(int v){
	if(tag[v]){
		tag[v * 2] = tag[v];
		tag[v * 2 + 1] = tag[v];
		tag[v] = 0;
	}
}
void apply(int l, int r, int val, int v = 1, int L = 0, int R = n - 1){
	if(l > R || r < L) return;
	if(l <= L && r >= R){
		tag[v] = val;
		return;
	}
	push(v);
	int m = (L + R) / 2;
	apply(l, r, val, v * 2, L, m);
	apply(l, r, val, v * 2 + 1, m + 1, R);
}
int qry(int pos, int v = 1, int l = 0, int r = n - 1){
	if(l == r) return tag[v];
	push(v);
	int m = (l + r) / 2;
	if(pos <= m) return qry(pos, v * 2, l, m);
	else return qry(pos, v * 2 + 1, m + 1, r);
}
int main(void){
	fastio;	
	cin>>n;
	vector<int> a(n);
	for(int i = 0; i < n; i++) cin>>a[i], val.pb(a[i]);
	sort(val.begin(), val.end());
	val.erase(unique(val.begin(), val.end()), val.end());
	for(int i = 0; i < n; i++) a[i] = getid(a[i]);
	vector<stack<int>> lst(n + 1);
	for(int i = 0; i < n; i++){
		while(!lst[a[i]].empty() && qry(lst[a[i]].top()) != a[i]) lst[a[i]].pop();
		if(!lst[a[i]].empty()) apply(lst[a[i]].top(), i, a[i]);
		else apply(i, i, a[i]);
		lst[a[i]].push(i);
	}
	for(int i = 0; i < n; i++) cout<<val[qry(i) - 1]<<"\n";
}

Subtask #1
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	1628 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	1628 KB	Output is correct
11	Correct	2 ms	1792 KB	Output is correct
12	Correct	1 ms	1628 KB	Output is correct
13	Correct	1 ms	1628 KB	Output is correct
14	Correct	2 ms	1628 KB	Output is correct
15	Correct	1 ms	1816 KB	Output is correct
16	Correct	1 ms	1628 KB	Output is correct
17	Correct	2 ms	1884 KB	Output is correct
18	Correct	2 ms	1880 KB	Output is correct
19	Correct	2 ms	1884 KB	Output is correct
20	Correct	2 ms	1804 KB	Output is correct
21	Correct	2 ms	1884 KB	Output is correct
22	Correct	2 ms	1884 KB	Output is correct
23	Correct	2 ms	1884 KB	Output is correct
24	Correct	2 ms	1880 KB	Output is correct
25	Correct	2 ms	1884 KB	Output is correct
26	Correct	2 ms	1884 KB	Output is correct
27	Correct	1 ms	1628 KB	Output is correct
28	Correct	1 ms	1628 KB	Output is correct
29	Correct	2 ms	1884 KB	Output is correct
30	Correct	2 ms	1884 KB	Output is correct

Subtask #2
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	600 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	1628 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	1628 KB	Output is correct
10	Correct	2 ms	1628 KB	Output is correct
11	Correct	2 ms	1628 KB	Output is correct
12	Correct	1 ms	1628 KB	Output is correct
13	Correct	1 ms	1628 KB	Output is correct
14	Correct	2 ms	1744 KB	Output is correct
15	Correct	2 ms	1624 KB	Output is correct
16	Correct	1 ms	1628 KB	Output is correct
17	Correct	121 ms	139724 KB	Output is correct
18	Correct	119 ms	139724 KB	Output is correct
19	Correct	126 ms	139728 KB	Output is correct
20	Correct	126 ms	139728 KB	Output is correct
21	Correct	130 ms	139636 KB	Output is correct
22	Correct	125 ms	139636 KB	Output is correct
23	Correct	126 ms	139628 KB	Output is correct
24	Correct	125 ms	139768 KB	Output is correct
25	Correct	126 ms	139776 KB	Output is correct
26	Correct	126 ms	139720 KB	Output is correct
27	Correct	126 ms	139748 KB	Output is correct
28	Correct	127 ms	139748 KB	Output is correct
29	Correct	132 ms	139468 KB	Output is correct
30	Correct	119 ms	139724 KB	Output is correct
31	Correct	120 ms	139728 KB	Output is correct

Subtask #3
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	1628 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	1628 KB	Output is correct
11	Correct	2 ms	1792 KB	Output is correct
12	Correct	1 ms	1628 KB	Output is correct
13	Correct	1 ms	1628 KB	Output is correct
14	Correct	2 ms	1628 KB	Output is correct
15	Correct	1 ms	1816 KB	Output is correct
16	Correct	1 ms	1628 KB	Output is correct
17	Correct	2 ms	1884 KB	Output is correct
18	Correct	2 ms	1880 KB	Output is correct
19	Correct	2 ms	1884 KB	Output is correct
20	Correct	2 ms	1804 KB	Output is correct
21	Correct	2 ms	1884 KB	Output is correct
22	Correct	2 ms	1884 KB	Output is correct
23	Correct	2 ms	1884 KB	Output is correct
24	Correct	2 ms	1880 KB	Output is correct
25	Correct	2 ms	1884 KB	Output is correct
26	Correct	2 ms	1884 KB	Output is correct
27	Correct	1 ms	1628 KB	Output is correct
28	Correct	1 ms	1628 KB	Output is correct
29	Correct	2 ms	1884 KB	Output is correct
30	Correct	2 ms	1884 KB	Output is correct
31	Correct	0 ms	600 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	1 ms	1628 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	1 ms	1628 KB	Output is correct
40	Correct	2 ms	1628 KB	Output is correct
41	Correct	2 ms	1628 KB	Output is correct
42	Correct	1 ms	1628 KB	Output is correct
43	Correct	1 ms	1628 KB	Output is correct
44	Correct	2 ms	1744 KB	Output is correct
45	Correct	2 ms	1624 KB	Output is correct
46	Correct	1 ms	1628 KB	Output is correct
47	Correct	121 ms	139724 KB	Output is correct
48	Correct	119 ms	139724 KB	Output is correct
49	Correct	126 ms	139728 KB	Output is correct
50	Correct	126 ms	139728 KB	Output is correct
51	Correct	130 ms	139636 KB	Output is correct
52	Correct	125 ms	139636 KB	Output is correct
53	Correct	126 ms	139628 KB	Output is correct
54	Correct	125 ms	139768 KB	Output is correct
55	Correct	126 ms	139776 KB	Output is correct
56	Correct	126 ms	139720 KB	Output is correct
57	Correct	126 ms	139748 KB	Output is correct
58	Correct	127 ms	139748 KB	Output is correct
59	Correct	132 ms	139468 KB	Output is correct
60	Correct	119 ms	139724 KB	Output is correct
61	Correct	120 ms	139728 KB	Output is correct
62	Correct	132 ms	143104 KB	Output is correct
63	Correct	184 ms	142544 KB	Output is correct
64	Correct	180 ms	142604 KB	Output is correct
65	Correct	143 ms	142712 KB	Output is correct
66	Correct	133 ms	142536 KB	Output is correct
67	Correct	135 ms	142916 KB	Output is correct
68	Correct	137 ms	142892 KB	Output is correct
69	Correct	136 ms	142836 KB	Output is correct
70	Correct	136 ms	142796 KB	Output is correct
71	Correct	150 ms	142856 KB	Output is correct
72	Correct	140 ms	142796 KB	Output is correct
73	Correct	185 ms	142256 KB	Output is correct
74	Correct	194 ms	142656 KB	Output is correct
75	Correct	180 ms	142032 KB	Output is correct
76	Correct	181 ms	142548 KB	Output is correct
77	Correct	183 ms	142096 KB	Output is correct
78	Correct	180 ms	142028 KB	Output is correct

Submission #878458

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