제출 #582614

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

domino

/**
 *    author:  wxhtzdy
 *    created: 24.06.2022 09:28:57
**/
#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];
    }
  }
  int sum = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      sum += a[i][j];
    }
  }
  vector<tuple<int, int, int>> b;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (i + 1 < n) {
        b.emplace_back(-a[i][j] - a[i + 1][j], i * n + j, (i + 1) * n + j);
      }
      if (j + 1 < n) {
        b.emplace_back(-a[i][j] - a[i][j + 1], i * n + j, i * n + j + 1);
      }
    }
  }
  sort(b.begin(), b.end());
  int mx = 0, curr = 0;
  vector<int> v;
  vector<bool> was(n * n);
  auto Valid = [&]() {
    bool ok = true;
    for (int i : v) {
      if (was[i]) {
        ok = false;
      }
      was[i] = true;
    }
    for (int i : v) {
      was[i] = false;
    }                
    return ok;
  };
  function<void(int, int)> Gen = [&](int i, int p) {
    if (p + (int) b.size() - i < k || p > k) {
      return;
    }
    if (i == (int) b.size()) {
      if (Valid()) {
        mx = max(mx, curr);
      }
      return;
    }
    Gen(i + 1, p);
    curr -= get<0>(b[i]);
    v.push_back(get<1>(b[i]));
    v.push_back(get<2>(b[i]));
    Gen(i + 1, p + 1);
    curr += get<0>(b[i]);
    v.pop_back();
    v.pop_back();
  };
  Gen(0, 0);
  cout << sum - mx << '\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