Submission #724309

# Submission time Handle Problem Language Result Execution time Memory
724309 2023-04-15T04:37:17 Z vjudge1 Catfish Farm (IOI22_fish) C++17
18 / 100
88 ms 9572 KB
#pragma GCC optimize("O3")
#include "fish.h"
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;
const ll INF = 3e14 + 4; 
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
	int flag = 0;
	for(int i = 0; i < M; i++){
		if(X[i] > 1){
			flag = 1;
		}
	}
	if(flag){
		ll dp[N][2], a[N];
		memset(dp, 0, sizeof(dp)); memset(a, 0, sizeof(a));
		for(int i = 0; i < M; i++) a[X[i]] += W[i]; 
		dp[1][0] = a[1];
		dp[1][1] = a[0];
		for(int i = 2; i < N; i++){
			dp[i][0] = max(dp[i - 1][1] + a[i], dp[i - 1][0]);
			dp[i][1] = max(max(dp[i - 2][0] + a[i - 1], dp[i - 1][1]), dp[i - 2][1] + a[i - 1]);
		}
		return max(dp[N - 1][0], dp[N - 1][1]);
	}
	ll ans[N + 1][2];
	memset(ans, 0, sizeof(ans));
	for(int i = 0; i < M; i++){
		ans[Y[i] + 1][X[i]] = W[i];
	}
	for(int i = 1; i <= N; i++){
		ans[i][0] += ans[i - 1][0];
		ans[i][1] += ans[i - 1][1];
	}
	ll res = max(ans[N][0], ans[N][1]);
	if(N <= 2) return res;
	for (int i = 0; i <= N; i++)
	{
		res = max(res, ans[i][0] + (ans[N][1] - ans[i][1]));
	}
	return res;
}
# Verdict Execution time Memory Grader output
1 Correct 22 ms 3540 KB Output is correct
2 Correct 29 ms 4172 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 85 ms 9572 KB Output is correct
6 Correct 88 ms 9572 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 44 ms 5408 KB Output is correct
3 Correct 57 ms 6480 KB Output is correct
4 Correct 21 ms 3556 KB Output is correct
5 Correct 28 ms 4176 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 1832 KB Output is correct
11 Correct 1 ms 1748 KB Output is correct
12 Correct 21 ms 3540 KB Output is correct
13 Correct 28 ms 4172 KB Output is correct
14 Correct 22 ms 3576 KB Output is correct
15 Correct 27 ms 3920 KB Output is correct
16 Correct 21 ms 3540 KB Output is correct
17 Correct 25 ms 3900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 2516 KB Output is correct
3 Correct 15 ms 3668 KB Output is correct
4 Correct 10 ms 3428 KB Output is correct
5 Correct 25 ms 4936 KB Output is correct
6 Correct 21 ms 4932 KB Output is correct
7 Correct 25 ms 4948 KB Output is correct
8 Correct 26 ms 4936 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 2516 KB Output is correct
3 Correct 15 ms 3668 KB Output is correct
4 Correct 10 ms 3428 KB Output is correct
5 Correct 25 ms 4936 KB Output is correct
6 Correct 21 ms 4932 KB Output is correct
7 Correct 25 ms 4948 KB Output is correct
8 Correct 26 ms 4936 KB Output is correct
9 Incorrect 25 ms 4948 KB 1st lines differ - on the 1st token, expected: '99999', found: '66666'
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 22 ms 3540 KB Output is correct
2 Correct 29 ms 4172 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 85 ms 9572 KB Output is correct
6 Correct 88 ms 9572 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 44 ms 5408 KB Output is correct
9 Correct 57 ms 6480 KB Output is correct
10 Correct 21 ms 3556 KB Output is correct
11 Correct 28 ms 4176 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 1832 KB Output is correct
17 Correct 1 ms 1748 KB Output is correct
18 Correct 21 ms 3540 KB Output is correct
19 Correct 28 ms 4172 KB Output is correct
20 Correct 22 ms 3576 KB Output is correct
21 Correct 27 ms 3920 KB Output is correct
22 Correct 21 ms 3540 KB Output is correct
23 Correct 25 ms 3900 KB Output is correct
24 Correct 1 ms 1748 KB Output is correct
25 Correct 1 ms 2516 KB Output is correct
26 Correct 15 ms 3668 KB Output is correct
27 Correct 10 ms 3428 KB Output is correct
28 Correct 25 ms 4936 KB Output is correct
29 Correct 21 ms 4932 KB Output is correct
30 Correct 25 ms 4948 KB Output is correct
31 Correct 26 ms 4936 KB Output is correct
32 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
33 Halted 0 ms 0 KB -