제출 #1062223

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

fish

#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
#define pb push_back
#define ll long long
#define fi first
#define se second
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;
  long long dp[n][n][2];
  memset(dp,0,sizeof dp);
  long long grid[n][n];
  memset(grid,0,sizeof grid);
  for (int i = 0; i < m; ++i)
  {
    grid[X[i]][Y[i]]=W[i];
  }
  long long pre[n][n];
  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 ans=0;
  int prev[n];
  memset(prev,0,sizeof prev);
  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],max(dp[i-1][k][0],dp[i-1][k][1])+pre[i][k]-(j>0 ? pre[i][j-1] : 0ll));
          if(j==0) {
            if(dp[i][j][0]<max(dp[i-1][k][0],dp[i-1][k][1])+pre[i][k]){
              prev[i]=k;
            }
            dp[i][j][0]=max(dp[i][j][0],max(dp[i-1][k][0],dp[i-1][k][1])+pre[i][k]);
          }
        }else if(k<j){
          if(k==0){
            dp[i][j][0]=max(dp[i][j][0],dp[i-1][k][0]+pre[i-1][j]-min(pre[i-1][j],pre[i-1][prev[i-1]]));    
          }else{
            dp[i][j][0]=max(dp[i][j][0],dp[i-1][k][0]+pre[i-1][j]-(k>0 ? pre[i-1][k-1] : 0ll));            
          }
        }else {
          dp[i][j][0]=max(dp[i][j][0],dp[i-1][k][0]);
          dp[i][j][1]=max(dp[i][j][1],max(dp[i-1][k][0],dp[i-1][k][1]));
        }
      }
      //cout <<i<<" "<<j<<" "<<dp[i][j][0]<<" "<<dp[i][j][1]<<endl;
      ans=max(ans,dp[i][j][0]);
      ans=max(ans,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