Submission #2045174
Source Code Expand
#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////
ll fac[MAX_N], inv[MAX_N], fiv[MAX_N]; //fiv:inv(fac(i))
ll mod_pow(ll a, ll n) {
if(n == 0) return 1;
ll res = mod_pow(a, n / 2);
if(n % 2 == 0) return res * res % mod;
else return a * res % mod * res % mod;
}
ll invf(ll a) {
return mod_pow(a, mod - 2);
}
void C_init(int n) {
fac[0] = fac[1] = 1; inv[1] = 1;
fiv[0] = fiv[1] = 1;
rep(i, 2, n + 1) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fiv[i] = fiv[i - 1] * inv[i] % mod;
}
}
ll C(int a, int b) { //assume a >= b
if(a < b || a < 0 || b < 0) return 0;
return fac[a] * fiv[b] % mod * fiv[a - b] % mod;
}
int N;
ll dp[2][310][610];
int d[310];
bool is_two() {
rep(i, 0, N) if(d[i] != 2) return false;
return true;
}
void solve() {
cin >> N;
C_init(2 * N);
rep(i, 0, N) cin >> d[i];
if(is_two()) {
cout << fac[N - 1] * fiv[2] % mod << "\n";
return;
}
dp[0][0][0] = 1;
int now = 0, nex = 1;
rep(i, 0, N) {
memset(dp[nex], 0, sizeof(dp[nex]));
rep(j, 0, N) {
rep(k, 0, 2 * N + 1) {
if(!dp[now][j][k]) continue;
if(d[i] >= 2) {
ADD(dp[nex][j + 1][k + d[i] - 2], dp[now][j][k] * fiv[d[i] - 2]);
}
ADD(dp[nex][j][k], dp[now][j][k] * fiv[d[i] - 1] % mod);
}
}
rep(j, 0, N) {
rep(k, 0, 2 * N + 1) {
if(!dp[nex][j][k]) continue;
debug(i + 1, j, k, dp[nex][j][k]);
}
}
swap(now, nex);
}
ll res = 0;
rep(j, 3, N) {
rep(k, 1, 2 * N + 1) {
if(!dp[now][j][k]) continue;
ADD(res, dp[now][j][k] * k * fac[N - j - 1] % mod * fac[j - 1] % mod * fiv[2] % mod);
debug(j, k, dp[now][j][k] * fac[N - j - 1] % mod * fiv[k - 1] % mod * fac[j - 1] % mod * fiv[2] % mod);
}
}
cout << res << "\n";
}
int main() {
#ifndef LOCAL
ios::sync_with_stdio(false);
cin.tie(0);
#endif
cout << fixed;
cout.precision(20);
srand((unsigned int)time(NULL));
#ifdef LOCAL
//freopen("in.txt", "wt", stdout); //for tester
freopen("in.txt", "rt", stdin);
#endif
solve();
#ifdef LOCAL
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
Submission Info
Submission Time |
|
Task |
F - Unicyclic Graph Counting |
User |
omochana2 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3670 Byte |
Status |
WA |
Exec Time |
810 ms |
Memory |
46592 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Subtask3 |
All |
Score / Max Score |
0 / 0 |
0 / 200 |
0 / 200 |
0 / 300 |
0 / 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 |
WA |
3 ms |
6400 KB |
00_example_02.txt |
WA |
4 ms |
6400 KB |
s1_01.txt |
AC |
2 ms |
4352 KB |
s1_02.txt |
AC |
2 ms |
4352 KB |
s1_03.txt |
WA |
3 ms |
6400 KB |
s1_04.txt |
AC |
2 ms |
4352 KB |
s1_05.txt |
WA |
3 ms |
6400 KB |
s1_06.txt |
WA |
3 ms |
6400 KB |
s1_07.txt |
WA |
3 ms |
6400 KB |
s1_08.txt |
WA |
3 ms |
6400 KB |
s2_09.txt |
WA |
4 ms |
6400 KB |
s2_10.txt |
WA |
4 ms |
6400 KB |
s2_11.txt |
WA |
4 ms |
6400 KB |
s2_12.txt |
WA |
4 ms |
6400 KB |
s2_13.txt |
WA |
4 ms |
6400 KB |
s2_14.txt |
AC |
2 ms |
4352 KB |
s2_15.txt |
WA |
4 ms |
6400 KB |
s2_16.txt |
WA |
4 ms |
6400 KB |
s3_17.txt |
WA |
7 ms |
6528 KB |
s3_18.txt |
WA |
7 ms |
6528 KB |
s3_19.txt |
WA |
8 ms |
6528 KB |
s3_20.txt |
WA |
7 ms |
6528 KB |
s3_21.txt |
WA |
5 ms |
6400 KB |
s3_22.txt |
WA |
10 ms |
6528 KB |
s3_23.txt |
WA |
11 ms |
6656 KB |
s3_24.txt |
AC |
2 ms |
4352 KB |
s3_25.txt |
WA |
7 ms |
6400 KB |
s3_26.txt |
WA |
7 ms |
6400 KB |
s4_27.txt |
WA |
103 ms |
10752 KB |
s4_28.txt |
WA |
38 ms |
7808 KB |
s4_29.txt |
WA |
614 ms |
35712 KB |
s4_30.txt |
WA |
62 ms |
8832 KB |
s4_31.txt |
WA |
810 ms |
46592 KB |
s4_32.txt |
WA |
724 ms |
42112 KB |
s4_33.txt |
AC |
2 ms |
4352 KB |
s4_34.txt |
WA |
100 ms |
6400 KB |
s4_35.txt |
WA |
99 ms |
6400 KB |
s4_36.txt |
WA |
503 ms |
29568 KB |
s4_37.txt |
WA |
463 ms |
27136 KB |