結果

問題 No.2522 Fall in love, Girls!
ユーザー woodywoodywoodywoody
提出日時 2023-10-27 22:44:49
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 338 ms / 2,000 ms
コード長 6,287 bytes
コンパイル時間 4,039 ms
コンパイル使用メモリ 244,328 KB
実行使用メモリ 208,264 KB
最終ジャッジ日時 2024-09-25 14:45:03
合計ジャッジ時間 11,735 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 129 ms
81,404 KB
testcase_01 AC 128 ms
81,376 KB
testcase_02 AC 130 ms
81,316 KB
testcase_03 AC 331 ms
204,280 KB
testcase_04 AC 129 ms
81,448 KB
testcase_05 AC 128 ms
81,480 KB
testcase_06 AC 129 ms
81,876 KB
testcase_07 AC 129 ms
82,456 KB
testcase_08 AC 130 ms
83,136 KB
testcase_09 AC 134 ms
85,232 KB
testcase_10 AC 307 ms
208,108 KB
testcase_11 AC 303 ms
208,264 KB
testcase_12 AC 134 ms
85,264 KB
testcase_13 AC 299 ms
208,144 KB
testcase_14 AC 338 ms
208,152 KB
testcase_15 AC 332 ms
208,220 KB
testcase_16 AC 334 ms
208,108 KB
testcase_17 AC 142 ms
91,840 KB
testcase_18 AC 138 ms
88,556 KB
testcase_19 AC 141 ms
91,924 KB
testcase_20 AC 133 ms
85,880 KB
testcase_21 AC 134 ms
86,364 KB
testcase_22 AC 132 ms
85,240 KB
testcase_23 AC 136 ms
88,420 KB
testcase_24 AC 140 ms
90,888 KB
testcase_25 AC 295 ms
207,388 KB
testcase_26 AC 298 ms
206,448 KB
testcase_27 AC 131 ms
83,032 KB
testcase_28 AC 295 ms
204,580 KB
testcase_29 AC 130 ms
84,032 KB
testcase_30 AC 140 ms
91,732 KB
testcase_31 AC 133 ms
85,460 KB
testcase_32 AC 296 ms
206,252 KB
testcase_33 AC 131 ms
84,788 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!(x)) {vi v(3e8);}
#define asserttle(x) if (!(x)) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
} com(10000005);

void solve(){
    int n,m,k; cin>>n>>m>>k;
    vi idx(n,-1);
    vi idxr;
    map<int,int> mp;
    vi x(k),y(k);
    rep(i,k){
        cin>>x[i]>>y[i];
        x[i]--; y[i]--;
        mp[x[i]] = 0;
        mp[y[i]] = 0;
    }

    int now = 0;
    fore(y , mp){
        idx[y.fi] = now;
        y.se = now++;
        idxr.pb(y.fi);
    }
    vector<bitset<21>> sat(now);
    rep(i,k){
        sat[mp[y[i]]][mp[x[i]]] = 1;
    }

    int l = 1 << now;
    vvm dp(l,vm(now));
    rep(i,now){
        if (sat[i]==0) dp[1<<i][i] = 1;
    }
    rep1(i,l){
        bitset<21> b = i; 
        rep(j,now){
            if (dp[i][j]==0) continue;
            rep(jj,now){
                if (i>>jj&1) continue;
                if ((sat[jj]&b)!=sat[jj]) continue;
                int ni = i + (1<<jj);
                dp[ni][j] += dp[i][j]; 
            }
        }
    }

    int sub=0;
    int main=0;
    rep(i,n){
        if (idx[i]!=-1) continue;
        if (i<m) sub++;
        else main++;
    }
    mint ans = 0;
    rep(j,now){
        mint tmp = 0;
        if (main){
            tmp += mint(main) * com.fact[n-1] * com.ifact[now] * dp[l-1][j];
        }
        if (idxr[j]>=m){
            tmp += com.fact[n-1] * com.ifact[now-1] * dp[l-1][j];
        }
        ans += tmp;
    }
    if (now==0){
        ans += mint(main) * com.fact[n-1];
    }
    outm;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0