/**
* author: wxhtzdy
* created: 24.06.2022 12:30:23
**/
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
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<int> f(1 << R);
for (int s = 0; s < (1 << R); s++) {
if (__builtin_popcount(s) >= k) {
for (int i = 0; i < n; i++) {
if (s >> i & 1) {
f[s] = max(f[s], f[s ^ (1 << i)]);
}
}
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) {
f[s | (1 << i)] = max(f[s | (1 << i)], f[s] + b[L + i][0]);
}
}
}
debug(f);
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]);
}
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;
}
Compilation message
domino.cpp: In function 'int main()':
domino.cpp:45:20: warning: statement has no effect [-Wunused-value]
45 | #define debug(...) 42
| ^~
domino.cpp:114:3: note: in expansion of macro 'debug'
114 | debug(f);
| ^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4105 ms |
138628 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4101 ms |
131688 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4094 ms |
241396 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1818 ms |
131636 KB |
Output is correct |
| 2 |
Correct |
1847 ms |
131532 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4075 ms |
193520 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4077 ms |
159276 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4072 ms |
241400 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4051 ms |
131740 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4064 ms |
241312 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4054 ms |
132040 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4057 ms |
241408 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4051 ms |
131840 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4048 ms |
159192 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
185 ms |
4436 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4062 ms |
241448 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
