Submission #634138

#	Time	Username	Problem	Language	Result	Execution time	Memory
634138		Utaha	Catfish Farm (IOI22_fish)	C++17	9 / 100	28 ms	7020 KiB

fish

#include "fish.h"

#include <bits/stdc++.h>
using namespace std;

const int maxN = 100005;
const long long INF = 1e18;
// 0: fish exist
// 1: pier
// 2: claimed
long long dp[3][maxN];
long long val[maxN];

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    for (auto x : Y) {
        assert (x == 0);
    }
    long long sum = 0;

    for(int i = 0; i < M; i++) {
        val[X[i] + 1] = W[i];
    }
    for(int i = 1; i <= N; i++) {
        sum += val[i];
    }
    assert (sum > 0);
    dp[0][0] = 0;
    dp[1][0] = -INF;
    dp[2][0] = -INF;
    for(int i = 1; i <= N + 1; i++){
        dp[0][i] = max({dp[2][i - 1], dp[0][i - 1]});
        dp[1][i] = max({dp[1][i - 1] + val[i + 1] - val[i], dp[0][i - 1] + val[i - 1] + val[i + 1], dp[2][i - 1] + val[i + 1]});
        dp[2][i] = dp[1][i - 1];
    }
    return max(dp[0][N + 1], dp[2][N + 1]);
}

• 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