Submission #3010200
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long lint; typedef long double llf; typedef pair<int, int> pi; const int mod = 1e9 + 7; const int MAXN = 305; lint ipow(lint x, lint p){ lint ret = 1, piv = x % mod; while(p){ if(p&1) ret *= piv; piv *= piv; ret %= mod; piv %= mod; p >>= 1; } return ret % mod; } int n, d[MAXN]; lint fact[MAXN], invf[MAXN]; lint dp[MAXN][MAXN][MAXN]; lint f(int x, int y, int z){ if(x == n) return (y == 0 && z == 0); if(y < 0 || z < 0) return 0; if(~dp[x][y][z]) return dp[x][y][z]; lint ans = f(x + 1, y, z); if(d[x] > 1) ans += f(x + 1, y - 1, z - (d[x] - 2)) * (d[x] - 1); ans %= mod; return dp[x][y][z] = ans; } int main(){ fact[0] = 1; for(int i=1; i<MAXN; i++) fact[i] = fact[i-1] * i % mod; for(int i=0; i<MAXN; i++) invf[i] = ipow(fact[i], mod-2); cin >> n; for(int i=0; i<n; i++) cin >> d[i]; if(count(d, d + n, 2) == n){ cout << fact[n-1] * ipow(2, mod - 2) % mod<< endl; return 0; } memset(dp, -1, sizeof(dp)); lint ret = 0; for(int i=3; i<=n; i++){ for(int j=1; j<=n; j++){ lint ans = fact[n - 1 - i] * fact[i - 1] % mod; ans *= j; ans %= mod; ans *= f(0, i, j); ans %= mod; ret += ans; } } ret %= mod; for(int j=0; j<n; j++) ret *= invf[d[j] - 1], ret %= mod; ret %= mod; ret *= (mod + 1) / 2; cout << ret % mod << endl; }
Submission Info
Submission Time | |
---|---|
Task | F - Unicyclic Graph Counting |
User | fxt |
Language | C++ (GCC 5.4.1) |
Score | 1000 |
Code Size | 1409 Byte |
Status | AC |
Exec Time | 776 ms |
Memory | 222080 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 200 / 200 | 300 / 300 | 300 / 300 | ||||||||||
Status |
|
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt |
Subtask1 | 00_example_01.txt, s1_01.txt, s1_02.txt, s1_03.txt, s1_04.txt, s1_05.txt, s1_06.txt, s1_07.txt, s1_08.txt |
Subtask2 | 00_example_01.txt, 00_example_02.txt, s1_01.txt, s1_02.txt, s1_03.txt, s1_04.txt, s1_05.txt, s1_06.txt, s1_07.txt, s1_08.txt, s2_09.txt, s2_10.txt, s2_11.txt, s2_12.txt, s2_13.txt, s2_14.txt, s2_15.txt, s2_16.txt |
Subtask3 | 00_example_01.txt, 00_example_02.txt, s1_01.txt, s1_02.txt, s1_03.txt, s1_04.txt, s1_05.txt, s1_06.txt, s1_07.txt, s1_08.txt, s2_09.txt, s2_10.txt, s2_11.txt, s2_12.txt, s2_13.txt, s2_14.txt, s2_15.txt, s2_16.txt, s3_17.txt, s3_18.txt, s3_19.txt, s3_20.txt, s3_21.txt, s3_22.txt, s3_23.txt, s3_24.txt, s3_25.txt, s3_26.txt |
All | 00_example_01.txt, 00_example_02.txt, s1_01.txt, s1_02.txt, s1_03.txt, s1_04.txt, s1_05.txt, s1_06.txt, s1_07.txt, s1_08.txt, s2_09.txt, s2_10.txt, s2_11.txt, s2_12.txt, s2_13.txt, s2_14.txt, s2_15.txt, s2_16.txt, s3_17.txt, s3_18.txt, s3_19.txt, s3_20.txt, s3_21.txt, s3_22.txt, s3_23.txt, s3_24.txt, s3_25.txt, s3_26.txt, s4_27.txt, s4_28.txt, s4_29.txt, s4_30.txt, s4_31.txt, s4_32.txt, s4_33.txt, s4_34.txt, s4_35.txt, s4_36.txt, s4_37.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 56 ms | 221952 KB |
00_example_02.txt | AC | 55 ms | 221952 KB |
s1_01.txt | AC | 1 ms | 256 KB |
s1_02.txt | AC | 1 ms | 256 KB |
s1_03.txt | AC | 55 ms | 221952 KB |
s1_04.txt | AC | 1 ms | 256 KB |
s1_05.txt | AC | 55 ms | 221952 KB |
s1_06.txt | AC | 55 ms | 221952 KB |
s1_07.txt | AC | 55 ms | 221952 KB |
s1_08.txt | AC | 56 ms | 221952 KB |
s2_09.txt | AC | 55 ms | 221952 KB |
s2_10.txt | AC | 55 ms | 221952 KB |
s2_11.txt | AC | 55 ms | 221952 KB |
s2_12.txt | AC | 55 ms | 221952 KB |
s2_13.txt | AC | 55 ms | 221952 KB |
s2_14.txt | AC | 1 ms | 256 KB |
s2_15.txt | AC | 55 ms | 221952 KB |
s2_16.txt | AC | 55 ms | 221952 KB |
s3_17.txt | AC | 56 ms | 221952 KB |
s3_18.txt | AC | 56 ms | 221952 KB |
s3_19.txt | AC | 57 ms | 221952 KB |
s3_20.txt | AC | 57 ms | 221952 KB |
s3_21.txt | AC | 55 ms | 221952 KB |
s3_22.txt | AC | 58 ms | 221952 KB |
s3_23.txt | AC | 58 ms | 222080 KB |
s3_24.txt | AC | 1 ms | 256 KB |
s3_25.txt | AC | 58 ms | 221952 KB |
s3_26.txt | AC | 57 ms | 221952 KB |
s4_27.txt | AC | 146 ms | 221952 KB |
s4_28.txt | AC | 77 ms | 221952 KB |
s4_29.txt | AC | 638 ms | 221952 KB |
s4_30.txt | AC | 103 ms | 221952 KB |
s4_31.txt | AC | 776 ms | 221952 KB |
s4_32.txt | AC | 776 ms | 221952 KB |
s4_33.txt | AC | 1 ms | 256 KB |
s4_34.txt | AC | 598 ms | 221952 KB |
s4_35.txt | AC | 605 ms | 221952 KB |
s4_36.txt | AC | 660 ms | 221952 KB |
s4_37.txt | AC | 765 ms | 221952 KB |