답안 #847394

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

mizuyokan2

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

constexpr int INF1 = 1e9 + 100;

int n;
int a[250250];

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

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

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

	for (int i=n;i;i--) sp[i][0] = min(sp[i][0], sp[i+1][0]);

	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;

	cnt = max(cnt-100, 0);
	for (int j=19;j>=0;j--) if (cnt&(1<<j)) l = sp[l][j];

	int cur = cnt*2, ret = -INF1;
	while(l<=r){
		if (l==r) ret = max(ret, cur+1);
		else if (r-l+1 >= 3 && S[r-1]-S[l] > max(a[l], a[r])) ret = max(ret, cur+3);
		else ret = max(ret, cur+1);

		l = sp[l][0];
		cur += 2;
	}

	return ret;
}

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

Subtask #1
6.0 / 6.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2392 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2392 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2392 KB	Output is correct
22	Correct	1 ms	2392 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	2 ms	2524 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	2 ms	2396 KB	Output is correct
29	Correct	2 ms	2652 KB	Output is correct
30	Correct	2 ms	2396 KB	Output is correct
31	Correct	2 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2520 KB	Output is correct
37	Correct	1 ms	2396 KB	Output is correct
38	Correct	1 ms	2396 KB	Output is correct
39	Correct	1 ms	2396 KB	Output is correct
40	Correct	1 ms	2396 KB	Output is correct
41	Correct	171 ms	21852 KB	Output is correct
42	Correct	310 ms	22700 KB	Output is correct
43	Correct	282 ms	22924 KB	Output is correct
44	Correct	83 ms	17500 KB	Output is correct
45	Correct	350 ms	22928 KB	Output is correct
46	Correct	332 ms	23288 KB	Output is correct
47	Correct	113 ms	17584 KB	Output is correct
48	Correct	332 ms	23124 KB	Output is correct
49	Correct	325 ms	22920 KB	Output is correct
50	Correct	336 ms	23120 KB	Output is correct
51	Correct	315 ms	22864 KB	Output is correct
52	Correct	86 ms	19804 KB	Output is correct
53	Correct	319 ms	22928 KB	Output is correct
54	Correct	354 ms	22872 KB	Output is correct
55	Correct	261 ms	23124 KB	Output is correct
56	Correct	326 ms	22928 KB	Output is correct
57	Correct	252 ms	22924 KB	Output is correct
58	Correct	283 ms	22868 KB	Output is correct
59	Correct	169 ms	22676 KB	Output is correct
60	Correct	144 ms	23124 KB	Output is correct

Subtask #4
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	55 ms	17832 KB	Output is correct
3	Correct	89 ms	23120 KB	Output is correct
4	Correct	93 ms	22936 KB	Output is correct
5	Correct	85 ms	23120 KB	Output is correct
6	Correct	96 ms	23376 KB	Output is correct
7	Correct	93 ms	23108 KB	Output is correct
8	Correct	94 ms	23124 KB	Output is correct
9	Correct	101 ms	23376 KB	Output is correct
10	Correct	85 ms	20172 KB	Output is correct
11	Correct	107 ms	23096 KB	Output is correct
12	Correct	111 ms	23128 KB	Output is correct
13	Correct	102 ms	23148 KB	Output is correct
14	Correct	102 ms	22968 KB	Output is correct
15	Correct	111 ms	23120 KB	Output is correct
16	Correct	109 ms	23124 KB	Output is correct
17	Correct	82 ms	22968 KB	Output is correct
18	Correct	89 ms	23120 KB	Output is correct

Subtask #5
0 / 29.0

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

Subtask #6
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2392 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2392 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2392 KB	Output is correct
22	Correct	1 ms	2392 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	2 ms	2524 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	2 ms	2396 KB	Output is correct
29	Correct	2 ms	2652 KB	Output is correct
30	Correct	2 ms	2396 KB	Output is correct
31	Correct	2 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2520 KB	Output is correct
37	Correct	1 ms	2396 KB	Output is correct
38	Correct	1 ms	2396 KB	Output is correct
39	Correct	1 ms	2396 KB	Output is correct
40	Correct	1 ms	2396 KB	Output is correct
41	Correct	171 ms	21852 KB	Output is correct
42	Correct	310 ms	22700 KB	Output is correct
43	Correct	282 ms	22924 KB	Output is correct
44	Correct	83 ms	17500 KB	Output is correct
45	Correct	350 ms	22928 KB	Output is correct
46	Correct	332 ms	23288 KB	Output is correct
47	Correct	113 ms	17584 KB	Output is correct
48	Correct	332 ms	23124 KB	Output is correct
49	Correct	325 ms	22920 KB	Output is correct
50	Correct	336 ms	23120 KB	Output is correct
51	Correct	315 ms	22864 KB	Output is correct
52	Correct	86 ms	19804 KB	Output is correct
53	Correct	319 ms	22928 KB	Output is correct
54	Correct	354 ms	22872 KB	Output is correct
55	Correct	261 ms	23124 KB	Output is correct
56	Correct	326 ms	22928 KB	Output is correct
57	Correct	252 ms	22924 KB	Output is correct
58	Correct	283 ms	22868 KB	Output is correct
59	Correct	169 ms	22676 KB	Output is correct
60	Correct	144 ms	23124 KB	Output is correct
61	Correct	1 ms	2396 KB	Output is correct
62	Correct	55 ms	17832 KB	Output is correct
63	Correct	89 ms	23120 KB	Output is correct
64	Correct	93 ms	22936 KB	Output is correct
65	Correct	85 ms	23120 KB	Output is correct
66	Correct	96 ms	23376 KB	Output is correct
67	Correct	93 ms	23108 KB	Output is correct
68	Correct	94 ms	23124 KB	Output is correct
69	Correct	101 ms	23376 KB	Output is correct
70	Correct	85 ms	20172 KB	Output is correct
71	Correct	107 ms	23096 KB	Output is correct
72	Correct	111 ms	23128 KB	Output is correct
73	Correct	102 ms	23148 KB	Output is correct
74	Correct	102 ms	22968 KB	Output is correct
75	Correct	111 ms	23120 KB	Output is correct
76	Correct	109 ms	23124 KB	Output is correct
77	Correct	82 ms	22968 KB	Output is correct
78	Correct	89 ms	23120 KB	Output is correct
79	Correct	1 ms	2396 KB	Output is correct
80	Correct	1 ms	2396 KB	Output is correct
81	Execution timed out	4051 ms	21852 KB	Time limit exceeded
82	Halted	0 ms	0 KB	-

답안 #847394

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