Submission #1771426


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

const int mod = 1000*1000*1000+7;

int N, M;
vector<vector<int> > adj;
vector<vector<int> > Sub;
vector<vector<int> > prec;
vector<int> po;

vector<int> cc;
int dp(int mask) {
    int &ret = cc[mask];
    if(ret != -1) return ret;

    ret = 1;
    for(int i = 0; i < Sub[mask].size(); i++) {
        int nmask = Sub[mask][i];
        if(nmask == 0 || nmask == mask) continue;
        if((nmask & 3) != 0 && (nmask & 3) != 3) continue;

        int tmp = 1;
        for(int j = 0; j < N; j++) {
            if((nmask & (1<<j))) tmp = 1LL * tmp * (po[ prec[j][ mask ^ nmask ] ] - 1) % mod;
            if(((mask ^ nmask) & (1<<j))) tmp = 1LL * tmp * po[ prec[j][nmask] ] % mod;
        }
        tmp = 1LL * tmp * dp(nmask) % mod;
        ret += tmp;
        ret %= mod;
    }

    return ret;
}

int main() {
    po.resize(1000);
    po[0] = 1;
    for(int i = 1; i < 1000; i++) {
        po[i] = po[i - 1] * 2 % mod;
    }

    scanf("%d %d", &N, &M);

    adj.resize(N);

    for(int i = 0; i < M; i++) {
        int x, y; scanf("%d %d", &x, &y);
        x--; y--;

        adj[x].push_back(y);
    }

    Sub.resize(1 << N);
    for(int i = 0; i < (1 << N); i++) {
        if(i == 0) {
            Sub[i].push_back(0);
            continue;
        }
        for(int j = 0; j < Sub[ i - (i&-i) ].size(); j++) {
            Sub[i].push_back(Sub[ i - (i&-i) ][j]);
            Sub[i].push_back(Sub[ i - (i&-i) ][j] + (i&-i));
        }
    }

    prec = vector<vector<int> >(N, vector<int>(1 << N, 0));
    for(int u = 0; u < N; u++) {
        for(int mask = 0; mask < (1 << N); mask++) {
            int cnt = 0;
            for(int i = 0; i < adj[u].size(); i++) {
                int v = adj[u][i];
                if(mask & (1<<v)) cnt++;
            }
            prec[u][mask] = cnt;
        }
    }

    cc = vector<int>(1 << N, -1);
    cout << (po[M] - dp((1 << N) - 1) + mod) % mod;
}

Submission Info

Submission Time
Task F - Games on DAG
User choikiwon
Language C++14 (GCC 5.4.1)
Score 1600
Code Size 2022 Byte
Status AC
Exec Time 462 ms
Memory 62588 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:43:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &N, &M);
                           ^
./Main.cpp:48:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         int x, y; scanf("%d %d", &x, &y);
                                         ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1600 / 1600
Status
AC × 4
AC × 40
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 456 ms 60544 KB
1_02.txt AC 458 ms 60544 KB
1_03.txt AC 460 ms 60544 KB
1_04.txt AC 460 ms 60544 KB
1_05.txt AC 460 ms 60544 KB
1_06.txt AC 460 ms 60544 KB
1_07.txt AC 460 ms 60544 KB
1_08.txt AC 462 ms 60544 KB
1_09.txt AC 460 ms 60544 KB
1_10.txt AC 461 ms 60544 KB
1_11.txt AC 461 ms 60544 KB
1_12.txt AC 460 ms 60544 KB
1_13.txt AC 462 ms 60544 KB
1_14.txt AC 461 ms 60544 KB
1_15.txt AC 460 ms 60544 KB
1_16.txt AC 460 ms 60544 KB
1_17.txt AC 460 ms 60544 KB
1_18.txt AC 461 ms 60544 KB
1_19.txt AC 461 ms 60544 KB
1_20.txt AC 460 ms 60544 KB
1_21.txt AC 3 ms 512 KB
1_22.txt AC 460 ms 60544 KB
1_23.txt AC 461 ms 60544 KB
1_24.txt AC 155 ms 20864 KB
1_25.txt AC 2 ms 384 KB
1_26.txt AC 460 ms 60544 KB
1_27.txt AC 17 ms 2688 KB
1_28.txt AC 459 ms 62588 KB
1_29.txt AC 51 ms 7424 KB
1_30.txt AC 18 ms 2688 KB
1_31.txt AC 460 ms 60544 KB
1_32.txt AC 51 ms 7424 KB
1_33.txt AC 17 ms 2688 KB
1_34.txt AC 154 ms 20864 KB
1_35.txt AC 51 ms 7424 KB