제출 #1223687

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1223687		trimkus	메기 농장 (IOI22_fish)	C++20	14 / 100	959 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]][Y[i]] += W[i];
    }
    int L = min(N, 8);
    const ll INF = 1e18;
    ll dp[N][L + 1][L + 1][L + 1];
    for (int i = 0; i < N; ++i) {
      for (int j = 0; j < L + 1; ++j) {
        for (int k = 0; k < L + 1; ++k) {
          for (int l = 0; l < L + 1; ++l) {
            dp[i][j][k][l] = -INF;
          }
        }
      }
    }
    for (int i = 0; i < N; ++i) {
      for (int j = 0; j < L + 1; ++j) {
        for (int k = 0; k < L + 1; ++k) {
          ll ndp = 0;
          if (i > 0) {
            for (int l = 0; l < L + 1; ++l) {
                ndp = max(ndp, dp[i - 1][l][k][j]);
            }
          }
          if (i == 0 && k != 0) ndp = -INF;
          for (int l = 0; l < L + 1; ++l) {
              ll add = 0;
              int st = j;
              int en = max(k, l);
              for (int m = st; m < en; ++m) {
                add += a[i][m];
              }
              if (i + 1 == N && l != 0) add = -INF;
              chmax(dp[i][k][j][l], ndp + add);
          }
        }
      }
    }
    ll res = 0;
    for (int i = 0; i < L + 1; ++i) {
      for (int j = 0; j < L + 1; ++j) {
        for (int k = 0; k < L + 1; ++k) {
          res = max(res, dp[N - 1][i][j][k]);
        }
      }
    }
    return res;
}

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