結果
問題 | No.1116 Cycles of Dense Graph |
ユーザー |
|
提出日時 | 2020-07-17 22:19:19 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 187 ms / 2,000 ms |
コード長 | 17,277 bytes |
コンパイル時間 | 3,443 ms |
コンパイル使用メモリ | 249,816 KB |
最終ジャッジ日時 | 2025-01-11 22:52:52 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 38 |
コンパイルメッセージ
main.cpp:467:1: warning: ISO C++ forbids declaration of ‘main’ with no type [-Wreturn-type] 467 | main() { | ^~~~ main.cpp: In function ‘void scan(char*)’: main.cpp:65:28: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 65 | void scan(char a[]) { scanf("%s", a); } | ~~~~~^~~~~~~~~
ソースコード
#pragma region Macros#pragma GCC optimize("O3")#include <bits/stdc++.h>#define ll long long#define ld long double#define rep2(i, a, b) for(ll i = a; i <= b; ++i)#define rep(i, n) for(ll i = 0; i < n; ++i)#define rep3(i, a, b) for(ll i = a; i >= b; --i)#define pii pair<int, int>#define pll pair<ll, ll>#define pb push_back#define eb emplace_back#define vi vector<int>#define vll vector<ll>#define vpi vector<pii>#define vpll vector<pll>#define overload2(_1, _2, name, ...) name#define vec(type, name, ...) vector<type> name(__VA_ARGS__)#define VEC(type, name, size)\vector<type> name(size);\IN(name)#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define VV(type, name, h, w)\vector<vector<type>> name(h, vector<type>(w));\IN(name)#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define fi first#define se second#define all(c) begin(c), end(c)#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))using namespace std;template <class T> using pq = priority_queue<T>;template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;#define Size(c) (int)(c).size()#define INT(...)\int __VA_ARGS__;\IN(__VA_ARGS__)#define LL(...)\ll __VA_ARGS__;\IN(__VA_ARGS__)#define ULL(...)\ull __VA_ARGS__;\IN(__VA_ARGS__)#define STR(...)\string __VA_ARGS__;\IN(__VA_ARGS__)#define CHR(...)\char __VA_ARGS__;\IN(__VA_ARGS__)#define DBL(...)\double __VA_ARGS__;\IN(__VA_ARGS__)#define LD(...)\ld __VA_ARGS__;\IN(__VA_ARGS__)int scan() { return getchar(); }template <class T> void scan(T a) { cin >> a; }void scan(int &a) { cin >> a; }void scan(long long &a) { cin >> a; }void scan(char &a) { cin >> a; }void scan(double &a) { cin >> a; }void scan(long double &a) { cin >> a; }void scan(char a[]) { scanf("%s", a); }void scan(string &a) { cin >> a; }template <class T> void scan(vector<T> &);template <class T, size_t size> void scan(array<T, size> &);template <class T, class L> void scan(pair<T, L> &);template <class T, size_t size> void scan(T (&)[size]);template <class T> void scan(vector<T> &a) {for(auto &i : a) scan(i);}template <class T> void scan(deque<T> &a) {for(auto &i : a) scan(i);}template <class T, size_t size> void scan(array<T, size> &a) {for(auto &i : a) scan(i);}template <class T, class L> void scan(pair<T, L> &p) {scan(p.first);scan(p.second);}template <class T, size_t size> void scan(T (&a)[size]) {for(auto &i : a) scan(i);}template <class T> void scan(T &a) { cin >> a; }void IN() {}template <class Head, class... Tail> void IN(Head &head, Tail &... tail) {scan(head);IN(tail...);}string stin() {string s;cin >> s;return s;}template <class T, class S> inline bool chmax(T &a, S b) {if(a < b) {a = b;return 1;}return 0;}template <class T, class S> inline bool chmin(T &a, S b) {if(a > b) {a = b;return 1;}return 0;}vi iota(int n) {vi a(n);iota(all(a), 0);return a;}template <class T> void UNIQUE(vector<T> &x) {sort(all(x));x.erase(unique(all(x)), x.end());}int in() {int x;cin >> x;return x;}ll lin() {unsigned long long x;cin >> x;return x;}void print() { putchar(' '); }void print(bool a) { cout << a; }void print(int a) { cout << a; }void print(long long a) { cout << a; }void print(char a) { cout << a; }void print(string &a) { cout << a; }void print(double a) { cout << a; }template <class T> void print(const vector<T> &);template <class T, size_t size> void print(const array<T, size> &);template <class T, class L> void print(const pair<T, L> &p);template <class T, size_t size> void print(const T (&)[size]);template <class T> void print(const vector<T> &a) {if(a.empty()) return;print(a[0]);for(auto i = a.begin(); ++i != a.end();) {cout << " ";print(*i);}cout << endl;}template <class T> void print(const deque<T> &a) {if(a.empty()) return;print(a[0]);for(auto i = a.begin(); ++i != a.end();) {cout << " ";print(*i);}}template <class T, size_t size> void print(const array<T, size> &a) {print(a[0]);for(auto i = a.begin(); ++i != a.end();) {cout << " ";print(*i);}}template <class T, class L> void print(const pair<T, L> &p) {cout << '(';print(p.first);cout << ",";print(p.second);cout << ')';}template <class T> void print(set<T> &x) {for(auto e : x) print(e), cout << " ";cout << endl;}template <class T> void print(multiset<T> &x) {for(auto e : x) print(e), cout << " ";cout << endl;}template <class T, size_t size> void print(const T (&a)[size]) {print(a[0]);for(auto i = a; ++i != end(a);) {cout << " ";print(*i);}}template <class T> void print(const T &a) { cout << a; }int out() {putchar('\n');return 0;}template <class T> int out(const T &t) {print(t);putchar('\n');return 0;}template <class Head, class... Tail> int out(const Head &head, const Tail &... tail) {print(head);putchar(' ');out(tail...);return 0;}ll gcd(ll a, ll b) {while(b) {ll c = b;b = a % b;a = c;}return a;}ll lcm(ll a, ll b) {if(!a || !b) return 0;return a * b / gcd(a, b);}vector<pll> factor(ll x) {vector<pll> ans;for(ll i = 2; i * i <= x; i++)if(x % i == 0) {ans.push_back({i, 1});while((x /= i) % i == 0) ans.back().second++;}if(x != 1) ans.push_back({x, 1});return ans;}vector<int> divisor(int x) {vector<int> ans;for(int i = 1; i * i <= x; i++)if(x % i == 0) {ans.pb(i);if(i * i != x) ans.pb(x / i);}return ans;}template <typename T> void zip(vector<T> &x) {vector<T> y = x;sort(all(y));for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }}int popcount(ll x) { return __builtin_popcountll(x); }mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }template <typename T> void shuffle(vector<T> &v) {rep3(i, v.size() - 1, 1) { swap(v[i], v[rnd(i)]); }}#define endl '\n'vector<string> YES{"NO", "YES"};vector<string> Yes{"No", "Yes"};vector<string> yes{"no", "yes"};#ifdef _LOCAL#undef endl#define debug(x)\cout << #x << ": ";\print(x);\cout << endl;void err() {}template <class T> void err(const T &t) {print(t);cout << " ";}template <class Head, class... Tail> void err(const Head &head, const Tail &... tail) {print(head);putchar(' ');out(tail...);}#else#define debug(x)template <class... T> void err(const T &...) {}#endiftemplate <typename T> struct edge {int from, to;T cost;int id;edge(int to, T cost) : from(-1), to(to), cost(cost) {}edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}// edge(int from,int to,T cost,int id):from(from),to(to),cost(cost),id(id){}edge &operator=(const int &x) {to = x;return *this;}operator int() const { return to; }};template <typename T> using Edges = vector<edge<T>>;struct Graph : vector<vector<int>> {using vector<vector<int>>::vector;inline void add(int a, int b, bool directed = false) {(*this)[a].emplace_back(b);if(!directed) (*this)[b].emplace_back(a);}void read(int n = -1, int offset = 1) {if(n == -1) n = this->size() - 1;int a, b;while(n--) {cin >> a >> b;Graph::add(a - offset, b - offset);}}};template <typename T> struct WeightedGraph : vector<Edges<T>> {using vector<Edges<T>>::vector;inline void add(int a, int b, T c, bool directed = false) {(*this)[a].emplace_back(b, c);if(!directed) (*this)[b].emplace_back(a, c);}void read(int n = -1, int offset = 1) {if(n == -1) n = this->size() - 1;int a, b;while(n--) {cin >> a >> b;Graph::add(a - offset, b - offset);}}};struct Setup_io {Setup_io() {ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);cout << fixed << setprecision(15);}} setup_io;#pragma endregion// _________コーディングはここから!!___________namespace modular {constexpr ll MOD = 998244353;const int MAXN = 1100000;template <ll Modulus> class modint {using u64 = ll;public:u64 a;constexpr modint(const u64 x = 0) noexcept : a(((x % Modulus) + Modulus) % Modulus) {}constexpr u64 &value() noexcept { return a; }constexpr const u64 &value() const noexcept { return a; }constexpr modint operator+(const modint rhs) const noexcept { return modint(*this) += rhs; }constexpr modint operator-(const modint rhs) const noexcept { return modint(*this) -= rhs; }constexpr modint operator*(const modint rhs) const noexcept { return modint(*this) *= rhs; }template <typename T> constexpr modint operator^(T rhs) const noexcept { return modint(*this) ^= rhs; }constexpr modint &operator+=(const modint rhs) noexcept {a += rhs.a;if(a >= Modulus) { a -= Modulus; }return *this;}constexpr modint &operator-=(const modint rhs) noexcept {if(a < rhs.a) { a += Modulus; }a -= rhs.a;return *this;}constexpr modint &operator*=(const modint rhs) noexcept {a = a * rhs.a % Modulus;return *this;}constexpr bool operator==(const modint rhs) const noexcept { return a == rhs.a; }template <typename T> constexpr modint &operator^=(T n) noexcept {modint<Modulus> res = 1;modint<Modulus> x = a;while(n) {if(n & 1) res *= x;x *= x;n >>= 1;}a = res.a;return *this;}};#define mint modint<MOD>#define vmint vector<mint>vmint Inv{0, 1}, Prd{1, 1}, Invprd{1, 1};mint inv(int n) {if(Inv.size() > n)return Inv[n];else {for(int i = Inv.size(); i <= n; ++i) Inv.emplace_back(Inv[MOD % i] * (-MOD / i));return Inv[n];}}mint prd(int n) {if(Prd.size() > n)return Prd[n];elsefor(int i = Prd.size(); i <= n; ++i) Prd.emplace_back(Prd[i - 1] * i);return Prd[n];}mint invprd(int n) {if(Invprd.size() > n)return Invprd[n];elsefor(int i = Invprd.size(); i <= n; ++i) Invprd.emplace_back(Invprd[i - 1] * inv(i));return Invprd[n];}mint modpow(ll a, ll n) {mint x = a;return x ^= n;}template <ll T> modint<T> operator/(modint<T> l, modint<T> r) {if(r.a < MAXN) return l * inv(r.a);return l * (r ^ (MOD - 2));}template <typename T, ll S> modint<S> operator/(T l, modint<S> r) { return modint<S>(l) / r; }template <ll T> modint<T> operator/=(modint<T> &l, modint<T> r) { return l = l / r; }mint C(int a, int b) {if(a < 0 || b < 0) return 0;if(a < b) return 0;return prd(a) * invprd(b) * invprd(a - b);}mint P(int a, int b) {if(a < 0 || b < 0) return 0;if(a < b) return 0;return prd(a) * invprd(a - b);}ostream &operator<<(ostream &os, mint a) {os << a.a;return os;}template <typename T> ostream &operator<<(ostream &os, vector<T> &a) {for(auto &e : a) os << e << " ";os << endl;return os;}istream &operator>>(istream &is, mint &a) {ll x;is >> x;a = x;return is;}} // namespace modularusing namespace modular;template <typename T = int> struct UnionFind {vector<int> data;vector<T> sz;bool is_default;UnionFind(int n) {data.assign(n, -1);sz.assign(n, 1);is_default = true;}UnionFind(int n, vector<T> &a) {data.assign(n, -1);sz = a;is_default = false;}bool unite(int x, int y) {x = find(x), y = find(y);if(x == y) return false;if(data[x] > data[y]) swap(x, y);data[x] += data[y];if(!is_default) sz[x] += sz[y];data[y] = x;return true;}bool same(int x, int y) { return find(x) == find(y); }int find(int x) {if(data[x] < 0) return x;return (data[x] = find(data[x]));}T size(int x) { return (is_default ? -data[find(x)] : sz[find(x)]); }};main() {INT(n, m);vector<pii> v;rep(i, m) {INT(a, b);v.eb(a - 1, b - 1);}mint ans;rep2(i, 3, n) { ans += P(n, i) / (mint)i; }map<pii, mint> mem;rep(mask, 1 << m) {int t = popcount(mask) & 1;int a = 0, b = 0;int e = popcount(mask);mint s = (e & 1 ? -1 : 1);bool flag = true;// a : 連結成分の数// b : 頂点数// e : 辺数UnionFind uf(n);map<int, int> mp;int cnt = 0;rep(i, m) {if(mask & 1 << i) {auto [x, y] = v[i];if(!mp.count(x)) mp[x] = cnt++;if(!mp.count(y)) mp[y] = cnt++;uf.unite(mp[x], mp[y]);}}b = cnt;rep(i, cnt) if(uf.find(i) == i) a++;vi g(cnt);rep(i, m) if(mask & 1 << i) g[mp[v[i].fi]]++, g[mp[v[i].se]]++;rep(i, cnt) if(g[i] > 2) flag = false;if(!flag) continue;if(b - e == a) {if(mem.count(pii(a, b)))ans += s * mem[{a, b}] * modpow(2, a) * P(a, a) / (mint)a;else {mint res;rep(j, n - b + 1) {if(j + b > 2) res += P(n - b, j) * C(j + a - 1, a - 1);}mem[pii(a, b)] = res;ans += s * res * modpow(2, a) * P(a, a) / (mint)a;}} else if(a == 1) {ans += s * 2;}}cout << ans / (mint)2 << endl;}