結果
問題 | No.2522 Fall in love, Girls! |
ユーザー |
|
提出日時 | 2023-10-27 23:28:36 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,003 ms / 2,000 ms |
コード長 | 13,808 bytes |
コンパイル時間 | 2,659 ms |
コンパイル使用メモリ | 219,076 KB |
最終ジャッジ日時 | 2025-02-17 16:04:42 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define overload2(a, b, c, ...) c#define overload3(a, b, c, d, ...) d#define overload4(a, b, c, d, e ...) e#define overload5(a, b, c, d, e, f ...) f#define overload6(a, b, c, d, e, f, g ...) g#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")typedef long long ll;typedef long double ld;#define chmin(a,b) a = min(a,b);#define chmax(a,b) a = max(a,b);#define bit_count(x) __builtin_popcountll(x)#define leading_zero_count(x) __builtin_clz(x)#define trailing_zero_count(x) __builtin_ctz(x)#define gcd(a,b) __gcd(a,b)#define lcm(a,b) a / gcd(a,b) * b#define rep(...) overload3(__VA_ARGS__, rrep, rep1)(__VA_ARGS__)#define rep1(i,n) for(int i = 0 ; i < n ; i++)#define rrep(i,a,b) for(int i = a ; i < b ; i++)#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)#define pt(a) cout << a << endl;#define print(...) printall(__VA_ARGS__);#define debug(a) cout << #a << " " << a << endl;#define all(a) a.begin(), a.end()#define endl "\n";#define v1(T,n,a) vector<T>(n,a)#define v2(T,n,m,a) vector<vector<T>>(n,v1(T,m,a))#define v3(T,n,m,k,a) vector<vector<vector<T>>>(n,v2(T,m,k,a))#define v4(T,n,m,k,l,a) vector<vector<vector<vector<T>>>>(n,v3(T,m,k,l,a))template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}template<typename T>istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}template<typename T>ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}returnos;}template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;}template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":"");}return os;}template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}returnos;}template<class... Args> void printall(Args... args){for(auto i:initializer_list<common_type_t<Args...>>{args...}) cout<<i<<" ";cout<<endl;}const int mod = 998244353 ;template< int mod >struct ModInt {int x;ModInt() : x(0) {}ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;while(b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return ModInt(u);}ModInt pow(int64_t n) const {ModInt ret(1), mul(x);while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p) {return os << p.x;}friend istream &operator>>(istream &is, ModInt &a) {int64_t t;is >> t;a = ModInt< mod >(t);return (is);}static int get_mod() { return mod; }};using modint = ModInt< mod >;const int MAX_N = 2010101 ;modint inv[MAX_N+1] ; // (n!)^(p-2) (mod p) を格納modint fac[MAX_N+1] ; // (n!) (mod p) を格納modint powmod(modint x , ll n){modint res = 1 ;while(n > 0){if(n & 1) res *= x;x *= x;n >>= 1 ;}return res ;}// 階乗の逆元(n!)^(-1)のmodを配列に格納void f(){inv[0] = 1 ; inv[1] = 1 ;for(ll i = 2 ; i <= MAX_N ; i++){inv[i] = powmod(i,mod-2) * inv[i-1];}}// 階乗のmodを配列に格納void g(){fac[0] = 1 ; fac[1] = 1 ;for(ll i = 2 ; i <= MAX_N ; i++){fac[i] = fac[i-1] * i;}}//nCrの計算modint combination(ll n , ll r){if(n < 0 || r < 0 || n < r) return 0 ;return fac[n] * inv[n-r] * inv[r];}modint permutation(ll n , ll r){if(n < 0 || r < 0 || n < r) return 0 ;return fac[n] * inv[n-r];}void init(){ f() ; g() ; }template<typename Key,typename Val>struct hash_map{using u32=uint32_t;using u64=uint64_t;using Data=pair<Key,Val>;protected:template <typename K>inline u64 randomized(const K&key)const{return u64(key)^r;}template<typename K,enable_if_t<is_integral<K>::value,nullptr_t> = nullptr>inline u64 inner_hash(const K&key)const{return (randomized(key)*11995408973635179863ULL);}template<typename K,enable_if_t<is_integral<decltype(K::first)>::value,nullptr_t> = nullptr,enable_if_t<is_integral<decltype(K::second)>::value,nullptr_t> = nullptr>inline u64 inner_hash(const K&key)const{u64 a=randomized(key.first),b=randomized(key.second);a*=11995408973635179863ULL;b*=10150724397891781847ULL;return (a+b);}template <typename K,enable_if_t<is_integral<typename K::value_type>::value,nullptr_t> = nullptr>inline u64 inner_hash(const K&key)const{static constexpr u64 mod=(1LL << 61)-1;static constexpr u64 base=950699498548472943ULL;u64 res=0;for(auto&elem:key) {__uint128_t x=__uint128_t(res)*base+(randomized(elem)&mod);res=(x&mod)+(x>>61);}__uint128_t x=__uint128_t(res)*base;res=(x&mod)+(x >> 61);if(res>=mod)res-=mod;return (res<<3);}inline u32 hash(const Key&key)const{return inner_hash(key)>>shift;}void reallocate(u32 new_cap){vector<Data>new_data(new_cap);vector<bool>new_flag(new_cap,false);shift=64-__lg(new_cap);for(u32 i=0;i<cap;i++){if(flag[i]&&!dflag[i]){u32 h=hash(data[i].first);while(new_flag[h])h=(h+1)&(new_cap-1);new_data[h]=move(data[i]);new_flag[h]=true;}}data.swap(new_data);flag.swap(new_flag);cap=new_cap;dflag.resize(cap);fill(dflag.begin(),dflag.end(),false);}inline bool should_extend(u32 x)const{return x*2>=cap;}inline bool should_shrink(u32 x)const{return 4<cap&&x*10<=cap;}inline void extend(){reallocate(cap<<1);}inline void shrink(){reallocate(cap>>1);}public:u32 cap,s;vector<Data>data;vector<bool>flag,dflag;u32 shift;static u64 r;static constexpr uint32_t DEFAULT_SIZE=4;struct iterator{u32 i;hash_map<Key,Val>*p;explicit constexpr iterator():i(0),p(nullptr){}explicit constexpr iterator(u32 i,hash_map<Key,Val>*p):i(i),p(p){}explicit constexpr iterator(u32 i,const hash_map<Key,Val>*p):i(i),p(const_cast<hash_map<Key,Val>*>(p)){}const Data& operator*()const{return const_cast<hash_map<Key,Val>*>(p)->data[i];}Data& operator*(){return p->data[i];}Data* operator->(){return &(p->data[i]);}friend void swap(iterator&a,iterator&b){swap(a.i,b.i);swap(a.p,b.p);}friend bool operator==(const iterator&a,const iterator&b){return a.i==b.i;}friend bool operator!=(const iterator&a,const iterator&b){return a.i!=b.i;}iterator& operator++(){assert(i!=p->cap&&"iterator overflow");do{i++;if(i==p->cap)break;if(p->flag[i]&&!(p->dflag[i]))break;} while(true);return *this;}iterator operator++(int){iterator tmp(*this);++(*this);return tmp;}iterator& operator--(){do{i--;if(p->flag[i]&&!(p->dflag[i]))break;assert(i!=0&&"iterator underflow");} while(true);return *this;}iterator operator--(int){iterator tmp(*this);--(*this);return tmp;}};using itr=iterator;explicit hash_map():cap(DEFAULT_SIZE),s(0),data(cap),flag(cap),dflag(cap),shift(62){}itr begin()const{u32 h=0;while(h!=cap){if(flag[h]&&!dflag[h])break;h++;}return itr(h,this);}itr end()const{return itr(this->cap,this);}friend itr begin(hash_map<Key,Val>&a){return a.begin();}friend itr end(hash_map<Key,Val>&a){return a.end();}itr find(const Key&key)const{u32 h=hash(key);while(true){if(!flag[h])return this->end();if(data[h].first==key){if(dflag[h])return this->end();return itr(h,this);}h=(h+1)&(cap-1);}}bool contain(const Key&key)const{return find(key)!=this->end();}int count(const Key&key)const{return int(find(key)!=this->end());}itr insert(const Data&d){u32 h=hash(d.first);while(true){if(!flag[h]){if(should_extend(s+1)){extend();h=hash(d.first);continue;}data[h]=d;flag[h]=true;s++;return itr(h,this);}if(data[h].first==d.first){if(dflag[h]){data[h]=d;dflag[h]=false;s++;}return itr(h,this);}h=(h+1)&(cap-1);}}bool erase(itr it){if(it==this->end())return false;s--;if(should_shrink(s)){Data d=data[it.i];shrink();it=find(d.first);}int ni=(it.i+1)&(cap-1);if(flag[ni]){dflag[it.i]=true;}else{flag[it.i]=false;}return true;}bool erase(const Key&key){return erase(find(key));}bool empty()const{return s==0;}u32 size()const{return s;}void clear(){s=0;fill(flag.begin(),flag.end(),false);fill(dflag.begin(),dflag.end(),false);}void reserve(int n){if(n<=0)return;n=1<<(__lg(n)+2);if(cap<u32(n))reallocate(n);}Val& operator[](const Key&key){u32 h=hash(key);while(true){if(!flag[h]){if(should_extend(s+1)){extend();h=hash(key);continue;}data[h]=Data(key,Val());flag[h]=true;s++;return data[h].second;}if(data[h].first==key){if(dflag[h])data[h].second=Val();return data[h].second;}h=(h+1)&(cap-1);}}bool emplace(const Key&key,const Val&val){return insert(Data(key,val));}};template<typename Key,typename Val>uint64_t hash_map<Key,Val>::r=chrono::duration_cast<chrono::nanoseconds>(chrono::system_clock::now().time_since_epoch()).count();int n, m, k;bool exist[30][30];void solve(){init();cin >> n >> m >> k;vector<int> X(k), Y(k);rep(i,k) cin >> X[i] >> Y[i];rep(i,k) X[i]--, Y[i]--;hash_map<int,int> mp, sv;int t = 0;int cnt = 0;rep(i,k){int x = X[i];int y = Y[i];if(!sv.count(x)) {mp[t] = x;sv[x] = t++;}if(!sv.count(y)) {mp[t] = y;sv[y] = t++;}}vector<vector<modint>> dp(1<<t,vector<modint>(2,0));rep(i,t){dp[1<<i][0] = 1;if(mp[i] >= m){dp[1<<i][1] = 1;cnt++;}}rep(i,k){exist[sv[Y[i]]][sv[X[i]]] = true;}rep(S,1<<t){rep(i,t){if(S >> i & 1) continue;bool ok = true;rep(j,t){if(!(S >> j & 1)) continue;if(exist[j][i]) ok = false;}if(ok) dp[S | 1 << i][0] += dp[S][0];if(ok) dp[S | 1 << i][1] += dp[S][1];}}modint res = 0;{modint val = k == 0 ? 1 : dp[(1<<t)-1][1];res += permutation(n-t,n-t) * combination(n-1,t-1) * val;}{modint val = k == 0 ? 1 : dp[(1<<t)-1][0];res += permutation(n-t-1,n-t-1) * combination(n-1,t) * val * (n - m - cnt);}pt(res)}int main(){fast_ioint t = 1;// cin >> t;rep(i,t) solve();}