結果

問題 No.2435 Order All Company
ユーザー woodywoodywoodywoody
提出日時 2023-08-18 23:16:48
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 5,818 bytes
コンパイル時間 4,002 ms
コンパイル使用メモリ 237,764 KB
実行使用メモリ 14,976 KB
最終ジャッジ日時 2024-11-28 10:10:03
合計ジャッジ時間 85,922 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
10,496 KB
testcase_01 AC 2 ms
8,320 KB
testcase_02 AC 2 ms
10,496 KB
testcase_03 AC 2 ms
9,600 KB
testcase_04 TLE -
testcase_05 TLE -
testcase_06 TLE -
testcase_07 TLE -
testcase_08 TLE -
testcase_09 TLE -
testcase_10 TLE -
testcase_11 TLE -
testcase_12 TLE -
testcase_13 TLE -
testcase_14 TLE -
testcase_15 TLE -
testcase_16 TLE -
testcase_17 TLE -
testcase_18 TLE -
testcase_19 TLE -
testcase_20 AC 14 ms
10,496 KB
testcase_21 TLE -
testcase_22 TLE -
testcase_23 TLE -
testcase_24 TLE -
testcase_25 TLE -
testcase_26 TLE -
testcase_27 TLE -
testcase_28 AC 14 ms
10,496 KB
testcase_29 TLE -
testcase_30 TLE -
testcase_31 AC 2 ms
10,496 KB
testcase_32 AC 2 ms
8,320 KB
testcase_33 AC 2 ms
10,496 KB
testcase_34 TLE -
testcase_35 TLE -
権限があれば一括ダウンロードができます

ソースコード

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 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
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

void solve(){
    int n,k; cin>>n>>k;
    vector<vvi> e(k,vvi(n));
    rep(i,k){
        int t; cin>>t;
        rep(j,t){
            int a,b; cin>>a>>b;
            a--; b--;
            e[i][a].pb(b);
            e[i][b].pb(a);
        }
    }

    // map<bitset<100>,mint> mp;

    auto f = [&](auto f,const vvm& v, bitset<50> row, bitset<50> col)->mint{
        // bitset<100> b;
        // rep(i,n) b[i] = row[i];
        // rep(i,n) b[i+n] = col[i];
        // if (mp.count(b)) return mp[b];
        vvm now;
        vi ridx,cidx;
        rep(i,n) if (row[i]==0) ridx.pb(i);
        rep(i,n) if (col[i]==0) cidx.pb(i);
        int k = sz(ridx);
        mint ret = 0;
        if (k == 2){
            ret = v[ridx[0]][cidx[0]]*v[ridx[1]][cidx[1]] - v[ridx[0]][cidx[1]]*v[ridx[1]][cidx[0]];
            return ret;
        }else if(k == 1){
            return v[ridx[0]][cidx[0]];
        }
        col[cidx[0]] = 1;
        rep(i,k){
            mint tmp = v[ridx[i]][cidx[0]];
            row[ridx[i]] = 1;
            tmp *= f(f,v,row,col);
            if ((i)%2==1) tmp *= -1;
            row[ridx[i]] = 0;
            ret += tmp;
        }
        col[cidx[0]] = 0;
        // mp[b] = ret;
        return ret;
    };

    mint ans = 0;
    int l = 1 << k;
    rep1(i,l){
        int p = pcnt(i);
        vvm v(n,vm(n));
        vvi ee(n);
        rep(j,k) if ((i>>j&1) == 1){
            rep(jj,n){
                fore(y , e[j][jj]){
                    v[jj][jj]++;
                    v[jj][y]--;
                }
            }
        }
        bitset<50> row,col;
        row[0] = 1;
        col[0] = 1;
        mint tmp = f(f,v,row,col);
        // rep(ii,n-1){
        //     rep(jj,n-1){
        //         int l = v2[ii][jj].val();
        //         if (l >= 10000) l = (l - 998244353 );
        //         cout << l << " ";
        //     }
        //     cout << endl;
        // }
        // show(tmp.val());
        // cout << endl;
        if ((k-p)%2==1) tmp *= -1;
        ans += tmp;
    }
    outm;

    return;
}

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

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

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

    return 0;
}
0