답안 #847419

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
847419	2023-09-09T15:45:57 Z	qwerasdfzxcl	Mizuyokan 2 (JOI23_mizuyokan2)	C++17	60 / 100	4000 ms	25156 KB

mizuyokan2

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

constexpr int INF1 = 1e9 + 100;

int n;
int a[250250];

int go[250250], sp[250250][20];
ll S[250250];

void init(int n){
	for (int i=1;i<=n;i++) S[i] = S[i-1] + a[i];

	go[n+1] = n+1;
	for (int i=1;i<=n;i++){
		go[i] = n+1;
		for (int j=i+2;j<=min(i+50, n);j++) if (S[j-1] - S[i] > max(a[i], a[j])){
			go[i] = j;
			break;
		}
	}

	for (int i=n;i;i--) go[i] = min(go[i], go[i+1]);
	for (int i=n;i;i--) assert(go[i] - i <= 50);

	for (int i=1;i<=n+1;i++) sp[i][0] = go[i];
	for (int j=1;j<20;j++){
		for (int i=1;i<=n+1;i++) sp[i][j] = sp[sp[i][j-1]][j-1];
	}
}

int solve(int l, int r){
	if (r-l+1 < 3) return -INF1;
	int cnt = 0;
	for (int x=l,j=19;j>=0;j--) if (sp[x][j] <= r){
		x = sp[x][j];
		cnt |= 1<<j;
	}

	return cnt * 2 + 1;
}

int query(int l, int r){
	int ret = 1;
	if (l==r) return ret;
	if (S[r-1]-S[l-1] > a[r]) ret = 2;
	if (S[r]-S[l] > a[l]) ret = 2;

	int nl = r+1, nr = l-1;
	for (int i=l+1;i<=min(l+30, r);i++) if (S[i-1]-S[l-1] > a[i]) {nl = i; break;}
	for (int i=r-1;i>=max(l, r-30);i--) if (S[r]-S[i] > a[i]) {nr = i; break;}
	if (nl <= nr) ret = 3;

	return max({ret, solve(l, r), solve(nl, r) + 1, solve(l, nr) + 1, solve(nl, nr) + 2});
}

int prv[250250];
void update(int x, int y){
	a[x] = y;
	for (int i=1;i<=n+1;i++) prv[i] = go[i];
	init(n);

	for (int i=1;i<=n+1;i++) if (prv[i]!=go[i]) assert(x-50 <= i && i <= x);
}

int main(){
	scanf("%d", &n);
	for (int i=1;i<=n;i++) scanf("%d", a+i);

	init(n);

	int q;
	scanf("%d", &q);
	while(q--){
		int x, y, l, r;
		scanf("%d %d %d %d", &x, &y, &l, &r);
		
		if (a[x]!=y) update(x, y);

		l++;
		printf("%d\n", query(l, r));
	}
}

Compilation message

mizuyokan2.cpp: In function 'int main()':
mizuyokan2.cpp:70:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
mizuyokan2.cpp:71:30: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |  for (int i=1;i<=n;i++) scanf("%d", a+i);
      |                         ~~~~~^~~~~~~~~~~
mizuyokan2.cpp:76:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |  scanf("%d", &q);
      |  ~~~~~^~~~~~~~~~
mizuyokan2.cpp:79:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |   scanf("%d %d %d %d", &x, &y, &l, &r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4440 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4440 KB	Output is correct
6	Correct	1 ms	4644 KB	Output is correct
7	Correct	1 ms	4440 KB	Output is correct
8	Correct	1 ms	4440 KB	Output is correct
9	Correct	1 ms	4440 KB	Output is correct
10	Correct	1 ms	4440 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4440 KB	Output is correct
13	Correct	1 ms	4440 KB	Output is correct
14	Correct	1 ms	4440 KB	Output is correct
15	Correct	1 ms	4440 KB	Output is correct
16	Correct	1 ms	4440 KB	Output is correct
17	Correct	1 ms	4440 KB	Output is correct
18	Correct	1 ms	4440 KB	Output is correct
19	Correct	1 ms	4440 KB	Output is correct
20	Correct	1 ms	4700 KB	Output is correct
21	Correct	1 ms	4440 KB	Output is correct

Subtask #2
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4440 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4440 KB	Output is correct
6	Correct	1 ms	4644 KB	Output is correct
7	Correct	1 ms	4440 KB	Output is correct
8	Correct	1 ms	4440 KB	Output is correct
9	Correct	1 ms	4440 KB	Output is correct
10	Correct	1 ms	4440 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4440 KB	Output is correct
13	Correct	1 ms	4440 KB	Output is correct
14	Correct	1 ms	4440 KB	Output is correct
15	Correct	1 ms	4440 KB	Output is correct
16	Correct	1 ms	4440 KB	Output is correct
17	Correct	1 ms	4440 KB	Output is correct
18	Correct	1 ms	4440 KB	Output is correct
19	Correct	1 ms	4440 KB	Output is correct
20	Correct	1 ms	4700 KB	Output is correct
21	Correct	1 ms	4440 KB	Output is correct
22	Correct	1 ms	4440 KB	Output is correct
23	Correct	2 ms	4440 KB	Output is correct
24	Correct	1 ms	4696 KB	Output is correct
25	Correct	2 ms	4440 KB	Output is correct
26	Correct	2 ms	4440 KB	Output is correct
27	Correct	2 ms	4440 KB	Output is correct
28	Correct	2 ms	4440 KB	Output is correct
29	Correct	2 ms	4440 KB	Output is correct
30	Correct	2 ms	4444 KB	Output is correct
31	Correct	2 ms	4640 KB	Output is correct
32	Correct	1 ms	4440 KB	Output is correct
33	Correct	2 ms	4440 KB	Output is correct
34	Correct	2 ms	4444 KB	Output is correct
35	Correct	2 ms	4440 KB	Output is correct
36	Correct	2 ms	4440 KB	Output is correct
37	Correct	2 ms	4440 KB	Output is correct
38	Correct	2 ms	4444 KB	Output is correct
39	Correct	1 ms	4440 KB	Output is correct
40	Correct	1 ms	4444 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4440 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4440 KB	Output is correct
6	Correct	1 ms	4644 KB	Output is correct
7	Correct	1 ms	4440 KB	Output is correct
8	Correct	1 ms	4440 KB	Output is correct
9	Correct	1 ms	4440 KB	Output is correct
10	Correct	1 ms	4440 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4440 KB	Output is correct
13	Correct	1 ms	4440 KB	Output is correct
14	Correct	1 ms	4440 KB	Output is correct
15	Correct	1 ms	4440 KB	Output is correct
16	Correct	1 ms	4440 KB	Output is correct
17	Correct	1 ms	4440 KB	Output is correct
18	Correct	1 ms	4440 KB	Output is correct
19	Correct	1 ms	4440 KB	Output is correct
20	Correct	1 ms	4700 KB	Output is correct
21	Correct	1 ms	4440 KB	Output is correct
22	Correct	1 ms	4440 KB	Output is correct
23	Correct	2 ms	4440 KB	Output is correct
24	Correct	1 ms	4696 KB	Output is correct
25	Correct	2 ms	4440 KB	Output is correct
26	Correct	2 ms	4440 KB	Output is correct
27	Correct	2 ms	4440 KB	Output is correct
28	Correct	2 ms	4440 KB	Output is correct
29	Correct	2 ms	4440 KB	Output is correct
30	Correct	2 ms	4444 KB	Output is correct
31	Correct	2 ms	4640 KB	Output is correct
32	Correct	1 ms	4440 KB	Output is correct
33	Correct	2 ms	4440 KB	Output is correct
34	Correct	2 ms	4444 KB	Output is correct
35	Correct	2 ms	4440 KB	Output is correct
36	Correct	2 ms	4440 KB	Output is correct
37	Correct	2 ms	4440 KB	Output is correct
38	Correct	2 ms	4444 KB	Output is correct
39	Correct	1 ms	4440 KB	Output is correct
40	Correct	1 ms	4444 KB	Output is correct
41	Correct	175 ms	24408 KB	Output is correct
42	Correct	326 ms	25116 KB	Output is correct
43	Correct	314 ms	24904 KB	Output is correct
44	Correct	79 ms	19792 KB	Output is correct
45	Correct	349 ms	24900 KB	Output is correct
46	Correct	356 ms	24656 KB	Output is correct
47	Correct	152 ms	22352 KB	Output is correct
48	Correct	361 ms	24696 KB	Output is correct
49	Correct	348 ms	24896 KB	Output is correct
50	Correct	373 ms	25156 KB	Output is correct
51	Correct	362 ms	24896 KB	Output is correct
52	Correct	97 ms	22140 KB	Output is correct
53	Correct	322 ms	24656 KB	Output is correct
54	Correct	338 ms	24912 KB	Output is correct
55	Correct	298 ms	24912 KB	Output is correct
56	Correct	352 ms	24652 KB	Output is correct
57	Correct	293 ms	24688 KB	Output is correct
58	Correct	354 ms	24688 KB	Output is correct
59	Correct	178 ms	24688 KB	Output is correct
60	Correct	151 ms	24656 KB	Output is correct

Subtask #4
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	53 ms	21396 KB	Output is correct
3	Correct	87 ms	24208 KB	Output is correct
4	Correct	91 ms	24144 KB	Output is correct
5	Correct	84 ms	23888 KB	Output is correct
6	Correct	102 ms	24180 KB	Output is correct
7	Correct	94 ms	24140 KB	Output is correct
8	Correct	96 ms	24144 KB	Output is correct
9	Correct	100 ms	24152 KB	Output is correct
10	Correct	78 ms	21584 KB	Output is correct
11	Correct	112 ms	24144 KB	Output is correct
12	Correct	116 ms	24220 KB	Output is correct
13	Correct	103 ms	24144 KB	Output is correct
14	Correct	114 ms	24184 KB	Output is correct
15	Correct	107 ms	24200 KB	Output is correct
16	Correct	113 ms	24144 KB	Output is correct
17	Correct	79 ms	23900 KB	Output is correct
18	Correct	93 ms	24144 KB	Output is correct

Subtask #5
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4440 KB	Output is correct
3	Execution timed out	4029 ms	24656 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #6
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4440 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4440 KB	Output is correct
6	Correct	1 ms	4644 KB	Output is correct
7	Correct	1 ms	4440 KB	Output is correct
8	Correct	1 ms	4440 KB	Output is correct
9	Correct	1 ms	4440 KB	Output is correct
10	Correct	1 ms	4440 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4440 KB	Output is correct
13	Correct	1 ms	4440 KB	Output is correct
14	Correct	1 ms	4440 KB	Output is correct
15	Correct	1 ms	4440 KB	Output is correct
16	Correct	1 ms	4440 KB	Output is correct
17	Correct	1 ms	4440 KB	Output is correct
18	Correct	1 ms	4440 KB	Output is correct
19	Correct	1 ms	4440 KB	Output is correct
20	Correct	1 ms	4700 KB	Output is correct
21	Correct	1 ms	4440 KB	Output is correct
22	Correct	1 ms	4440 KB	Output is correct
23	Correct	2 ms	4440 KB	Output is correct
24	Correct	1 ms	4696 KB	Output is correct
25	Correct	2 ms	4440 KB	Output is correct
26	Correct	2 ms	4440 KB	Output is correct
27	Correct	2 ms	4440 KB	Output is correct
28	Correct	2 ms	4440 KB	Output is correct
29	Correct	2 ms	4440 KB	Output is correct
30	Correct	2 ms	4444 KB	Output is correct
31	Correct	2 ms	4640 KB	Output is correct
32	Correct	1 ms	4440 KB	Output is correct
33	Correct	2 ms	4440 KB	Output is correct
34	Correct	2 ms	4444 KB	Output is correct
35	Correct	2 ms	4440 KB	Output is correct
36	Correct	2 ms	4440 KB	Output is correct
37	Correct	2 ms	4440 KB	Output is correct
38	Correct	2 ms	4444 KB	Output is correct
39	Correct	1 ms	4440 KB	Output is correct
40	Correct	1 ms	4444 KB	Output is correct
41	Correct	175 ms	24408 KB	Output is correct
42	Correct	326 ms	25116 KB	Output is correct
43	Correct	314 ms	24904 KB	Output is correct
44	Correct	79 ms	19792 KB	Output is correct
45	Correct	349 ms	24900 KB	Output is correct
46	Correct	356 ms	24656 KB	Output is correct
47	Correct	152 ms	22352 KB	Output is correct
48	Correct	361 ms	24696 KB	Output is correct
49	Correct	348 ms	24896 KB	Output is correct
50	Correct	373 ms	25156 KB	Output is correct
51	Correct	362 ms	24896 KB	Output is correct
52	Correct	97 ms	22140 KB	Output is correct
53	Correct	322 ms	24656 KB	Output is correct
54	Correct	338 ms	24912 KB	Output is correct
55	Correct	298 ms	24912 KB	Output is correct
56	Correct	352 ms	24652 KB	Output is correct
57	Correct	293 ms	24688 KB	Output is correct
58	Correct	354 ms	24688 KB	Output is correct
59	Correct	178 ms	24688 KB	Output is correct
60	Correct	151 ms	24656 KB	Output is correct
61	Correct	1 ms	4440 KB	Output is correct
62	Correct	53 ms	21396 KB	Output is correct
63	Correct	87 ms	24208 KB	Output is correct
64	Correct	91 ms	24144 KB	Output is correct
65	Correct	84 ms	23888 KB	Output is correct
66	Correct	102 ms	24180 KB	Output is correct
67	Correct	94 ms	24140 KB	Output is correct
68	Correct	96 ms	24144 KB	Output is correct
69	Correct	100 ms	24152 KB	Output is correct
70	Correct	78 ms	21584 KB	Output is correct
71	Correct	112 ms	24144 KB	Output is correct
72	Correct	116 ms	24220 KB	Output is correct
73	Correct	103 ms	24144 KB	Output is correct
74	Correct	114 ms	24184 KB	Output is correct
75	Correct	107 ms	24200 KB	Output is correct
76	Correct	113 ms	24144 KB	Output is correct
77	Correct	79 ms	23900 KB	Output is correct
78	Correct	93 ms	24144 KB	Output is correct
79	Correct	1 ms	4444 KB	Output is correct
80	Correct	1 ms	4440 KB	Output is correct
81	Execution timed out	4029 ms	24656 KB	Time limit exceeded
82	Halted	0 ms	0 KB	-

답안 #847419

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 9.0 / 9.0

Subtask #3 13.0 / 13.0

Subtask #4 32.0 / 32.0

Subtask #5 0 / 29.0

Subtask #6 0 / 11.0

Subtask #1
6.0 / 6.0

Subtask #2
9.0 / 9.0

Subtask #3
13.0 / 13.0

Subtask #4
32.0 / 32.0

Subtask #5
0 / 29.0

Subtask #6
0 / 11.0