oj.uz

Submission #1027879

# Submission time Handle Problem Language Result Execution time Memory
1027879 2024-07-19T10:52:11 Z Unforgettablepl Mizuyokan 2 (JOI23_mizuyokan2) C++17
15 / 100
 4000 ms 7492 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

void answer(vector<int> arr){
	int n = arr.size();
	arr.insert(arr.begin(),0);
	vector<int> DP(n+1);
	for(int i=1;i<=n;i++){
		int sum = arr[i-1];
		DP[i]=1;
		for(int j=i-2;j>=0;j--){
			if(sum>arr[i] and sum>arr[j])DP[i]=max(DP[i],DP[j]+2);
			sum+=arr[j];
		}
	}
	int ans = DP[n];
	int sum = arr[n];
	for(int i=n-1;i;i--){
		if(arr[i]<sum)ans=max(ans,DP[i]+1);
		sum+=arr[i];
	}
	cout << ans << '\n';
}

int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int n;
	cin >> n;
	vector<int> L(n+1);
	for(int i=1;i<=n;i++)cin>>L[i];
	int q;
	cin >> q;
	for(int i=1;i<=q;i++){
		int x,y,a,b;cin>>x>>y>>a>>b;
		L[x]=y;
		vector<int> arr;
		for(int j=a+1;j<=b;j++){
			arr.emplace_back(L[j]);
		}
		answer(arr);
	}
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 452 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 452 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 5 ms 564 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 6 ms 348 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 3 ms 348 KB Output is correct
31 Correct 5 ms 484 KB Output is correct
32 Correct 3 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 4 ms 348 KB Output is correct
35 Correct 4 ms 348 KB Output is correct
36 Correct 3 ms 348 KB Output is correct
37 Correct 5 ms 348 KB Output is correct
38 Correct 2 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 452 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 5 ms 564 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 6 ms 348 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 3 ms 348 KB Output is correct
31 Correct 5 ms 484 KB Output is correct
32 Correct 3 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 4 ms 348 KB Output is correct
35 Correct 4 ms 348 KB Output is correct
36 Correct 3 ms 348 KB Output is correct
37 Correct 5 ms 348 KB Output is correct
38 Correct 2 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 21 ms 3932 KB Output is correct
42 Correct 17 ms 4460 KB Output is correct
43 Correct 37 ms 4436 KB Output is correct
44 Correct 168 ms 3808 KB Output is correct
45 Execution timed out 4066 ms 7492 KB Time limit exceeded
46 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 146 ms 1980 KB Output is correct
3 Correct 2391 ms 5988 KB Output is correct
4 Execution timed out 4035 ms 4692 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 29.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 128 ms 2348 KB Output is correct
4 Correct 2246 ms 4888 KB Output is correct
5 Execution timed out 4051 ms 6136 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 452 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 5 ms 564 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 6 ms 348 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 3 ms 348 KB Output is correct
31 Correct 5 ms 484 KB Output is correct
32 Correct 3 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 4 ms 348 KB Output is correct
35 Correct 4 ms 348 KB Output is correct
36 Correct 3 ms 348 KB Output is correct
37 Correct 5 ms 348 KB Output is correct
38 Correct 2 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 21 ms 3932 KB Output is correct
42 Correct 17 ms 4460 KB Output is correct
43 Correct 37 ms 4436 KB Output is correct
44 Correct 168 ms 3808 KB Output is correct
45 Execution timed out 4066 ms 7492 KB Time limit exceeded
46 Halted 0 ms 0 KB -