Submission #1056573

#	Time	Username	Problem	Language	Result	Execution time	Memory
1056573		noyancanturk	메기 농장 (IOI22_fish)	C++17	0 / 100	558 ms	465696 KiB

fish

#include "fish.h"

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

using lint=long long;

const int lim=3e3+100;

int n,m;
lint dp[lim][lim],up[lim][lim];
lint pref[lim][lim];
lint p(int i,int l,int r){
  if(r<l)return 0;
  if(l){
    //cerr<<pref[i][r]<<" "<<pref[i][l-1]<<" "<<pref[i][r]-pref[i][l-1]<<"\n";
    return pref[i][r]-pref[i][l-1];
  }
  return pref[i][r];
}

lint max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
  n=N,m=M;
  for(int i=0;i<m;i++){
    pref[X[i]][Y[i]+1]+=W[i];
  }
  for(int i=0;i<n;i++){
    for(int j=1;j<n;j++){
      pref[i][j]+=pref[i][j-1];
    }
  }
  n=N,m=M;
  for(int i=0;i<n;i++){
    dp[0][i]=p(1,0,i);
  }
  for(int i=1;i<n;i++){
    for(int j=0;j<=n;j++){
      for(int k=j;k<=n;k++){
        dp[i][j]=max(dp[i][j],dp[i-1][k]-p(i,0,j)+p(i+1,0,j));
        up[i][k]=max(up[i][k],dp[i-1][k]-p(i,0,j));
      }
      for(int k=0;k<=j;k++){
        dp[i][j]=max(dp[i][j],up[i-1][k]+p(i-1,k+1,j)+p(i+1,0,j));
        up[i][j]=max(up[i][j],up[i-1][k]+p(i-1,k+1,j));
      }
    }  
  }
  lint ans=0;
  for(int i=0;i<=n;i++){
    ans=max(ans,dp[n-1][i]);
  }
  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