test/cpv/library-checker-graph/maximum_independent_set.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/maximum_independent_set/ | ||
| 2 | #include "../../../src/graph/clique/enum/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | CEXP u32 N = 128; | ||
| 6 | using B = std::bitset<N>; | ||
| 7 | |||
| 8 | 16 | int main() { | |
| 9 |
1/2✓ Branch 2 taken 16 times.
✗ Branch 3 not taken.
|
16 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 10 | u32 n, m; | ||
| 11 |
2/4✓ Branch 1 taken 16 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 16 times.
✗ Branch 5 not taken.
|
16 | std::cin >> n >> m; |
| 12 | 16 | arr<B, N> adj; | |
| 13 |
2/2✓ Branch 0 taken 2511 times.
✓ Branch 1 taken 16 times.
|
2527 | for (u32 i = 0, u, v; i < m; ++i) { |
| 14 |
2/4✓ Branch 1 taken 2511 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 2511 times.
✗ Branch 5 not taken.
|
2511 | std::cin >> u >> v; |
| 15 | 2511 | adj[u][v] = adj[v][u] = 1; | |
| 16 | } | ||
| 17 |
2/2✓ Branch 0 taken 429 times.
✓ Branch 1 taken 16 times.
|
445 | for (u32 i = 0; i < n; ++i) { |
| 18 |
2/2✓ Branch 0 taken 15115 times.
✓ Branch 1 taken 429 times.
|
15544 | for (u32 j = 0; j < n; ++j) |
| 19 |
3/4✓ Branch 0 taken 14686 times.
✓ Branch 1 taken 429 times.
✓ Branch 4 taken 14686 times.
✗ Branch 5 not taken.
|
15115 | if (i != j) adj[i].flip(j); |
| 20 | } | ||
| 21 | 16 | B ans{}; | |
| 22 | 16 | cliques(n, adj, [&](B R) { | |
| 23 |
2/2✓ Branch 2 taken 32 times.
✓ Branch 3 taken 2218278 times.
|
2218310 | if (ans.count() < R.count()) ans = R; |
| 24 | 2218310 | }); | |
| 25 | 16 | auto ans_cnt = ans.count(); | |
| 26 |
2/4✓ Branch 1 taken 16 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 16 times.
✗ Branch 5 not taken.
|
16 | std::cout << ans_cnt << '\n'; |
| 27 |
2/2✓ Branch 0 taken 429 times.
✓ Branch 1 taken 16 times.
|
445 | for (u32 i = 0, cnt = 0; i < n; ++i) |
| 28 |
4/6✓ Branch 3 taken 155 times.
✓ Branch 4 taken 274 times.
✓ Branch 6 taken 155 times.
✗ Branch 7 not taken.
✓ Branch 9 taken 155 times.
✗ Branch 10 not taken.
|
429 | if (ans[i]) std::cout << i << " \n"[++cnt == (u32)ans_cnt]; |
| 29 | 16 | return 0; | |
| 30 | } | ||
| 31 |