Submission #583344

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
583344	2022-06-25T09:03:31 Z	MilosMilutinovic	Domino (COCI15_domino)	C++14	90 / 160	4000 ms	257884 KB

domino

/**
 *    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 f[1 << 23][9];
 
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());
  while ((int) b.size() > 51) {
    b.pop_back();
  }                   
  int sz = (int) b.size();
  int R = min(22, sz / 2);                                      
  int L = sz - R;
  for (int s = 0; s < (1 << R); s++) {
    for (int j = 0; j <= k; j++) {
      f[s][j] = 0;
    }
  }
  for (int s = 0; s < (1 << R); s++) {
    for (int i = 0; i < R; i++) {
      for (int j = 0; j <= k; j++) {
        if (s >> i & 1) {
          f[s][j] = max(f[s][j], f[s ^ (1 << i)][j]);
        }
      }
    }
    for (int p = 1; p <= k; p++) {
      f[s][p] = max(f[s][p], f[s][p - 1]);
    }
    if (__builtin_popcount(s) >= k) {
      continue;
    }
    for (int i = 0; i < R; i++) {
      for (int p = 0; p < k; p++) {
        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)][p + 1] = max(f[s | (1 << i)][p], f[s][p] + b[L + i][0]);
        }
      }
    }
    for (int p = 1; p <= k; p++) {
      f[s][p] = max(f[s][p], f[s][p - 1]);
    }
  }
  int ans = 0;    
  for (int s = 0; s < (1 << R); s++) {
    for (int j = 0; j <= k; j++) {
      ans = max(ans, f[s][j]);
    }
  }
  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
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1907 ms	155020 KB	Output is correct
2	Correct	1986 ms	154928 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1936 ms	148224 KB	Output is correct
2	Correct	1969 ms	148224 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3729 ms	257848 KB	Output is correct
2	Correct	3192 ms	257732 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2118 ms	148092 KB	Output is correct
2	Correct	2037 ms	148172 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2983 ms	209840 KB	Output is correct
2	Correct	2875 ms	209916 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2532 ms	175488 KB	Output is correct
2	Correct	2528 ms	175588 KB	Output is correct

Subtask #7
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	4048 ms	257884 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2788 ms	148292 KB	Output is correct
2	Correct	2652 ms	148220 KB	Output is correct

Subtask #9
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	4100 ms	257792 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	4011 ms	148428 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #11
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	468 KB	Output is correct
2	Correct	5 ms	468 KB	Output is correct

Subtask #12
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	4098 ms	257796 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #13
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	4099 ms	148216 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #14
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	4101 ms	175576 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #15
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	924 ms	37236 KB	Output is correct
2	Correct	924 ms	37240 KB	Output is correct

Subtask #16
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	4073 ms	257788 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Submission #583344

Compilation message