Submission #895374

#	Time	Username	Problem	Language	Result	Execution time	Memory
895374		MilosMilutinovic	매우 즐거운 카드 게임 (JOI15_cardgame2)	C++14	100 / 100	2263 ms	503632 KiB

cardgame2

#include <bits/stdc++.h>

using namespace std;

const int MAX = 505;

int dp[MAX][MAX][MAX];

int ckmx(int& a, int b) {
  a = max(a, b);
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> a(n);
  vector<int> c(n);
  vector<int> v(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> c[i] >> v[i];
  }
  vector<vector<bool>> ok(n, vector<bool>(n));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      ok[i][j] = (a[i] == a[j] || c[i] == c[j]);
    }
  }
  const int inf = (int) 1e9;
  for (int i = 0; i < n + 2; i++) {
    for (int j = 0; j < n + 2; j++) {
      for (int k = 0; k < n + 2; k++) {
        dp[i][j][k] = -inf;
      }
    }
  }
  function<int(int, int, int, int)> Solve = [&](int x, int y, int z, int f) {
    if (x >= n) {
      return 0;
    }
    if (dp[x][y][f] != -inf) {
      return dp[x][y][f];
    }
    /*if (was[x][z][f]) {
      return dp[x][z][f];
    }
    was[x][z][f] = true;*/
    dp[x][y][f] = 0;
    if (x < n && ok[f][x]) {
      dp[x][y][f] = max(dp[x][y][f], Solve(y, z, z + 1, x) + v[x]);
    }
    if (z < n && ok[f][z]) {
      dp[x][y][f] = max(dp[x][y][f], Solve(x, y, z + 1, z) + v[z]);
    }
    return dp[x][y][f];
  };
  int res = Solve(1, 2, 3, 0) + v[0];
  if (n >= 3) {
    res = max(res, Solve(0, 1, 3, 2) + v[2]);
  }
  cout << res << '\n';
  return 0;
}

Compilation message (stderr)

cardgame2.cpp: In function 'int ckmx(int&, int)':
cardgame2.cpp:11:1: warning: no return statement in function returning non-void [-Wreturn-type]
   11 | }
      | ^

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 75 / 75