oj.uz

Submission #583339

# Submission time Handle Problem Language Result Execution time Memory
583339 2022-06-25T08:56:20 Z MilosMilutinovic Domino (COCI15_domino) C++14
110 / 160
 4000 ms 273452 KB 
/**
 *    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() > 50) {
    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 1271 ms 155952 KB Output is correct
2 Correct 1297 ms 155928 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1338 ms 148232 KB Output is correct
2 Correct 1359 ms 148236 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3154 ms 272980 KB Output is correct
2 Correct 2788 ms 273424 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1516 ms 148064 KB Output is correct
2 Correct 1536 ms 148060 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2580 ms 218376 KB Output is correct
2 Correct 2345 ms 216552 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2076 ms 179372 KB Output is correct
2 Correct 1986 ms 179420 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3475 ms 273004 KB Output is correct
2 Correct 3193 ms 269520 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2184 ms 148232 KB Output is correct
2 Correct 2011 ms 148236 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3883 ms 272972 KB Output is correct
2 Incorrect 3627 ms 273452 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3346 ms 148488 KB Output is correct
2 Correct 2838 ms 148412 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 340 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 4078 ms 272972 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 4100 ms 148308 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 4100 ms 179264 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
10.0 / 10.0

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

Subtask #16
0 / 10.0

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