oj.uz

Submission #847413

# Submission time Handle Problem Language Result Execution time Memory
847413 2023-09-09T15:34:35 Z qwerasdfzxcl Mizuyokan 2 (JOI23_mizuyokan2) C++17
60 / 100
 4000 ms 24512 KB 
#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=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:65:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
mizuyokan2.cpp:66:30: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |  for (int i=1;i<=n;i++) scanf("%d", a+i);
      |                         ~~~~~^~~~~~~~~~~
mizuyokan2.cpp:71:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |  scanf("%d", &q);
      |  ~~~~~^~~~~~~~~~
mizuyokan2.cpp:74:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |   scanf("%d %d %d %d", &x, &y, &l, &r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory 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 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 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 4440 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 4440 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory 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 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 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 4440 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 4440 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 4444 KB Output is correct
25 Correct 1 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 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 4440 KB Output is correct
32 Correct 2 ms 4440 KB Output is correct
33 Correct 2 ms 4440 KB Output is correct
34 Correct 2 ms 4440 KB Output is correct
35 Correct 2 ms 4440 KB Output is correct
36 Correct 2 ms 4444 KB Output is correct
37 Correct 2 ms 4444 KB Output is correct
38 Correct 2 ms 4440 KB Output is correct
39 Correct 2 ms 4440 KB Output is correct
40 Correct 1 ms 4440 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory 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 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 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 4440 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 4440 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 4444 KB Output is correct
25 Correct 1 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 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 4440 KB Output is correct
32 Correct 2 ms 4440 KB Output is correct
33 Correct 2 ms 4440 KB Output is correct
34 Correct 2 ms 4440 KB Output is correct
35 Correct 2 ms 4440 KB Output is correct
36 Correct 2 ms 4444 KB Output is correct
37 Correct 2 ms 4444 KB Output is correct
38 Correct 2 ms 4440 KB Output is correct
39 Correct 2 ms 4440 KB Output is correct
40 Correct 1 ms 4440 KB Output is correct
41 Correct 185 ms 23632 KB Output is correct
42 Correct 316 ms 24140 KB Output is correct
43 Correct 305 ms 23896 KB Output is correct
44 Correct 78 ms 19288 KB Output is correct
45 Correct 313 ms 23888 KB Output is correct
46 Correct 333 ms 23888 KB Output is correct
47 Correct 113 ms 19816 KB Output is correct
48 Correct 321 ms 23888 KB Output is correct
49 Correct 338 ms 24140 KB Output is correct
50 Correct 339 ms 23924 KB Output is correct
51 Correct 365 ms 23916 KB Output is correct
52 Correct 103 ms 21632 KB Output is correct
53 Correct 309 ms 23920 KB Output is correct
54 Correct 348 ms 24140 KB Output is correct
55 Correct 263 ms 23916 KB Output is correct
56 Correct 341 ms 24168 KB Output is correct
57 Correct 280 ms 23896 KB Output is correct
58 Correct 329 ms 24168 KB Output is correct
59 Correct 195 ms 23896 KB Output is correct
60 Correct 150 ms 23924 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 52 ms 19544 KB Output is correct
3 Correct 83 ms 24036 KB Output is correct
4 Correct 87 ms 23928 KB Output is correct
5 Correct 89 ms 23896 KB Output is correct
6 Correct 92 ms 24144 KB Output is correct
7 Correct 94 ms 24144 KB Output is correct
8 Correct 92 ms 24140 KB Output is correct
9 Correct 92 ms 24152 KB Output is correct
10 Correct 86 ms 21840 KB Output is correct
11 Correct 107 ms 24172 KB Output is correct
12 Correct 104 ms 24148 KB Output is correct
13 Correct 116 ms 24512 KB Output is correct
14 Correct 119 ms 24148 KB Output is correct
15 Correct 102 ms 24172 KB Output is correct
16 Correct 108 ms 24144 KB Output is correct
17 Correct 77 ms 23908 KB Output is correct
18 Correct 91 ms 24144 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Execution timed out 4054 ms 23860 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory 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 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 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 4440 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 4440 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 4444 KB Output is correct
25 Correct 1 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 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 4440 KB Output is correct
32 Correct 2 ms 4440 KB Output is correct
33 Correct 2 ms 4440 KB Output is correct
34 Correct 2 ms 4440 KB Output is correct
35 Correct 2 ms 4440 KB Output is correct
36 Correct 2 ms 4444 KB Output is correct
37 Correct 2 ms 4444 KB Output is correct
38 Correct 2 ms 4440 KB Output is correct
39 Correct 2 ms 4440 KB Output is correct
40 Correct 1 ms 4440 KB Output is correct
41 Correct 185 ms 23632 KB Output is correct
42 Correct 316 ms 24140 KB Output is correct
43 Correct 305 ms 23896 KB Output is correct
44 Correct 78 ms 19288 KB Output is correct
45 Correct 313 ms 23888 KB Output is correct
46 Correct 333 ms 23888 KB Output is correct
47 Correct 113 ms 19816 KB Output is correct
48 Correct 321 ms 23888 KB Output is correct
49 Correct 338 ms 24140 KB Output is correct
50 Correct 339 ms 23924 KB Output is correct
51 Correct 365 ms 23916 KB Output is correct
52 Correct 103 ms 21632 KB Output is correct
53 Correct 309 ms 23920 KB Output is correct
54 Correct 348 ms 24140 KB Output is correct
55 Correct 263 ms 23916 KB Output is correct
56 Correct 341 ms 24168 KB Output is correct
57 Correct 280 ms 23896 KB Output is correct
58 Correct 329 ms 24168 KB Output is correct
59 Correct 195 ms 23896 KB Output is correct
60 Correct 150 ms 23924 KB Output is correct
61 Correct 1 ms 4440 KB Output is correct
62 Correct 52 ms 19544 KB Output is correct
63 Correct 83 ms 24036 KB Output is correct
64 Correct 87 ms 23928 KB Output is correct
65 Correct 89 ms 23896 KB Output is correct
66 Correct 92 ms 24144 KB Output is correct
67 Correct 94 ms 24144 KB Output is correct
68 Correct 92 ms 24140 KB Output is correct
69 Correct 92 ms 24152 KB Output is correct
70 Correct 86 ms 21840 KB Output is correct
71 Correct 107 ms 24172 KB Output is correct
72 Correct 104 ms 24148 KB Output is correct
73 Correct 116 ms 24512 KB Output is correct
74 Correct 119 ms 24148 KB Output is correct
75 Correct 102 ms 24172 KB Output is correct
76 Correct 108 ms 24144 KB Output is correct
77 Correct 77 ms 23908 KB Output is correct
78 Correct 91 ms 24144 KB Output is correct
79 Correct 1 ms 4440 KB Output is correct
80 Correct 1 ms 4440 KB Output is correct
81 Execution timed out 4054 ms 23860 KB Time limit exceeded
82 Halted 0 ms 0 KB -