oj.uz

Submission #942284

# Submission time Handle Problem Language Result Execution time Memory
942284 2024-03-10T11:59:31 Z Litusiano Feast (NOI19_feast) C++17
30 / 100
 30 ms 2392 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
vector<vector<int>> table;

int query(int l, int r){
	if (l > r) return inf;
    int len = r-l+1;
    int k = 63- __builtin_clzll(len);
    return min(table[l][k], table[r-(1<<k)+1][k]);
}


signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n,k;
	cin>>n>>k;
	if(k == 1){
		int bst = 0;
		int cur = 0;
		for(int i = 0; i<n; i++){
			int a; cin>>a;
			cur = max(0ll, cur+a);
			bst = max(bst,cur);
		}
		cout<<bst<<endl;
		return 0;
	}
	if(n > 3000){
		int s = 0;
		for(int i = 0; i<n; i++){
			int a; cin>>a;
			s+= max(0ll,a);
		}
		cout<<s<<endl;
		return 0;
	}
	vector<int> v(n); for(int& i : v) cin>>i;
	vector<int> pre(n+1); for(int i =0 ; i<n; i++) pre[i+1] = pre[i] + v[i];
	table.resize(n+1, vector<int>(25,inf));
	for(int i = 0; i<=n; i++) table[i][0] = pre[i];
	for(int k = 1; k<25; k++){
		for(int i = 0; i<n; i++){
			int covers = i + (1<<k) -1;
			if(covers >= n) break;
			int nxt = i + (1<<(k-1));
			table[i][k] = min(table[i][k-1], table[nxt][k-1]);
		}
	}

	vector<vector<int>> dp(n+1, vector<int>(k+1,0)); // using i with i first, and k customers 
	for(int i = 0; i<=n; i++) dp[i][0] = 0;
	for(int j = 1; j<=k; j++){
		int cur = 0;
		for(int i = 1; i<=n; i++){
			int idx = i-1;
			dp[i][j] = cur;
			for(int z = 0; z<i; z++){
				dp[i][j] = max(dp[i][j], dp[z][j-1] + pre[i] - query(z, i-1));
			}
			cur = max(cur, dp[i][j] - pre[i]);
		}
	}

	int ans = 0;
	for(int i = 0; i<=n; i++) ans = max(ans, dp[i][k]);
	cout<<ans<<endl;

}

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:58:8: warning: unused variable 'idx' [-Wunused-variable]
   58 |    int idx = i-1;
      |        ^~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 1880 KB Output is correct
2 Correct 22 ms 2224 KB Output is correct
3 Correct 22 ms 2140 KB Output is correct
4 Correct 22 ms 2248 KB Output is correct
5 Correct 22 ms 2104 KB Output is correct
6 Correct 21 ms 1884 KB Output is correct
7 Correct 22 ms 1880 KB Output is correct
8 Correct 30 ms 2128 KB Output is correct
9 Correct 22 ms 1880 KB Output is correct
10 Correct 22 ms 2392 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1116 KB Output is correct
2 Correct 14 ms 1080 KB Output is correct
3 Correct 14 ms 1368 KB Output is correct
4 Correct 14 ms 1112 KB Output is correct
5 Correct 22 ms 1844 KB Output is correct
6 Correct 16 ms 1112 KB Output is correct
7 Correct 14 ms 1116 KB Output is correct
8 Correct 22 ms 2140 KB Output is correct
9 Correct 21 ms 1884 KB Output is correct
10 Correct 14 ms 1080 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2140 KB Output is correct
2 Correct 24 ms 2140 KB Output is correct
3 Correct 24 ms 2140 KB Output is correct
4 Correct 24 ms 2228 KB Output is correct
5 Correct 24 ms 2140 KB Output is correct
6 Correct 27 ms 2140 KB Output is correct
7 Correct 24 ms 2104 KB Output is correct
8 Correct 24 ms 2392 KB Output is correct
9 Correct 28 ms 2136 KB Output is correct
10 Correct 24 ms 460 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 1880 KB Output is correct
2 Correct 22 ms 2224 KB Output is correct
3 Correct 22 ms 2140 KB Output is correct
4 Correct 22 ms 2248 KB Output is correct
5 Correct 22 ms 2104 KB Output is correct
6 Correct 21 ms 1884 KB Output is correct
7 Correct 22 ms 1880 KB Output is correct
8 Correct 30 ms 2128 KB Output is correct
9 Correct 22 ms 1880 KB Output is correct
10 Correct 22 ms 2392 KB Output is correct
11 Correct 14 ms 1116 KB Output is correct
12 Correct 14 ms 1080 KB Output is correct
13 Correct 14 ms 1368 KB Output is correct
14 Correct 14 ms 1112 KB Output is correct
15 Correct 22 ms 1844 KB Output is correct
16 Correct 16 ms 1112 KB Output is correct
17 Correct 14 ms 1116 KB Output is correct
18 Correct 22 ms 2140 KB Output is correct
19 Correct 21 ms 1884 KB Output is correct
20 Correct 14 ms 1080 KB Output is correct
21 Correct 24 ms 2140 KB Output is correct
22 Correct 24 ms 2140 KB Output is correct
23 Correct 24 ms 2140 KB Output is correct
24 Correct 24 ms 2228 KB Output is correct
25 Correct 24 ms 2140 KB Output is correct
26 Correct 27 ms 2140 KB Output is correct
27 Correct 24 ms 2104 KB Output is correct
28 Correct 24 ms 2392 KB Output is correct
29 Correct 28 ms 2136 KB Output is correct
30 Correct 24 ms 460 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Incorrect 1 ms 348 KB Output isn't correct
33 Halted 0 ms 0 KB -