Submission #629079

#	Time	Username	Problem	Language	Result	Execution time	Memory
629079		Justin1	Catfish Farm (IOI22_fish)	C++17	0 / 100	22 ms	3664 KiB

fish

#include "fish.h"
 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
ll dp[100005][2], ar[100005];
//0 = dont choose, 1 = choose

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
	for (int i = 0; i < M; i++) ar[X[i]] = W[i];
	dp[0][1] = ar[0]; 
	for (int i = 1; i < N; i++) {
		dp[i][0] = max(dp[i-1][0], dp[i-1][1]);
		dp[i][1] = dp[i-1][0] + ar[i];
	}
	return max(dp[N-1][0], dp[N-1][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