Submission #1224385

#	Time	Username	Problem	Language	Result	Execution time	Memory
1224385		trimkus	Catfish Farm (IOI22_fish)	C++20	35 / 100	1116 ms	2162688 KiB

fish

#include "fish.h"

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

void chmax(ll& x, ll y) {
  x = max(x, y);
}

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    vector<vector<ll>> a(N + 3, vector<ll>(N + 3));
    for (int i = 0; i < M; ++i) {
        a[X[i] + 1][Y[i] + 1] += W[i];
    }
    for (int i = 1; i <= N; ++i) {
      for (int j = 1; j <= N; ++j) {
        a[i][j] += a[i][j - 1];
      }
    }
    vector<vector<vector<ll>>> dp(N + 2, vector<vector<ll>>(N + 2, vector<ll>(2)));
    for (int i = 2; i <= N; ++i) {
      for (int j = 0; j <= N; ++j) {
        for (int k = 0; k < j; ++k) {
          dp[i][j][1] = max({dp[i][j][1], dp[i - 1][k][1] + a[i - 1][j] - a[i - 1][k]});
        }
        for (int k = 0; k <= N; ++k) {
          if (i == 2) {
            dp[i][j][1] = a[i - 1][j];
            dp[i][j][0] = a[i - 1][j];
          } else {
            dp[i][j][1] = max(dp[i][j][1], max(dp[i - 2][k][1], dp[i - 2][k][0]) + a[i - 1][max(j, k)]);
            dp[i][j][0] = max(dp[i][j][0], max(dp[i - 2][k][1], dp[i - 2][k][0]) + a[i - 1][max(j, k)]);
          }
        }
        for (int k = j; k <= N; ++k) {
          dp[i][j][0] = max({dp[i][j][0], max(dp[i - 1][k][0], dp[i - 1][k][1]) + a[i][k] - a[i][j]});
        }
      }
    }
    // for (int i = 1; i <= N; ++i) {
    //   for (int j = 0; j <= N; ++j) {
    //     for (int k = 0; k < 2; ++k) {
    //       cerr << dp[i][j][k] << " ";
    //     }
    //     cerr << "\n";
    //   }
    //   cerr << "\n";
    // }
    // cerr << "\n";
    ll res = 0;
    for (int i = 0; i <= N; ++i) {
      for (int k = 0; k < 2; ++k) {
        res = max(res, dp[N][i][k]);
      }
    }
    return res;
}

• 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