Submission #628276

#	Time	Username	Problem	Language	Result	Execution time	Memory
628276		abeker	Catfish Farm (IOI22_fish)	C++17	35 / 100	1098 ms	2097152 KiB

fish

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

typedef long long ll;

ll max_weights(int N, int M, vector <int> x, vector <int> y, vector <int> w) {
  vector <vector <ll>> mat(N + 2, vector <ll> (N));
  for (int i = 0; i < M; i++)
    mat[x[i] + 1][y[i]] = w[i];
  vector <ll> sum(N + 2);
  vector <ll> maks(N + 2), mini(N + 2);
  for (int i = 1; i < N + 2; i++) {
    ll curr = 0;
    for (int j = 0; j < N; j++) {
      sum[i] += mat[i][j];
      curr += mat[i - 1][j] - mat[i][j];
      maks[i] = max(maks[i], curr);
      mini[i] = max(mini[i], -curr);
    }
  }
  auto make_sum = [&](vector <ll> &v) {
    for (int i = 1; i < v.size(); i++)
      v[i] += v[i - 1];
  };
  make_sum(maks);
  make_sum(mini);
  auto get_sum = [&](const vector <ll> &pref, int lo, int hi) {
    return pref[hi] - (lo ? pref[lo - 1] : 0);
  };
  vector <vector <ll>> trans(N + 2, vector <ll> (N + 2));
  for (int i = 0; i < N + 2; i++)
    for (int j = i + 1; j < N + 2; j++) {
      if (i)
        trans[i][j] = max(trans[i][j], sum[i + 1] + get_sum(mini, i + 2, j));
      if (j <= N)
        trans[i][j] = max(trans[i][j], sum[j - 1] + get_sum(maks, i + 1, j - 1));
      for (int k = i + 1; k < j; k++)
        trans[i][j] = max(trans[i][j], get_sum(maks, i + 1, k - 1) + get_sum(mini, k + 2, j) + sum[k - 1] + sum[k + 1]);
    }
  vector <ll> dp(N + 2);
  for (int i = 0; i < N + 2; i++)
    for (int j = i; j >= 0; j--)
      dp[i] = max(dp[i], (j ? dp[j - 1] : 0) + trans[j][i]);
  return dp[N + 1];
}

Compilation message (stderr)

fish.cpp: In lambda function:
fish.cpp:23:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for (int i = 1; i < v.size(); i++)
      |                     ~~^~~~~~~~~~

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