Submission #866564

#	Time	Username	Problem	Language	Result	Execution time	Memory
866564		vjudge1	Catfish Farm (IOI22_fish)	C++17	0 / 100	20 ms	7968 KiB

fish

#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long// !
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define F first
#define S second
const int MAXN = 1e5 + 3;

ll dp[MAXN][2];
ll a[MAXN];
ll max_weights(int n, int m, vector<int> X, std::vector<int> Y, vector<int> W) {
	// dp[i][j], for i'th column just before the j'th element
	vector<pair<int, int>> pos[MAXN];
	for (int i = 0; i < m; i++){
		a[X[i]+1] = W[i];
		pos[X[i]+1].push_back({Y[i], W[i]});
	}
	for (int i = 1; i <= n; i++){
		dp[i][0] = max(dp[i-1][1], dp[i-1][0]);
		dp[i][1] = dp[i-1][0]+a[i-1];
		if (i == n){
			dp[i][0] = max(dp[i-1][1] + a[i], dp[i-1][0]);
		}
	}
	return max(dp[n][0], dp[n][1]);
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16