Submission #625410

#	Time	Username	Problem	Language	Result	Execution time	Memory
625410		model_code	Catfish Farm (IOI22_fish)	C++17	23 / 100	896 ms	85028 KiB

fish

#include "fish.h"

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

const int kMaxN = 100'000;
const int kMaxY = 8;
const long long kInf = 4e18;

long long psum[kMaxN][kMaxY+1];
long long dp[kMaxN][kMaxY+1][kMaxY+1];
int N;

long long solve(int col, int y_bef2, int y_bef) {
  if (col == N) {
    return 0;
  }
  long long &ret = dp[col][y_bef2][y_bef];
  if (ret != -1) {
    return ret;
  }

  ret = -kInf;
  for (int y = 0 ; y <= kMaxY ; y++) {
    long long add = 0;

    if (col > 0) add -= psum[col][min(y, y_bef)];
    if (col > 0) {
      int covered = max(y_bef2, y_bef);
      covered = min(covered, y);
      add += (psum[col-1][y] - psum[col-1][covered]);
    }
    if (col+1 < N) add += psum[col+1][y];

    ret = max(ret, add + solve(col+1, y_bef, y));
  }

  return ret;
}

long long max_weights(int _N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
  N = _N;
  for (int i = 0 ; i < M ; i++) {
    psum[X[i]][Y[i]+1] += W[i]; // increment y by one to ease our life
  }
  for (int i = 0 ; i < N ; i++) {
    for (int j = 1 ; j <= kMaxY ; j++) {
      psum[i][j] += psum[i][j-1];
    }
  }

  memset(dp, -1, sizeof dp);
  long long ret = solve(0, 0, 0);
  return ret;
}

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