結果
| 問題 | No.3034 コーエン-マコーレー抽象単体複体 |
| ユーザー |
 hitonanode
|
| 提出日時 | 2025-02-21 23:09:55 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 32 ms / 2,000 ms |
| コード長 | 10,281 bytes |
| コンパイル時間 | 3,283 ms |
| コンパイル使用メモリ | 250,072 KB |
| 実行使用メモリ | 11,904 KB |
| 最終ジャッジ日時 | 2025-02-21 23:10:01 |
| 合計ジャッジ時間 | 5,131 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 36 |
ソースコード
#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <chrono>#include <cmath>#include <complex>#include <deque>#include <forward_list>#include <fstream>#include <functional>#include <iomanip>#include <ios>#include <iostream>#include <limits>#include <list>#include <map>#include <memory>#include <numeric>#include <optional>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <string>#include <tuple>#include <type_traits>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using lint = long long;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os <<']'; return os; }template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v<< ','; os << ']'; return os; }template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);},tpl); return is; }template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) {((os << args << ','), ...);}, tpl); return os << ')'; }template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os<< v << ','; os << '}'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os <<']'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os <<'}'; return os; }template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v <<','; os << '}'; return os; }template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for(auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }#ifdef HITONANODE_LOCALconst string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET<< std::endl#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " <<__FILE__ << COLOR_RESET << std::endl : std::cerr)#else#define dbg(x) ((void)0)#define dbgif(cond, x) ((void)0)#endif// UnionFind Tree (0-indexed), based on size of each disjoint setstruct UnionFind {std::vector<int> par, cou;UnionFind(int N = 0) : par(N), cou(N, 1) { iota(par.begin(), par.end(), 0); }int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }bool unite(int x, int y) {x = find(x), y = find(y);if (x == y) return false;if (cou[x] < cou[y]) std::swap(x, y);par[y] = x, cou[x] += cou[y];return true;}int count(int x) { return cou[find(x)]; }bool same(int x, int y) { return find(x) == find(y); }std::vector<std::vector<int>> groups() {std::vector<std::vector<int>> ret(par.size());for (int i = 0; i < int(par.size()); ++i) ret[find(i)].push_back(i);ret.erase(std::remove_if(ret.begin(), ret.end(),[&](const std::vector<int> &v) { return v.empty(); }),ret.end());return ret;}};int main() {using BS = bitset<3010>;int N, M;cin >> N >> M;vector<pint> avail_edges;vector<tuple<int, int, int>> query(M);for (auto &[a, b, c] : query) {cin >> a >> b >> c;--a, --b, --c;assert(a < b and b < c);avail_edges.emplace_back(a, b);avail_edges.emplace_back(b, c);avail_edges.emplace_back(a, c);}avail_edges = sort_unique(avail_edges);dbg(avail_edges);int num_conn = 0;UnionFind CO_uf(N);UnionFind H1_uf(N);int num_freedom_H1 = 0;vector<UnionFind> LK_ufs(N, UnionFind(N));vector<int> LK_num_conn(N);auto solve = [&]() -> string {if (num_conn > 1) return "CO";if (num_freedom_H1) {dbg(num_freedom_H1);return "H1";}for (auto x : LK_num_conn) {if (x > 1) {dbg(LK_num_conn);return "LK";}}return "CM";};auto add_h1 = [&](int a, int b, int c) {auto &uf = LK_ufs.at(a);if (uf.count(b) == 1) ++LK_num_conn.at(a);if (uf.count(c) == 1) ++LK_num_conn.at(a);LK_num_conn.at(a) -= uf.unite(b, c);};set<pint> seen_edges;vector<BS> basis;auto add_triangle = [&](int a, int b, int c) {if (CO_uf.count(a) == 1) ++num_conn;if (CO_uf.count(b) == 1) ++num_conn;if (CO_uf.count(c) == 1) ++num_conn;BS vec;vec.set(arglb(avail_edges, {a, b}));vec.set(arglb(avail_edges, {b, c}));vec.set(arglb(avail_edges, {a, c}));for (auto b : basis) {const int idx = b._Find_first();if (vec[idx]) vec ^= b;}if (vec.any()) basis.push_back(vec);vector<pint> edges;if (!seen_edges.count({a, b})) edges.emplace_back(a, b);if (!seen_edges.count({b, c})) edges.emplace_back(b, c);if (!seen_edges.count({a, c})) edges.emplace_back(a, c);for (auto e : edges) {seen_edges.insert(e);if (!H1_uf.unite(e.first, e.second)) --num_freedom_H1;}num_freedom_H1 += vec.any();if (CO_uf.unite(a, b)) {--num_conn;}if (CO_uf.unite(b, c)) {--num_conn;}add_h1(a, b, c);add_h1(b, c, a);add_h1(c, a, b);};// set<tuple<int, int, int>> seen;REP(i, query.size()) {auto [a, b, c] = query.at(i);dbg(make_tuple(a, b, c));// if (seen.count(make_tuple(a, b, c))) {// } else {// }add_triangle(a, b, c);cout << solve() << '\n';}}