Submission #1177802

#	Time	Username	Problem	Language	Result	Execution time	Memory
1177802		PagodePaiva	Catfish Farm (IOI22_fish)	C++20	14 / 100	27 ms	5192 KiB

fish

#include "fish.h"
#include<bits/stdc++.h>
#define ll long long

using namespace std;

const int N = 310;
const int MAXY = 10;
ll dp[N][MAXY][MAXY];
ll mat[N][N];

ll calc(int i, int y1, int y2, int y3){
    ll sum = 0;
    for(int j = y2+1;j <= max(y1, y3);j++){
        sum += mat[i][j];
    }
    return sum;
}

long long max_weights(int n, int m, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    for(int i = 0;i < m;i++){
        mat[X[i]+1][Y[i]+1] = W[i];
    }
    for(int i = 0;i < N;i++)
        for(int y2 = 0;y2 < MAXY;y2++)
            for(int y3 = 0;y3 < MAXY;y3++)
                dp[i][y2][y3] = -1e18;
    for(int j = 0;j < MAXY;j++){
        dp[0][0][j] = 0;
    }
    for(int i = 1;i <= n;i++){
        for(int y1 = 0;y1 < MAXY;y1++){
            for(int y2 = 0;y2 < MAXY;y2++){
                for(int y3 = 0;y3 < MAXY;y3++){
                    dp[i][y2][y3] = max(dp[i][y2][y3], dp[i-1][y1][y2]+calc(i, y1, y2, y3));
                }
            }
        }
    }
    ll ans = 0;
    for(int y1 = 0;y1 < MAXY;y1++){
        for(int y2 = 0;y2 < MAXY;y2++){
            ans = max(ans, dp[n][y2][0]);
        }
    }
    return ans;
}

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