Submission #871737

#	Time	Username	Problem	Language	Result	Execution time	Memory
871737		Ludissey	Catfish Farm (IOI22_fish)	C++17	0 / 100	885 ms	2097152 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
vector<vector<int>> a;
vector<vector<vector<int>>> memo;
int N,M;
int dp(int x, int last, int lastlast){
  if(memo[x][last][lastlast]!=-1) return memo[x][last][lastlast];
  if(x==N){
    int c=0;
    for (int y = last; y <= lastlast; y++) c+=a[x-1][y];
    return memo[x][last][lastlast]=c;
  }
 
  memo[x][last][lastlast] = 0;
  for (int i = 0; i < min(9LL,N); i++)
  {
    int c=dp(x+1, i, last);
    if(x>0) for (int y = last; y <= max(i,lastlast); y++) c+=a[x-1][y];
    memo[x][last][lastlast]=max(c, memo[x][last][lastlast]);
  }
  return memo[x][last][lastlast];
}
 
long long max_weights(signed n, signed m, std::vector<signed> X, std::vector<signed> Y, std::vector<signed> W) {
  N=n; M=m; 
  a.resize(N, vector<int>(N,0));
  memo.resize(N+1, vector<vector<int>>(N+1, vector<int>(N+1,-1)));
  for (int i = 0; i < M; i++){
    a[X[i]][Y[i]] = W[i];
  }
  int p=dp(0,0,0);
  return p;
}

• 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