Submission #941079

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
941079	2024-03-08T06:34:07 Z	dsyz	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	248 ms	52924 KB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN (1000005)
struct node {
	ll s,e,m,lazy,v;
	node *l, *r;
	node(ll _s,ll _e){
		s = _s;
		e = _e;
		m = (s + e) / 2;
		lazy = -1;
		v = 0;
		if(s != e){
			l = new node(s,m);
			r = new node(m + 1,e);
		}
	}
	void propo(){
		if(lazy == -1) return;
		v = (e-s+1) * lazy;
		if(s != e){
			l->lazy = lazy;
			r->lazy = lazy;
		}
		lazy = -1;
	}
	void update(ll x,ll y,ll nval){
		propo();
		if(s == x && e == y){
			lazy = nval;
			return;
		}else{
			if(x > m) r -> update(x,y,nval);
			else if(y <= m) l -> update(x,y,nval);
			else l -> update(x,m,nval), r -> update(m + 1,y,nval);
			l->propo(), r->propo();
			v = l->v + r->v;
		}
	}
	ll query(ll x){
		propo();
		if(s == e){
			return v;
		}else{
			if(x > m) return r -> query(x);
			else return l -> query(x);
		}
	}
} *root;
int main() {
	ios_base::sync_with_stdio(false);cin.tie(0);
	ll N;
	cin>>N;
	root = new node(0,N - 1);
	ll arr[N];
	for(ll i = 0;i < N;i++){
		cin>>arr[i];
	}
	map<ll,vector<ll> > val;
	for(ll i = 0;i < N;i++){
		while(!val[arr[i]].empty() && root -> query(val[arr[i]].back()) != arr[i]){
			val[arr[i]].pop_back();
		}
		ll Lb = i;
		if(!val[arr[i]].empty()) Lb = val[arr[i]].back();
		root -> update(Lb,i,arr[i]);
		val[arr[i]].push_back(i);
	}
	for(ll i = 0;i < N;i++){
		cout<<root -> query(i)<<'\n';
	}
}

Subtask #1
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	404 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	2 ms	604 KB	Output is correct
13	Correct	1 ms	604 KB	Output is correct
14	Correct	1 ms	604 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	3 ms	860 KB	Output is correct
18	Correct	2 ms	860 KB	Output is correct
19	Correct	2 ms	600 KB	Output is correct
20	Correct	1 ms	600 KB	Output is correct
21	Correct	2 ms	604 KB	Output is correct
22	Correct	2 ms	604 KB	Output is correct
23	Correct	1 ms	604 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	1 ms	720 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	2 ms	724 KB	Output is correct
30	Correct	2 ms	860 KB	Output is correct

Subtask #2
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	704 KB	Output is correct
10	Correct	1 ms	604 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	1 ms	604 KB	Output is correct
13	Correct	1 ms	604 KB	Output is correct
14	Correct	1 ms	860 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	87 ms	29616 KB	Output is correct
18	Correct	78 ms	29380 KB	Output is correct
19	Correct	88 ms	28660 KB	Output is correct
20	Correct	91 ms	28760 KB	Output is correct
21	Correct	86 ms	28576 KB	Output is correct
22	Correct	87 ms	28608 KB	Output is correct
23	Correct	85 ms	28592 KB	Output is correct
24	Correct	88 ms	28784 KB	Output is correct
25	Correct	86 ms	28616 KB	Output is correct
26	Correct	87 ms	28608 KB	Output is correct
27	Correct	86 ms	28608 KB	Output is correct
28	Correct	88 ms	28744 KB	Output is correct
29	Correct	91 ms	28592 KB	Output is correct
30	Correct	81 ms	29412 KB	Output is correct
31	Correct	78 ms	29640 KB	Output is correct

Subtask #3
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	404 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	2 ms	604 KB	Output is correct
13	Correct	1 ms	604 KB	Output is correct
14	Correct	1 ms	604 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	3 ms	860 KB	Output is correct
18	Correct	2 ms	860 KB	Output is correct
19	Correct	2 ms	600 KB	Output is correct
20	Correct	1 ms	600 KB	Output is correct
21	Correct	2 ms	604 KB	Output is correct
22	Correct	2 ms	604 KB	Output is correct
23	Correct	1 ms	604 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	1 ms	720 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	2 ms	724 KB	Output is correct
30	Correct	2 ms	860 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	704 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	1 ms	604 KB	Output is correct
44	Correct	1 ms	860 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	87 ms	29616 KB	Output is correct
48	Correct	78 ms	29380 KB	Output is correct
49	Correct	88 ms	28660 KB	Output is correct
50	Correct	91 ms	28760 KB	Output is correct
51	Correct	86 ms	28576 KB	Output is correct
52	Correct	87 ms	28608 KB	Output is correct
53	Correct	85 ms	28592 KB	Output is correct
54	Correct	88 ms	28784 KB	Output is correct
55	Correct	86 ms	28616 KB	Output is correct
56	Correct	87 ms	28608 KB	Output is correct
57	Correct	86 ms	28608 KB	Output is correct
58	Correct	88 ms	28744 KB	Output is correct
59	Correct	91 ms	28592 KB	Output is correct
60	Correct	81 ms	29412 KB	Output is correct
61	Correct	78 ms	29640 KB	Output is correct
62	Correct	92 ms	32720 KB	Output is correct
63	Correct	236 ms	52784 KB	Output is correct
64	Correct	225 ms	52852 KB	Output is correct
65	Correct	95 ms	31428 KB	Output is correct
66	Correct	95 ms	31440 KB	Output is correct
67	Correct	95 ms	31920 KB	Output is correct
68	Correct	97 ms	31920 KB	Output is correct
69	Correct	99 ms	31432 KB	Output is correct
70	Correct	98 ms	31620 KB	Output is correct
71	Correct	102 ms	31652 KB	Output is correct
72	Correct	99 ms	31600 KB	Output is correct
73	Correct	236 ms	41812 KB	Output is correct
74	Correct	248 ms	41988 KB	Output is correct
75	Correct	227 ms	52852 KB	Output is correct
76	Correct	245 ms	52924 KB	Output is correct
77	Correct	215 ms	52648 KB	Output is correct
78	Correct	226 ms	52680 KB	Output is correct

Submission #941079

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