Submission #915542

#	Time	Username	Problem	Language	Result	Execution time	Memory
915542		Namkhing	Catfish Farm (IOI22_fish)	C++17	0 / 100	19 ms	5460 KiB

fish

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

typedef long long ll;
typedef vector<int> vi;

const int Max = 1e5 + 1;
ll fish[Max], dp[Max][2];

ll max_weights(int N, int M, vi X, vi Y, vi W) {
    for (int i = 0; i < M; i++) {
        fish[X[i]] = W[i];
    }

    dp[0][0] = fish[0];

    for (int i = 1; i < N; i++) {
        dp[i][1] = max(dp[i-1][1], dp[i-1][0]);
        dp[i][0] = max(dp[i-1][0], dp[i-1][1] + fish[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