Submission #836656

#	Time	Username	Problem	Language	Result	Execution time	Memory
836656		Abrar_Al_Samit	Catfish Farm (IOI22_fish)	C++17	9 / 100	31 ms	12876 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>

using namespace std;

const int nax = 100000;

long long fish[nax];
long long dp[nax][2];
int n;
long long solve(int i, int mask) {
	if(i==n) return 0LL;
	long long &ret = dp[i][mask];
	if(ret!=-1) return ret;

	ret = solve(i+1, 1);
	if(mask) ret = max(ret, solve(i+1, 0) + fish[i]);
	else if(i < n-1) ret = max(ret, solve(i+2, 1) + fish[i]);
	return ret;
}
long long max_weights(int N, int M, vector<int> X, vector<int> Y,
                      vector<int> W) {
	n = N;
    for(int i=0; i<M; ++i) {
        fish[X[i]] = W[i];
    }
    
    memset(dp, -1, sizeof dp);
    return solve(0, 0);
}

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