Submission #3134395
Source Code Expand
#include <iostream> #define llint long long #define mod 1000000007 using namespace std; llint N; llint d[305]; llint dp[305][305][305]; llint fact[605], fact_inv[605]; llint pow(llint a, llint n) { if(n == 0) return 1; if(n % 2){ return ((a%mod) * (pow(a, n-1)%mod)) % mod; } else{ return pow((a*a)%mod, n/2) % mod; } } void make_fact() { llint val = 1; fact[0] = 1; for(int i = 1; i < 605; i++){ val *= i; val %= mod; fact[i] = val; } for(int i = 0; i < 605; i++){ fact_inv[i] = pow(fact[i], mod-2); } } int main(void) { cin >> N; for(int i = 1; i <= N; i++) cin >> d[i]; make_fact(); bool flag = false; for(int i = 1; i <= N; i++){ if(d[i] < 2){ flag = true; break; } } if(!flag){ cout << fact[N-1] * pow(2, mod-2) % mod << endl; return 0; } dp[0][0][0] = 1; for(int i = 0; i < N; i++){ for(int j = 0; j < N; j++){ for(int k = 0; k <= N; k++){ dp[i+1][j][k] += dp[i][j][k], dp[i+1][j][k] %= mod; if(d[i+1] >= 2) dp[i+1][j+1][k+d[i+1]-2] += dp[i][j][k] * (d[i+1]-1) % mod, dp[i+1][j+1][k+d[i+1]-2] %= mod; } } } llint mul = 1; for(int i = 1; i <= N; i++) mul *= fact_inv[d[i]-1], mul %= mod; mul *= pow(2, mod-2), mul %= mod; /*for(int i = 0; i <= N; i++){ for(int j = 0; j <= N; j++){ for(int k = 0; k <= N; k++){ cout << dp[i][j][k] << " "; } cout << endl; } cout << endl; }*/ llint ans = 0; for(int i = 3; i < N; i++){ for(int j = 1; j <= N; j++){ if(dp[N][i][j] == 0) continue; llint tmp = fact[i-1] * fact[(N-i)-1] % mod; tmp *= j, tmp %= mod; tmp *= dp[N][i][j], tmp %= mod; ans += tmp, ans %= mod; } } ans *= mul, ans %= mod; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Unicyclic Graph Counting |
User | leaf1415 |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1795 Byte |
Status | AC |
Exec Time | 153 ms |
Memory | 218752 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 | 2 ms | 2304 KB |
00_example_02.txt | AC | 3 ms | 10624 KB |
s1_01.txt | AC | 1 ms | 256 KB |
s1_02.txt | AC | 1 ms | 256 KB |
s1_03.txt | AC | 2 ms | 2304 KB |
s1_04.txt | AC | 1 ms | 256 KB |
s1_05.txt | AC | 2 ms | 2304 KB |
s1_06.txt | AC | 2 ms | 2304 KB |
s1_07.txt | AC | 2 ms | 2304 KB |
s1_08.txt | AC | 2 ms | 2304 KB |
s2_09.txt | AC | 3 ms | 10624 KB |
s2_10.txt | AC | 4 ms | 12672 KB |
s2_11.txt | AC | 4 ms | 12672 KB |
s2_12.txt | AC | 4 ms | 12672 KB |
s2_13.txt | AC | 4 ms | 12672 KB |
s2_14.txt | AC | 1 ms | 256 KB |
s2_15.txt | AC | 4 ms | 12672 KB |
s2_16.txt | AC | 4 ms | 12672 KB |
s3_17.txt | AC | 6 ms | 24960 KB |
s3_18.txt | AC | 6 ms | 24960 KB |
s3_19.txt | AC | 7 ms | 29184 KB |
s3_20.txt | AC | 6 ms | 24960 KB |
s3_21.txt | AC | 4 ms | 14720 KB |
s3_22.txt | AC | 8 ms | 35328 KB |
s3_23.txt | AC | 9 ms | 35328 KB |
s3_24.txt | AC | 1 ms | 256 KB |
s3_25.txt | AC | 8 ms | 35328 KB |
s3_26.txt | AC | 9 ms | 35328 KB |
s4_27.txt | AC | 38 ms | 111616 KB |
s4_28.txt | AC | 19 ms | 70400 KB |
s4_29.txt | AC | 129 ms | 204288 KB |
s4_30.txt | AC | 26 ms | 88960 KB |
s4_31.txt | AC | 153 ms | 218624 KB |
s4_32.txt | AC | 153 ms | 218624 KB |
s4_33.txt | AC | 1 ms | 256 KB |
s4_34.txt | AC | 100 ms | 218624 KB |
s4_35.txt | AC | 99 ms | 218624 KB |
s4_36.txt | AC | 112 ms | 218752 KB |
s4_37.txt | AC | 148 ms | 218624 KB |