제출 #1069421

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1069421		MarwenElarbi	메기 농장 (IOI22_fish)	C++17	0 / 100	1039 ms	2097152 KiB

fish

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

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;
    int grid[n][n];
    memset(grid,0,sizeof grid);
    long long pre[n][n];
    for (int i = 0; i < m; ++i)
    {
        grid[X[i]][Y[i]]=W[i];
    }
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            pre[i][j]=(j ? pre[i][j-1] : 0)+grid[i][j];
        }
    }
    long long dp[n][n][2];
    memset(dp,0,sizeof dp);
    long long ans=0;
    for (int i = 1; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            for (int k = 0; k < n; ++k)
            {
                if(k<j){
                    dp[i][j][1]=max(dp[i][j][1],dp[i-1][k][1]+pre[i-1][j]-(k ? pre[i-1][k-1] : 0));
                }else if(k>j){
                    dp[i][j][0]=max(dp[i][j][0],dp[i-1][k][1]+pre[i][k]-(j ? pre[i][j-1] : 0));
                    dp[i][j][0]=max(dp[i][j][0],dp[i-1][k][0]+pre[i][k]-(j ? pre[i][j-1] : 0));
                }else if (j==0){
                    dp[i][j][0]=max({dp[i][j][0],dp[i-1][j][0],dp[i-1][j][1]});
                }else{
                    dp[i][j][0]=max({dp[i][j][0],dp[i-1][j][0],dp[i-1][j][1]});
                    dp[i][j][1]=max(dp[i][j][1],dp[i-1][j][1]);
                }
            }
            ans=max({ans,dp[i][j][0],dp[i][j][1]});

        }
    }
    return ans;
}

• 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