Submission #1363159
Source Code Expand
#pragma GCC optimize "-Ofast" #include <bits/stdc++.h> #define mp make_pair #define pb push_back typedef long long ll; typedef long long llong; typedef long double ld; using namespace std; template <typename T> void dprint(T begin, T end) { for (auto i = begin; i != end; i++) { cerr << (*i) << " "; } cerr << "\n"; } const ll MOD = 1e9 + 7; int n, m; ll ans; vector<int> eds[16]; int a[16]; int pp[16]; int pw[16]; void run(int x, ll now) { if (x == 1) { int cnt1[16]; int cnt2[16]; memset(cnt1, 0, sizeof(cnt1)); for (int u: eds[0]) ++cnt1[a[u]]; memset(cnt2, 0, sizeof(cnt2)); for (int u: eds[1]) ++cnt2[a[u]]; int g = eds[0].size() + eds[1].size(); ll cur = now; for (int i = 0; cur != 0; ++i) { g -= cnt1[i] + cnt2[i]; ans = (ans + cur * (1 << g)) % MOD; cur = (cur * ((1 << cnt1[i]) - 1)) % MOD; cur = (cur * ((1 << cnt2[i]) - 1)) % MOD; } return; } int cnt[16]; memset(cnt, 0, sizeof(cnt)); for (int u: eds[x]) ++cnt[a[u]]; int g = eds[x].size(); ll cur = now; for (int i = 0; cur != 0; ++i) { g -= cnt[i]; a[x] = i; run(x - 1, (cur * pw[g]) % MOD); cur = (cur * pp[cnt[i]]) % MOD; } } int main() { for (int i = 0; i < 16; ++i) pw[i] = (1 << i); for (int i = 0; i < 16; ++i) pp[i] = pw[i] - 1; cin >> n >> m; for (int i = 0; i < m; ++i) { int a, b; cin >> a >> b; --a, --b; if (a != 0 || b != 1) eds[a].push_back(b); } run(n - 1, 1); ll ans2 = 1; for (int i = 0; i < m; ++i) ans2 = (ans2 * 2) % MOD; ans2 -= ans; if (ans2 < 0) ans2 += MOD; cout << ans2 << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Games on DAG |
User | LHiC |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1962 Byte |
Status | AC |
Exec Time | 3599 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1600 / 1600 | ||||
Status |
|
|
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 | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 3599 ms | 256 KB |
1_04.txt | AC | 1910 ms | 256 KB |
1_05.txt | AC | 3539 ms | 256 KB |
1_06.txt | AC | 438 ms | 256 KB |
1_07.txt | AC | 940 ms | 256 KB |
1_08.txt | AC | 3342 ms | 256 KB |
1_09.txt | AC | 1489 ms | 256 KB |
1_10.txt | AC | 1578 ms | 256 KB |
1_11.txt | AC | 1218 ms | 256 KB |
1_12.txt | AC | 2533 ms | 256 KB |
1_13.txt | AC | 1890 ms | 256 KB |
1_14.txt | AC | 2974 ms | 256 KB |
1_15.txt | AC | 856 ms | 256 KB |
1_16.txt | AC | 710 ms | 256 KB |
1_17.txt | AC | 2997 ms | 256 KB |
1_18.txt | AC | 189 ms | 384 KB |
1_19.txt | AC | 2873 ms | 256 KB |
1_20.txt | AC | 1 ms | 256 KB |
1_21.txt | AC | 2 ms | 256 KB |
1_22.txt | AC | 7 ms | 256 KB |
1_23.txt | AC | 53 ms | 256 KB |
1_24.txt | AC | 1 ms | 256 KB |
1_25.txt | AC | 1 ms | 256 KB |
1_26.txt | AC | 275 ms | 256 KB |
1_27.txt | AC | 2 ms | 256 KB |
1_28.txt | AC | 1 ms | 256 KB |
1_29.txt | AC | 38 ms | 256 KB |
1_30.txt | AC | 1 ms | 256 KB |
1_31.txt | AC | 942 ms | 256 KB |
1_32.txt | AC | 48 ms | 256 KB |
1_33.txt | AC | 1 ms | 256 KB |
1_34.txt | AC | 5 ms | 256 KB |
1_35.txt | AC | 18 ms | 256 KB |