Submission #1199985

#	Time	Username	Problem	Language	Result	Execution time	Memory
1199985		fadyscube	Catfish Farm (IOI22_fish)	C++17	9 / 100	21 ms	10056 KiB

fish

#include "fish.h"

#include <vector>
#include <algorithm>

using namespace std;

#define ll long long

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    vector<vector<ll>> dp(N, vector<ll>(4, 0));
    vector<int> v(N, 0);
    for (int i = 0; i < M; i++)
        v[X[i]] = W[i];

    for (int i = 1; i < N; i++) {
        dp[i][0] = max(dp[i-1][0], dp[i-1][2]);
        dp[i][1] = max(dp[i-1][0] + v[i-1], dp[i-1][2]);
        dp[i][2] = max(dp[i-1][1] + v[i], dp[i-1][3] + v[i]);
        dp[i][3] = max(dp[i-1][1], dp[i-1][3]);
    }

    return max({dp[N-1][0], dp[N-1][1], dp[N-1][2], dp[N-1][3]});
}

• 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