Submission #1367678

---

Source Code Expand

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

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int MOD2 = (int) 1e8 + 7;
const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ll isqrt(ll k) {ll r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
#define db(x) cerr << #x << " = " << (x) << ", ";
#define endln cerr << "\n";

const int maxn = 15 + 1;
int n, m;
int g[maxn][maxn];
vii f[1 << maxn];
int ff[maxn];
int p2[maxn];
int dp[1 << maxn];

void solve() {
    p2[0] = 1; FOR(i, 1, maxn) p2[i] = mult(p2[i - 1], 2);
    cin >> n >> m;
    FOR(i, 0, m) {
        int x, y; cin >> x >> y; x--, y--;
        g[x][y] = 1;
        ff[x] |= 1 << y;
    }
    FOR(msk, 0, 1 << n) if (bit(msk, 0) == bit(msk, 1)) {
        for (int submsk = (msk - 1 & msk); submsk > 0; submsk = (submsk - 1 & msk)) if (bit(submsk, 0) == bit(submsk, 1)) {
            int pmsk = msk ^ submsk;
            int t = 1;
            FOR(i, 0, n) if (bit(submsk, i)) {
                t = mult(t, p2[bitcount(ff[i] & pmsk)] + MOD - 1);
            }
            FOR(i, 0, n) if (bit(pmsk, i)) {
                t = mult(t, p2[bitcount(ff[i] & submsk)]);
            }
            f[msk].pb(mp(submsk, t));
        }
    }
    FOR(msk, 0, 1 << n) if (bit(msk, 0) == bit(msk, 1)) {
        dp[msk] = 1;
        FOR(i, 0, sz(f[msk])) {
            int submsk = f[msk][i].fi;
            int t = f[msk][i].se;
            if (bit(submsk, 0) == bit(submsk, 1)) {
                addmod(dp[msk], mult(dp[submsk], t));
            }
        }
    }
    int ans = fpow(2, m);
    submod(ans, dp[(1 << n) - 1]);
    cout << ans << "\n";
}

int main() {
    int JUDGE_ONLINE = 1;
    if (fopen("in.txt", "r")) {
        JUDGE_ONLINE = 0;
        assert(freopen("in.txt", "r", stdin));
        //assert(freopen("out.txt", "w", stdout));
    }
    else {
        ios_base::sync_with_stdio(0), cin.tie(0);
    }
    solve();
    if (!JUDGE_ONLINE) {
        //cout << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    }
    return 0;
}

Submission Info

Judge Result