Submission #1079103

#	Time	Username	Problem	Language	Result	Execution time	Memory
1079103		ArthuroWich	Catfish Farm (IOI22_fish)	C++17	0 / 100	32 ms	22868 KiB

fish

#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int max_weights(int32_t N, int32_t M, vector<int32_t> X, vector<int32_t> Y, vector<int32_t> W) {
    int n = N, m = M;
    vector<vector<int>> c(1, vector<int>(n+1, 0));
    vector<vector<vector<int>>> dp(1, vector<vector<int>>(n+1, vector<int>(2, 0)));
    for (int i = 0; i < m; i++) {
        c[X[i]][Y[i]] = W[i];
    }
    int i = 0;
    for (int j = 0; j < n; j++) {
        if (j-1 >= 0) {
            dp[i][j][0] = max(dp[i][j][0], dp[i][j-1][1]+c[i][j]);
            dp[i][j][0] = max(dp[i][j][0], dp[i][j-1][0]);
            dp[i][j][1] = max(dp[i][j][1], dp[i][j-1][0]);
            dp[i][j][1] = max(dp[i][j][1], dp[i][j-1][1]);
        }
        if (j == 1) {
            dp[i][j][1] = max(dp[i][j][1], dp[i][j-1][0]+c[i][j-1]);
        }
        if (j-1 >= 0) {
            dp[i][j][1] = max(dp[i][j][1], dp[i][j-2][0]+c[i][j-2]);
            dp[i][j][1] = max(dp[i][j][1], dp[i][j-2][1]+c[i][j-2]);
        }
    }
    return max(dp[n-1][n-1][0], dp[n-1][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