結果
問題 | No.1116 Cycles of Dense Graph |
ユーザー | jell |
提出日時 | 2020-07-18 20:58:34 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 15,847 bytes |
コンパイル時間 | 3,180 ms |
コンパイル使用メモリ | 227,452 KB |
実行使用メモリ | 7,708 KB |
最終ジャッジ日時 | 2023-08-21 00:02:19 |
合計ジャッジ時間 | 9,203 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,384 KB |
testcase_01 | AC | 292 ms
4,380 KB |
testcase_02 | AC | 25 ms
4,380 KB |
testcase_03 | AC | 5 ms
4,376 KB |
testcase_04 | AC | 10 ms
4,376 KB |
testcase_05 | AC | 1,939 ms
4,380 KB |
testcase_06 | TLE | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
ソースコード
#pragma region preprocessor #ifdef LOCAL //* #define _GLIBCXX_DEBUG // gcc /*/ #define _LIBCPP_DEBUG 0 // clang //*/ // #define __buffer_check__ #else #pragma GCC optimize("Ofast") // #define NDEBUG #endif #define __precision__ 15 #define __iostream_untie__ true #include <bits/stdc++.h> #include <ext/rope> #ifdef LOCAL #include "dump.hpp" #define mesg(str) std::cerr << "[ " << __LINE__ << " : " << __FUNCTION__ << " ] " << str << "\n" #else #define dump(...) ((void)0) #define mesg(str) ((void)0) #endif #pragma endregion #pragma region std-overload namespace std { // hash template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); } template <class T, class U> struct hash<pair<T, U>> { size_t operator()(pair<T, U> const &pr) const { return hash_combine(hash_combine(0, pr.first), pr.second); } }; template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1> struct tuple_hash_calc { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t), get<index>(t)); } }; template <class tuple_t> struct tuple_hash_calc<tuple_t, 0> { static size_t apply(size_t seed, tuple_t const &t) { return hash_combine(seed, get<0>(t)); } }; template <class... T> struct hash<tuple<T...>> { size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); } }; // iostream template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.first >> p.second; } template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.first << ' ' << p.second; } template <class tuple_t, size_t index> struct tupleis { static istream &apply(istream &is, tuple_t &t) { tupleis<tuple_t, index - 1>::apply(is, t); return is >> get<index>(t); } }; template <class tuple_t> struct tupleis<tuple_t, SIZE_MAX> { static istream &apply(istream &is, tuple_t &t) { return is; } }; template <class... T> istream &operator>>(istream &is, tuple<T...> &t) { return tupleis<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is, t); } template <> istream &operator>>(istream &is, tuple<> &t) { return is; } template <class tuple_t, size_t index> struct tupleos { static ostream &apply(ostream &os, const tuple_t &t) { tupleos<tuple_t, index - 1>::apply(os, t); return os << ' ' << get<index>(t); } }; template <class tuple_t> struct tupleos<tuple_t, 0> { static ostream &apply(ostream &os, const tuple_t &t) { return os << get<0>(t); } }; template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os, t); } template <> ostream &operator<<(ostream &os, const tuple<> &t) { return os; } template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr> istream& operator>>(istream& is, Container &cont) { for(auto&& e : cont) is >> e; return is; } template <class Container, typename Value = typename Container::value_type, enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> = nullptr> ostream& operator<<(ostream& os, const Container &cont) { bool flag = 1; for(auto&& e : cont) flag ? flag = 0 : (os << ' ', 0), os << e; return os; } } // namespace std #pragma endregion #pragma region config namespace config { const auto start_time{std::chrono::system_clock::now()}; int64_t elapsed() { using namespace std::chrono; const auto end_time{std::chrono::system_clock::now()}; return duration_cast<milliseconds>(end_time - start_time).count(); } __attribute__((constructor)) void setup() { using namespace std; if(__iostream_untie__) ios::sync_with_stdio(false), cin.tie(nullptr); cout << fixed << setprecision(__precision__); #ifdef DEBUG freopen("debug.out","w",stdout); freopen("debug.err","w",stderr); if(!freopen("debug.in","r",stdin)) { cerr << "error: \"./debug.in\" not found.\n"; exit(EXIT_FAILURE); } #endif #ifdef stderr_path freopen(stderr_path, "a", stderr); #endif #ifdef LOCAL cerr << fixed << setprecision(__precision__) << boolalpha << "\n----- stderr at LOCAL -----\n\n"; atexit([]{ cerr << "\n----- Exec time : " << elapsed() << " ms -----\n\n"; }); #endif #ifdef __buffer_check__ atexit([]{ ofstream cnsl("CON"); char bufc; if(cin >> bufc) cnsl << "\n\033[1;35mwarning\033[0m: buffer not empty.\n\n"; }); #endif } } // namespace config #pragma endregion #pragma region utility // lambda wrapper for recursive method. template <class lambda_type> class fixed_point { lambda_type func; public: fixed_point(lambda_type &&f) : func(std::move(f)) {} template <class... Args> auto operator()(Args &&... args) const { return func(*this, std::forward<Args>(args)...); } }; // read with std::cin. template <class T = void> struct read { typename std::remove_const<T>::type value; template <class... types> read(types... args) : value(args...) { std::cin >> value; } operator T() const { return value; } }; template <> struct read<void> { template <class T> operator T() const { T value; std::cin >> value; return value; } }; // substitute y for x if x > y. template <class T> inline bool chmin(T &x, const T &y) { return x > y ? x = y, true : false; } // substitute y for x if x < y. template <class T> inline bool chmax(T &x, const T &y) { return x < y ? x = y, true : false; } // binary search on discrete range. template <class iter_type, class pred_type> iter_type binary(iter_type __ok, iter_type __ng, pred_type pred) { assert(__ok != __ng); std::ptrdiff_t dist(__ng - __ok); while(std::abs(dist) > 1) { iter_type mid(__ok + dist / 2); if(pred(mid)) __ok = mid, dist -= dist / 2; else __ng = mid, dist /= 2; } return __ok; } // binary search on real numbers. template <class pred_type> long double binary(long double __ok, long double __ng, const long double eps, pred_type pred) { assert(__ok != __ng); while(std::abs(__ok - __ng) > eps) { long double mid{(__ok + __ng) / 2}; (pred(mid) ? __ok : __ng) = mid; } return __ok; } // trinary search on discrete range. template <class iter_type, class comp_type> iter_type trinary(iter_type __first, iter_type __last, comp_type comp) { assert(__first < __last); std::ptrdiff_t dist(__last - __first); while(dist > 2) { iter_type __left(__first + dist / 3), __right(__first + dist * 2 / 3); if(comp(__left, __right)) __last = __right, dist = dist * 2 / 3; else __first = __left, dist -= dist / 3; } if(dist > 1 && comp(next(__first), __first)) ++__first; return __first; } // trinary search on real numbers. template <class comp_type> long double trinary(long double __first, long double __last, const long double eps, comp_type comp) { assert(__first < __last); while(__last - __first > eps) { long double __left{(__first * 2 + __last) / 3}, __right{(__first + __last * 2) / 3}; if(comp(__left, __right)) __last = __right; else __first = __left; } return __first; } // size of array. template <class A, size_t N> size_t size(A (&array)[N]) { return N; } // be careful that val is type-sensitive. template <class T, class A, size_t N> void init(A (&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); } #pragma endregion #pragma region alias using namespace std; using i32 = int_least32_t; using i64 = int_least64_t; using u32 = uint_least32_t; using u64 = uint_least64_t; using p32 = pair<i32, i32>; using p64 = pair<i64, i64>; template <class T, class Comp = less<T>> using heap = priority_queue<T, vector<T>, Comp>; template <class T> using hashset = unordered_set<T>; template <class Key, class Value> using hashmap = unordered_map<Key, Value>; using namespace __gnu_cxx; #pragma endregion #pragma region library #ifndef modint_hpp #define modint_hpp #include <cassert> #include <iostream> template <int mod> class modint { int val; public: static constexpr modint identity() noexcept { return 1; } constexpr modint() noexcept : val(0) {} template <class int_type, std::enable_if_t<std::is_integral<int_type>::value, std::nullptr_t> = nullptr> constexpr modint(int_type _val) noexcept : val((_val %= mod) < 0 ? mod + _val : _val) {} constexpr long long value() const noexcept { return val; } constexpr modint operator++(int) noexcept { modint t = *this; return ++val, t; } constexpr modint operator--(int) noexcept { modint t = *this; return --val, t; } constexpr modint &operator++() noexcept { return ++val, *this; } constexpr modint &operator--() noexcept { return --val, *this; } constexpr modint operator-() const noexcept { return modint(-val); } constexpr modint &operator+=(const modint &rhs) noexcept { return (val += rhs.val) < mod ? 0 : val -= mod, *this; } constexpr modint &operator-=(const modint &rhs) noexcept { return (val += mod - rhs.val) < mod ? 0 : val -= mod, *this; } constexpr modint &operator*=(const modint &rhs) noexcept { return val = (long long)val * rhs.val % mod, *this; } constexpr modint &operator/=(const modint &rhs) noexcept { return *this *= inverse(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; } 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 bool operator==(const modint &rhs) const noexcept { return val == rhs.val; } constexpr bool operator!=(const modint &rhs) const noexcept { return val != rhs.val; } constexpr bool operator!() const noexcept { return !val; } friend constexpr modint operator+(long long lhs, modint rhs) noexcept { return modint(lhs) + rhs; } friend constexpr modint operator-(long long lhs, modint rhs) noexcept { return modint(lhs) - rhs; } friend constexpr modint operator*(long long lhs, modint rhs) noexcept { return modint(lhs) * rhs; } friend constexpr modint operator/(long long lhs, modint rhs) noexcept { return modint(lhs) / rhs; } static constexpr modint inverse(const modint &rhs) noexcept { assert(rhs != 0); int a{mod}, b{rhs.val}, u{}, v{1}, t{}; while(b) t = a / b, a ^= b ^= (a -= t * b) ^= b, u ^= v ^= (u -= t * v) ^= v; return {u}; } static constexpr modint pow(modint rhs, long long e) noexcept { if(e < 0) e = e % (mod - 1) + mod - 1; modint res{1}; while(e) { if(e & 1) res *= rhs; rhs *= rhs, e >>= 1; } return res; } friend std::ostream &operator<<(std::ostream &os, const modint &rhs) noexcept { return os << rhs.val; } friend std::istream &operator>>(std::istream &is, modint &rhs) noexcept { long long val; rhs = {(is >> val, val)}; return is; } }; // class modint template <> class modint<2> { bool val; public: static constexpr modint identity() noexcept { return 1; } constexpr modint() noexcept : val(false) {} template <class int_type, std::enable_if_t<std::is_integral<int_type>::value, std::nullptr_t> = nullptr> constexpr modint(int_type _val) noexcept : val(_val & 1) {} constexpr operator bool() const noexcept { return val; } constexpr bool value() const noexcept { return val; } constexpr modint &operator+=(const modint &rhs) noexcept { return val ^= rhs.val, *this; } constexpr modint &operator-=(const modint &rhs) noexcept { return val ^= rhs.val, *this; } constexpr modint &operator*=(const modint &rhs) noexcept { return val &= rhs.val, *this; } constexpr modint &operator/=(const modint &rhs) noexcept { assert(rhs.val); return *this; } constexpr modint operator!() const noexcept { return !val; } constexpr modint operator-() const noexcept { return *this; } constexpr modint operator+(const modint &rhs) const noexcept { return val != rhs.val; } constexpr modint operator-(const modint &rhs) const noexcept { return val != rhs.val; } constexpr modint operator*(const modint &rhs) const noexcept { return val && rhs.val; } constexpr modint operator/(const modint &rhs) const noexcept { assert(rhs.val); return *this; } constexpr bool operator==(const modint &rhs) const noexcept { return val == rhs.val; } constexpr bool operator!=(const modint &rhs) const noexcept { return val != rhs.val; } friend constexpr modint operator+(long long lhs, modint rhs) noexcept { return lhs & 1 ? !rhs : rhs; } friend constexpr modint operator-(long long lhs, modint rhs) noexcept { return lhs & 1 ? !rhs : rhs; } friend constexpr modint operator*(long long lhs, modint rhs) noexcept { return lhs & 1 ? rhs : modint<2>{0}; } friend constexpr modint operator/(long long lhs, modint rhs) noexcept { assert(rhs.val); return lhs & 1 ? rhs : modint<2>{0}; } friend std::ostream &operator<<(std::ostream &os, const modint &rhs) noexcept { return os << rhs.val; } friend std::istream &operator>>(std::istream &is, modint &rhs) noexcept { long long val; rhs.val = (is >> val, val & 1); return is; } }; // class modint specialization #endif // modint_hpp #pragma endregion struct solver; template <class> void main_(); int main() { main_<solver>(); } template <class solver> void main_() { unsigned t = 1; #ifdef LOCAL t = 1; #endif // t = -1; // infinite loop // cin >> t; // case number given while(t--) solver(); } struct solver { using mint=modint<998244353>; solver() { int n,m; cin>>n>>m; vector<p32> ed(m); cin>>ed; mint ans=0; { mint y=1; for(int x=n,u=1; x>0; u++,x--) { y*=x; if(u>=3) ans+=y/u; } } ans/=2; // vector<mint> fac(n+m+1); // fac[0]=1; // for(int i=1; i<fac.size(); i++) fac[i]=i*fac[i-1]; // vector ste(n+1,vector<mint>(m+1)); // for() for(int s=1; s<1<<m; s++) { hashmap<int,int> cnt; bool fail=0; int con=0; int sz=0; for(int i=0; i<m; i++) { if(s>>i&1) { sz++; auto [a,b]=ed[i]; if(cnt[a]>1) fail=1; if(cnt[b]>1) fail=1; if(cnt[a]==1) con++; if(cnt[b]==1) con++; cnt[a]++; cnt[b]++; } } if(fail) continue; if(sz>con) { mint tmp; for(int l=(sz==1); l<=n-sz*2+con; l++) { mint ttmp=1; for(int i=0; i<l; i++) ttmp*=n-sz*2+con-i; for(int i=1; i<sz-con; i++) ttmp*=l+i; tmp+=ttmp; } for(int x=1; x<sz-con; x++) tmp*=2; if(sz&1) ans-=tmp; else ans+=tmp; } else { if(sz&1) ans-=1; else ans+=1; } } cout << ans << "\n"; } };