Submission #1234586

#	Time	Username	Problem	Language	Result	Execution time	Memory
1234586		rxlfd314	Catfish Farm (IOI22_fish)	C++20	0 / 100	992 ms	2162688 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ari2 = array<int, 2>;
using ari3 = array<int, 3>;
using arl2 = array<ll, 2>;
using arl3 = array<ll, 3>;
template <class T> using vt = vector<T>;
#define all(x) begin(x), end(x)
#define size(x) (int((x).size()))
#define REP(a,b,c,d) for(int a=(b);(d)>0?a<=(c):a>=(c);a+=(d))
#define FOR(a,b,c) REP(a,b,c,1)
#define ROF(a,b,c) REP(a,b,c,-1)

constexpr ll INF = 1e18;

ll max_weights(int N, int M, vt<int> X, vt<int> Y, vt<int> W) {
  vt<vt<ll>> P(N+1, vt<ll>(N+1));
  FOR(i, 0, M-1) {
    X[i]++, Y[i]++;
    P[X[i]][Y[i]] = W[i];
  }
  FOR(i, 1, N)
    FOR(j, 1, N)
      P[i][j] += P[i][j-1];
  vt<vt<arl2>> dp(N+1, vt<arl2>(N+1, {-INF, -INF}));
  dp[0][0][0] = dp[0][0][1] = 0;
  ll ans = 0;
  FOR(i, 1, N)
    FOR(j, 0, N) {
      FOR(k, 0, j)
        dp[i][j][0] = max(dp[i][j][0], (i > 1 ? max(dp[i-2][k][0], dp[i-2][k][1]) : 0) + P[i-1][j]);
      FOR(k, j+1, N)
        dp[i][j][0] = max(dp[i][j][0], (i > 1 ? max(dp[i-2][k][0], dp[i-2][k][1]) : 0) + P[i-1][k]);
      dp[i][j][1] = dp[i][j][0];
      FOR(k, 0, j)
        dp[i][j][0] = max(dp[i][j][0], dp[i-1][k][0] + P[i-1][j] - P[i-1][k]);
      FOR(k, j, N)
        dp[i][j][1] = max(dp[i][j][1], dp[i-1][k][1] + P[i][k] - P[i][j]);
      ans = max({ans, dp[i][j][0], dp[i][j][1]});
      FOR(k, 0, N)
        ans = max(ans, max(dp[i-1][k][0], dp[i-1][k][1]) + P[i][k]);
    }
  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