| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 544101 |
2022-04-01T04:15:34 Z |
Olympia |
Domino (COCI15_domino) |
C++17 |
|
4000 ms |
492744 KB |
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <bitset>
#include <stack>
#include <cstdlib>
#include <queue>
#include <stdint.h>
#include <vector>
#include <cassert>
#include <numeric>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdio>
#include <limits.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
struct Domino {
pair<int,int> from, to;
int64_t cost;
bool operator < (const Domino& d1) const {
if (this->cost != d1.cost) return (this->cost > d1.cost);
if (this->from != d1.from) return (this->from < d1.from);
if (this->to != d1.to) return (this->to < d1.to);
return false;
}
};
class Graph {
public:
vector<int64_t> weight;
vector<vector<int>> adj;
vector<int64_t> dp;
void add_edge (int u, int v) {
adj[u][v] = adj[v][u] = 1;
}
Graph (int n) {
adj.resize(n);
for (int i = 0; i < n; i++) {
adj[i].assign(n, 0);
}
}
void solve (int k, bool b) {
dp.assign((1 << (int)adj.size()), 0);
for (int i = 0; i < dp.size(); i++) {
if (__builtin_popcount(i) > k) {
continue;
}
vector<int> nodes;
for (int j = 0; j < adj.size(); j++) {
if (i & (1 << j)) {
nodes.push_back(j);
}
}
bool fine = true;
for (int x: nodes) {
for (int y: nodes) {
if (x <= y) break;
if (!adj[x][y]) {
fine = false;
}
}
}
if (!fine) {
continue;
}
for (int x: nodes) {
dp[i] += weight[x];
}
}
if (b) return;
for (int i = 1; i < dp.size(); i++) {
int x = i;
while (x != 0) {
dp[i] = max(dp[i], dp[i - (1 << __builtin_ctzll(x))]);
x = x & (x - 1);
}
}
}
};
int main() {
//freopen("balancing.in", "r", stdin);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
int64_t grid[n][n];
int64_t sm = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> grid[i][j];
sm += grid[i][j];
}
}
vector<Domino> dominoes;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int dx = -1; dx <= 1; dx++) {
for (int dy = -1; dy <= 1; dy++) {
if (i + dx < 0 || j + dy < 0) continue;
if (i + dx == n || j + dy == n) continue;
if (abs(dx) + abs(dy) != 1) continue;
if (dx < dy) continue;
dominoes.push_back({{i, j}, {i + dx,j + dy}, grid[i][j] + grid[i + dx][j + dy]});
}
}
}
}
nth_element(dominoes.begin(), dominoes.begin() + min(7 * (m - 1) + 5, 48), dominoes.end());
dominoes.resize(min(7 * (m - 1) + 5, 48));
vector<pair<int64_t,pair<Domino, Domino>>> edges;
for (auto& d1: dominoes) {
for (auto& d2: dominoes) {
set<pair<int,int>> s; s.insert(d1.from), s.insert(d1.to), s.insert(d2.from), s.insert(d2.to);
if (s.size() != 4) continue;
edges.push_back({d1.cost + d2.cost, {d1, d2}});
}
}
set<Domino> mySet;
for (auto& p: edges) {
mySet.insert(p.second.first), mySet.insert(p.second.second);
}
map<Domino,int> myMap; int cntr = 0;
vector<int64_t> weights;
for (Domino d: mySet) {
weights.push_back(d.cost);
myMap[d] = cntr++;
}
Graph gr(cntr), gr1(cntr/2), gr2(cntr - cntr/2);
gr.weight = weights;
for (int i = 0; i < cntr/2; i++) gr1.weight.push_back(weights[i]);
for (int i = cntr/2; i < cntr; i++) gr2.weight.push_back(weights[i]);
for (auto& e: edges) {
gr.add_edge(myMap[e.second.first], myMap[e.second.second]);
if (myMap[e.second.first] < cntr/2 && myMap[e.second.second] < cntr/2) gr1.add_edge(myMap[e.second.second], myMap[e.second.first]);
if (myMap[e.second.first] >= cntr/2 && myMap[e.second.second] >= cntr/2) gr2.add_edge(myMap[e.second.second] - cntr/2, myMap[e.second.first] - cntr/2);
}
gr1.solve(m, true);
int64_t myMax = 0;
vector<int> cnt[m + 1];
for (int i = 1; i < gr1.dp.size(); i++) {
if (gr1.dp[i] != 0) cnt[__builtin_popcount(i)].push_back(i);
}
for (int pc = 1; pc <= m; pc++) {
gr2.solve(m - pc, false);
for (int i: cnt[pc]) {
vector<int> nodes;
for (int j = 0; j < gr1.adj.size(); j++) {
if (i & (1 << j)) {
nodes.push_back(j);
}
}
int tot = 0;
for (int j = 0; j < gr2.adj.size(); j++) {
bool fine = true;
for (int k: nodes) {
if (!gr.adj[j + cntr/2][k]) {
fine = false;
break;
}
}
if (fine) {
tot += (1 << j);
}
}
myMax = max(gr2.dp[tot] + gr1.dp[i], myMax);
}
}
gr1.solve(m, false);
myMax = max(myMax, gr1.dp.back());
cout << sm - myMax;
}
Compilation message
domino.cpp:24: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
24 | #pragma GCC optimization ("O3")
|
domino.cpp:25: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
25 | #pragma GCC optimization ("unroll-loops")
|
domino.cpp: In member function 'void Graph::solve(int, bool)':
domino.cpp:56:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
56 | for (int i = 0; i < dp.size(); i++) {
| ~~^~~~~~~~~~~
domino.cpp:61:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
61 | for (int j = 0; j < adj.size(); j++) {
| ~~^~~~~~~~~~~~
domino.cpp:83:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
83 | for (int i = 1; i < dp.size(); i++) {
| ~~^~~~~~~~~~~
domino.cpp: In function 'int main()':
domino.cpp:154:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
154 | for (int i = 1; i < gr1.dp.size(); i++) {
| ~~^~~~~~~~~~~~~~~
domino.cpp:161:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
161 | for (int j = 0; j < gr1.adj.size(); j++) {
| ~~^~~~~~~~~~~~~~~~
domino.cpp:167:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
167 | for (int j = 0; j < gr2.adj.size(); j++) {
| ~~^~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
38 ms |
14664 KB |
Output is correct |
| 2 |
Correct |
31 ms |
14664 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
596 KB |
Output is correct |
| 2 |
Correct |
1 ms |
596 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
530 ms |
228720 KB |
Output is correct |
| 2 |
Correct |
495 ms |
228776 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
346 ms |
215000 KB |
Output is correct |
| 2 |
Correct |
309 ms |
214988 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
159 ms |
57492 KB |
Output is correct |
| 2 |
Correct |
136 ms |
57468 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
543 ms |
228664 KB |
Output is correct |
| 2 |
Correct |
493 ms |
228728 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
201 ms |
17300 KB |
Output is correct |
| 2 |
Correct |
201 ms |
17164 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
743 ms |
236376 KB |
Output is correct |
| 2 |
Correct |
695 ms |
236052 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3837 ms |
200240 KB |
Output is correct |
| 2 |
Execution timed out |
4019 ms |
198196 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
340 KB |
Output is correct |
| 2 |
Correct |
3 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4078 ms |
419004 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4077 ms |
266584 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4096 ms |
328316 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
368 ms |
16928 KB |
Output is correct |
| 2 |
Correct |
359 ms |
16912 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4062 ms |
492744 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
