제출 #582799

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
582799		MilosMilutinovic	Domino (COCI15_domino)	C++14	10 / 160	2078 ms	524288 KiB

domino

/**
 *    author:  wxhtzdy
 *    created: 24.06.2022 12:30:23
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<vector<int>> a(n, vector<int>(n));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> a[i][j];
    }
  }
  vector<array<int, 3>> b;
  auto Id = [&](int i, int j) {
    return i * n + j;
  };
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (i + 1 < n) {
        b.push_back({a[i][j] + a[i + 1][j], Id(i, j), Id(i + 1, j)});
      }
      if (j + 1 < n) {
        b.push_back({a[i][j] + a[i][j + 1], Id(i, j), Id(i, j + 1)});
      }
    }
  }
  sort(b.rbegin(), b.rend());
  b.resize(min((int) b.size(), 50));
  int L = (int) b.size() / 2;
  int R = (int) b.size() - L;
  vector<vector<int>> f(1 << R, vector<int>(k + 1));
  for (int s = 0; s < (1 << R); s++) {
    if (__builtin_popcount(s) >= k) {
      for (int i = 0; i < R; i++) {
        if (s >> i & 1) {
          for (int j = 0; j <= k; j++) {
            f[s][j] = max(f[s][j], f[s ^ (1 << i)][j]);
          }
        }
      }
      for (int j = 1; j <= k; j++) {
        f[s][j] = max(f[s][j], f[s][j - 1]);
      }
      continue;
    }
    for (int i = 0; i < R; i++) {
      if (s >> i & 1) {
        continue;
      }
      bool ok = true;
      for (int j = 0; j < R; j++) {
        if (!(s >> j & 1)) {
          continue;
        }
        if (b[L + i][1] == b[L + j][1]) {
          ok = false;
        }
        if (b[L + i][1] == b[L + j][2]) {
          ok = false;
        }
        if (b[L + i][2] == b[L + j][1]) {
          ok = false;
        }
        if (b[L + i][2] == b[L + j][2]) {
          ok = false;
        }
      }
      if (ok) {
        for (int j = 0; j < k; j++) {
          f[s | (1 << i)][j + 1] = max(f[s | (1 << i)][j + 1], f[s][j] + b[L + i][0]);
        }
      }
    }
    for (int j = 1; j <= k; j++) {
      f[s][j] = max(f[s][j], f[s][j - 1]);
    }
  }
  int ans = 0;
  for (int s = 0; s < (1 << L); s++) {
    if (__builtin_popcount(s) > k) {
      continue;
    }
    int t = (1 << R) - 1;
    bool ok = true;
    for (int i = 0; i < L; i++) {
      if (s >> i & 1) {
        for (int j = i + 1; j < L; j++) {
          if (s >> j & 1) {
            if (b[i][1] == b[j][1]) {
              ok = false;
            }
            if (b[i][1] == b[j][2]) {
              ok = false;
            }
            if (b[i][2] == b[j][1]) {
              ok = false;
            }
            if (b[i][2] == b[j][2]) {
              ok = false;
            }
          }
        }
      }
    }
    if (!ok) {
      continue;
    }
    for (int i = 0; i < L; i++) {
      if (s >> i & 1) {
        for (int j = 0; j < R; j++) {
          if (t >> j & 1) {
            bool found = false;
            if (b[i][1] == b[L + j][1]) {
              found = true;
            }
            if (b[i][1] == b[L + j][2]) {
              found = true;
            }
            if (b[i][2] == b[L + j][1]) {
              found = true;
            }
            if (b[i][2] == b[L + j][2]) {
              found = true;
            }
            if (found) {
              t ^= (1 << j);
            }
          }
        }
      }
    }
    int ft = 0;
    for (int i = 0; i < L; i++) {
      if (s >> i & 1) {
        ft += b[i][0];
      }
    }
    ans = max(ans, ft + f[t][k - __builtin_popcount(s)]);
  }
  int sum = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      sum += a[i][j];
    }
  }
  cout << sum - ans << '\n';
  return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10
• Subtask 11: 10 / 10
• Subtask 12: 0 / 10
• Subtask 13: 0 / 10
• Subtask 14: 0 / 10
• Subtask 15: 0 / 10
• Subtask 16: 0 / 10