Submission #1234580

#	Time	Username	Problem	Language	Result	Execution time	Memory
1234580		Ghulam_Junaid	Catfish Farm (IOI22_fish)	C++20	9 / 100	26 ms	5820 KiB

fish

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

typedef long long ll;

ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    vector<pair<int, int>> vec;
    ll xx[n + 1] = {};
    for (int i = 0; i < m; i ++){
        vec.push_back({x[i], w[i]});
        xx[x[i]] = w[i];
    }
    sort(vec.begin(), vec.end());

    ll dp[n][2] = {};
    dp[0][0] = 0, dp[0][1] = xx[1];
    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][1] - xx[i] + xx[i + 1];
        if (i == 1) dp[i][1] = max(dp[i][1], xx[0] + xx[2]);
        else{
            dp[i][1] = max(dp[i][1], dp[i - 2][0] + xx[i - 1] + xx[i + 1]);
            dp[i][1] = max(dp[i][1], dp[i - 2][1] + xx[i + 1]);
        }
    }

    return max(dp[n - 1][0], dp[n - 1][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