답안 #847418

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
847418	2023-09-09T15:43:37 Z	qwerasdfzxcl	Mizuyokan 2 (JOI23_mizuyokan2)	C++17	60 / 100	4000 ms	24216 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});
}

void update(int x, int y){
	a[x] = y;
	init(n);
}

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:66:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
mizuyokan2.cpp:67:30: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |  for (int i=1;i<=n;i++) scanf("%d", a+i);
      |                         ~~~~~^~~~~~~~~~~
mizuyokan2.cpp:72:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |  scanf("%d", &q);
      |  ~~~~~^~~~~~~~~~
mizuyokan2.cpp:75:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |   scanf("%d %d %d %d", &x, &y, &l, &r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	1 ms	4444 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	4444 KB	Output is correct
18	Correct	1 ms	4444 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	1 ms	4444 KB	Output is correct
21	Correct	1 ms	4444 KB	Output is correct
22	Correct	1 ms	4444 KB	Output is correct
23	Correct	2 ms	4444 KB	Output is correct
24	Correct	1 ms	4440 KB	Output is correct
25	Correct	2 ms	4444 KB	Output is correct
26	Correct	3 ms	4444 KB	Output is correct
27	Correct	2 ms	4444 KB	Output is correct
28	Correct	2 ms	4444 KB	Output is correct
29	Correct	2 ms	4444 KB	Output is correct
30	Correct	2 ms	4444 KB	Output is correct
31	Correct	2 ms	4444 KB	Output is correct
32	Correct	1 ms	4444 KB	Output is correct
33	Correct	2 ms	4444 KB	Output is correct
34	Correct	2 ms	4444 KB	Output is correct
35	Correct	1 ms	4444 KB	Output is correct
36	Correct	2 ms	4444 KB	Output is correct
37	Correct	1 ms	4444 KB	Output is correct
38	Correct	2 ms	4444 KB	Output is correct
39	Correct	1 ms	4444 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	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	1 ms	4444 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	4444 KB	Output is correct
18	Correct	1 ms	4444 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	1 ms	4444 KB	Output is correct
21	Correct	1 ms	4444 KB	Output is correct
22	Correct	1 ms	4444 KB	Output is correct
23	Correct	2 ms	4444 KB	Output is correct
24	Correct	1 ms	4440 KB	Output is correct
25	Correct	2 ms	4444 KB	Output is correct
26	Correct	3 ms	4444 KB	Output is correct
27	Correct	2 ms	4444 KB	Output is correct
28	Correct	2 ms	4444 KB	Output is correct
29	Correct	2 ms	4444 KB	Output is correct
30	Correct	2 ms	4444 KB	Output is correct
31	Correct	2 ms	4444 KB	Output is correct
32	Correct	1 ms	4444 KB	Output is correct
33	Correct	2 ms	4444 KB	Output is correct
34	Correct	2 ms	4444 KB	Output is correct
35	Correct	1 ms	4444 KB	Output is correct
36	Correct	2 ms	4444 KB	Output is correct
37	Correct	1 ms	4444 KB	Output is correct
38	Correct	2 ms	4444 KB	Output is correct
39	Correct	1 ms	4444 KB	Output is correct
40	Correct	1 ms	4444 KB	Output is correct
41	Correct	223 ms	23788 KB	Output is correct
42	Correct	333 ms	23744 KB	Output is correct
43	Correct	327 ms	23920 KB	Output is correct
44	Correct	77 ms	19292 KB	Output is correct
45	Correct	350 ms	23920 KB	Output is correct
46	Correct	372 ms	23900 KB	Output is correct
47	Correct	138 ms	19568 KB	Output is correct
48	Correct	378 ms	23916 KB	Output is correct
49	Correct	373 ms	23920 KB	Output is correct
50	Correct	381 ms	23924 KB	Output is correct
51	Correct	381 ms	23916 KB	Output is correct
52	Correct	95 ms	21636 KB	Output is correct
53	Correct	357 ms	23920 KB	Output is correct
54	Correct	362 ms	23920 KB	Output is correct
55	Correct	294 ms	23920 KB	Output is correct
56	Correct	355 ms	24140 KB	Output is correct
57	Correct	279 ms	23920 KB	Output is correct
58	Correct	349 ms	23924 KB	Output is correct
59	Correct	192 ms	23920 KB	Output is correct
60	Correct	172 ms	24156 KB	Output is correct

Subtask #4
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	56 ms	19580 KB	Output is correct
3	Correct	93 ms	23896 KB	Output is correct
4	Correct	90 ms	24148 KB	Output is correct
5	Correct	87 ms	24096 KB	Output is correct
6	Correct	97 ms	24100 KB	Output is correct
7	Correct	104 ms	24148 KB	Output is correct
8	Correct	95 ms	24072 KB	Output is correct
9	Correct	114 ms	23928 KB	Output is correct
10	Correct	91 ms	21860 KB	Output is correct
11	Correct	126 ms	24168 KB	Output is correct
12	Correct	120 ms	24144 KB	Output is correct
13	Correct	112 ms	24172 KB	Output is correct
14	Correct	114 ms	24120 KB	Output is correct
15	Correct	115 ms	24156 KB	Output is correct
16	Correct	137 ms	24216 KB	Output is correct
17	Correct	85 ms	23896 KB	Output is correct
18	Correct	108 ms	24136 KB	Output is correct

Subtask #5
0 / 29.0

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

Subtask #6
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	1 ms	4444 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	4444 KB	Output is correct
18	Correct	1 ms	4444 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	1 ms	4444 KB	Output is correct
21	Correct	1 ms	4444 KB	Output is correct
22	Correct	1 ms	4444 KB	Output is correct
23	Correct	2 ms	4444 KB	Output is correct
24	Correct	1 ms	4440 KB	Output is correct
25	Correct	2 ms	4444 KB	Output is correct
26	Correct	3 ms	4444 KB	Output is correct
27	Correct	2 ms	4444 KB	Output is correct
28	Correct	2 ms	4444 KB	Output is correct
29	Correct	2 ms	4444 KB	Output is correct
30	Correct	2 ms	4444 KB	Output is correct
31	Correct	2 ms	4444 KB	Output is correct
32	Correct	1 ms	4444 KB	Output is correct
33	Correct	2 ms	4444 KB	Output is correct
34	Correct	2 ms	4444 KB	Output is correct
35	Correct	1 ms	4444 KB	Output is correct
36	Correct	2 ms	4444 KB	Output is correct
37	Correct	1 ms	4444 KB	Output is correct
38	Correct	2 ms	4444 KB	Output is correct
39	Correct	1 ms	4444 KB	Output is correct
40	Correct	1 ms	4444 KB	Output is correct
41	Correct	223 ms	23788 KB	Output is correct
42	Correct	333 ms	23744 KB	Output is correct
43	Correct	327 ms	23920 KB	Output is correct
44	Correct	77 ms	19292 KB	Output is correct
45	Correct	350 ms	23920 KB	Output is correct
46	Correct	372 ms	23900 KB	Output is correct
47	Correct	138 ms	19568 KB	Output is correct
48	Correct	378 ms	23916 KB	Output is correct
49	Correct	373 ms	23920 KB	Output is correct
50	Correct	381 ms	23924 KB	Output is correct
51	Correct	381 ms	23916 KB	Output is correct
52	Correct	95 ms	21636 KB	Output is correct
53	Correct	357 ms	23920 KB	Output is correct
54	Correct	362 ms	23920 KB	Output is correct
55	Correct	294 ms	23920 KB	Output is correct
56	Correct	355 ms	24140 KB	Output is correct
57	Correct	279 ms	23920 KB	Output is correct
58	Correct	349 ms	23924 KB	Output is correct
59	Correct	192 ms	23920 KB	Output is correct
60	Correct	172 ms	24156 KB	Output is correct
61	Correct	1 ms	4444 KB	Output is correct
62	Correct	56 ms	19580 KB	Output is correct
63	Correct	93 ms	23896 KB	Output is correct
64	Correct	90 ms	24148 KB	Output is correct
65	Correct	87 ms	24096 KB	Output is correct
66	Correct	97 ms	24100 KB	Output is correct
67	Correct	104 ms	24148 KB	Output is correct
68	Correct	95 ms	24072 KB	Output is correct
69	Correct	114 ms	23928 KB	Output is correct
70	Correct	91 ms	21860 KB	Output is correct
71	Correct	126 ms	24168 KB	Output is correct
72	Correct	120 ms	24144 KB	Output is correct
73	Correct	112 ms	24172 KB	Output is correct
74	Correct	114 ms	24120 KB	Output is correct
75	Correct	115 ms	24156 KB	Output is correct
76	Correct	137 ms	24216 KB	Output is correct
77	Correct	85 ms	23896 KB	Output is correct
78	Correct	108 ms	24136 KB	Output is correct
79	Correct	1 ms	4444 KB	Output is correct
80	Correct	1 ms	4444 KB	Output is correct
81	Execution timed out	4061 ms	23644 KB	Time limit exceeded
82	Halted	0 ms	0 KB	-

답안 #847418

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