Submission #628649

#	Time	Username	Problem	Language	Result	Execution time	Memory
628649		Ronin13	Catfish Farm (IOI22_fish)	C++17	52 / 100	1095 ms	218992 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#include <vector>
using namespace std;

const int NMAX = 3005;
ll dp[NMAX][NMAX];//klebadi
ll DP[NMAX][NMAX];//zrdadi
ll val[NMAX][NMAX];
const ll linf = 1e18;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) {
    int n = N;
    int m = M;
    for(int i = 0; i < m; i++){
        val[X[i] + 1][Y[i] + 1] = W[i];
    }
    /*for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++) cout << val[i][j] << ' ';
        cout << "\n";
    }*/


    DP[0][0] = 0;
    for(int i = 1; i <= n + 1; i++){
        if(i != 1){
            for(int j = n; j >= 1; j--){
                if(j == n){
                    dp[i][j] = max(DP[i - 2][j], dp[i - 2][1]) + val[i][j];
                }
                else dp[i][j] = max(dp[i - 1][j + 1], dp[i][j + 1]) + val[i][j];
            // dp[i][j] = max(dp[i][j], dp[i - 1][j]);
            }
        }
        for(int j = 1; j <= n; j++){
            if(j == 1)DP[i][j] = dp[i - 1][j] + val[i][j];
            else DP[i][j] = max(DP[i - 1][j - 1], DP[i][j - 1]) + val[i][j];
          //  DP[i][j] = max(DP[i - 1][j], DP[i][j]);
        }
    }

    for(int i = 1; i <= n + 1; i++) dp[n + 1][1] = max(dp[i][1], dp[n + 1][1]);
    return dp[n + 1][1];
    return 0;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 14 / 14
• Subtask 5: 21 / 21
• Subtask 6: 17 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16