QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#451115#990. Colorful ComponentsRikku_eqWA 61ms5388kbC++141.5kb2024-06-22 21:09:562024-06-22 21:09:58

Judging History

你现在查看的是最新测评结果

  • [2024-06-22 21:09:58]
  • 评测
  • 测评结果:WA
  • 用时:61ms
  • 内存:5388kb
  • [2024-06-22 21:09:56]
  • 提交

answer

#include <bits/stdc++.h>
#define N 304
#define mod 1000000007
using namespace std;
typedef long long ll;

int n, K, cnt[N], c[N];
ll C[N][N], g[N], f[N][N], h[N];

ll pw (ll bs, ll t)
{
    ll res=1;
    while (t) {
        if (t&1) { res=res*bs%mod; }
        bs=bs*bs%mod; t>>=1;
    }
    return res;
}

int main ()
{
    // freopen("0test.in", "r", stdin);
    // freopen("0test.out", "w", stdout);

    scanf("%d %d", &n, &K);
    for (int i=1; i<=n; i++) { scanf("%d", &c[i]); cnt[c[i]]++; }

    for (int i=0; i<=n; i++) {
        C[i][0]=1;
        for (int j=1; j<=i; j++) { C[i][j]=(C[i-1][j]+C[i-1][j-1]) %mod;}
    }

    f[1][1]=1; g[1]=1;
    for (int k=2; k<=n; k++) {
        g[k]=(k>K ? 0 : pw(k, k-2));
        for (int i=2; i<=k; i++) {
            for (int j=1; j<k; j++) {
                f[k][i]+=f[k-j][i-1]*C[k-1][j-1] %mod *g[j] %mod;
                f[k][i]%=mod;
            }
            g[k]-=f[k][i]*pw(k, i-2)%mod; f[k][1]%=mod;
        }
        f[k][1]=g[k]*k%mod; g[k]=g[k]*k%mod;
    }

    h[0]=1;
    for (int i=1; i<=n; i++) if (cnt[i]) {
        for (int j=n; j>=0; j--) {
            h[j]=0;
            for (int k=1; k<=j; k++) {
                h[j]+=h[j-k]*f[cnt[i]][k] %mod;
                h[j]%=mod;
            }
        }
    }

    ll ans=h[1];
    for (int j=2; j<=n; j++) { ans+=h[j]*pw(n, j-2)%mod; ans%=mod; }
    ans=(ans+mod)%mod;
    printf("%lld\n", ans);

    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3832kb

input:

5 3
1
1
3
1
5

output:

125

result:

ok "125"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3912kb

input:

4 2
2
1
1
1

output:

7

result:

ok "7"

Test #3:

score: 0
Accepted
time: 40ms
memory: 5196kb

input:

300 16
2
2
2
4
5
1
5
3
5
4
2
1
4
4
4
5
2
1
5
4
3
4
5
3
5
5
1
3
1
1
2
5
5
3
3
2
5
2
3
2
2
4
2
2
2
4
4
2
2
4
1
3
3
4
1
3
3
4
3
4
3
5
5
4
3
3
1
2
1
2
5
2
2
4
3
3
5
3
2
4
3
5
1
4
5
5
2
3
2
3
4
4
5
5
5
5
4
5
3
2
4
4
4
3
5
3
1
1
3
5
5
4
5
2
5
5
5
2
2
2
3
1
5
4
1
4
3
5
1
4
4
2
5
2
2
4
5
3
4
3
3
4
2
5
1
1
3...

output:

540253743

result:

ok "540253743"

Test #4:

score: 0
Accepted
time: 41ms
memory: 5320kb

input:

300 20
2
7
4
5
1
10
3
10
9
2
6
4
9
4
5
2
6
10
9
8
4
10
8
5
5
1
3
1
1
7
5
5
3
8
7
10
2
3
2
7
4
7
7
7
9
9
2
7
9
6
3
3
4
1
8
8
4
3
4
8
5
10
9
3
3
6
7
6
7
10
7
2
9
3
3
10
3
7
4
8
10
1
4
5
10
2
3
7
3
4
9
5
10
5
10
9
5
3
2
9
4
4
3
10
3
6
1
8
5
10
4
5
7
10
5
5
7
2
7
3
1
5
4
1
9
3
5
1
9
4
7
10
2
2
4
10
8
9
...

output:

616258392

result:

ok "616258392"

Test #5:

score: 0
Accepted
time: 57ms
memory: 5344kb

input:

300 1
124
25
131
70
63
150
139
62
46
94
9
34
25
102
66
120
139
28
134
120
98
135
95
21
43
71
11
87
45
15
33
58
37
70
12
63
132
47
104
97
67
17
9
119
72
87
29
96
53
103
34
71
58
78
34
3
94
78
115
60
139
43
63
46
127
146
37
60
37
12
59
23
43
120
53
107
54
68
70
21
94
125
10
22
143
117
133
64
129
55
14...

output:

450350134

result:

ok "450350134"

Test #6:

score: 0
Accepted
time: 61ms
memory: 5388kb

input:

300 2
131
70
63
150
139
62
46
94
9
34
25
102
66
120
139
28
134
120
98
135
95
21
43
71
11
87
45
15
33
58
37
70
12
63
132
47
104
97
67
17
9
119
72
87
29
96
53
103
34
71
58
78
34
3
94
78
115
60
139
43
63
46
127
146
37
60
37
12
59
23
43
120
53
107
54
68
70
21
94
125
10
22
143
117
133
64
129
55
140
75
10...

output:

942808207

result:

ok "942808207"

Test #7:

score: 0
Accepted
time: 40ms
memory: 5388kb

input:

300 150
1
2
2
2
1
2
1
2
2
2
1
2
2
2
2
1
1
1
1
1
1
1
1
1
1
2
1
2
2
1
2
1
2
1
1
1
1
1
2
1
1
2
1
1
2
1
2
2
2
1
2
2
1
2
1
1
1
2
1
2
1
2
1
2
1
1
1
2
1
1
2
2
2
1
2
1
2
2
1
1
1
2
1
1
2
1
2
1
1
1
2
1
2
2
1
2
1
2
1
2
1
2
2
1
1
2
1
1
1
2
1
1
1
1
2
1
1
1
1
1
1
2
1
2
2
2
2
2
2
1
1
1
2
2
1
1
1
1
1
2
1
1
2
1
1
1
...

output:

169425341

result:

ok "169425341"

Test #8:

score: 0
Accepted
time: 36ms
memory: 5316kb

input:

300 290
2
2
1
2
1
2
2
2
1
2
2
2
2
1
1
1
1
1
1
1
1
1
1
2
1
2
2
1
2
1
2
1
1
1
1
1
2
1
1
2
1
1
2
1
2
2
2
1
2
2
1
2
1
1
1
2
1
2
1
2
1
2
1
1
1
2
1
1
2
2
2
1
2
1
2
2
1
1
1
2
1
1
2
1
2
1
1
1
2
1
2
2
1
2
1
2
1
2
1
2
2
1
1
2
1
1
1
2
1
1
1
1
2
1
1
1
1
1
1
2
1
2
2
2
2
2
2
1
1
1
2
2
1
1
1
1
1
2
1
1
2
1
1
1
1
2
...

output:

394671363

result:

ok "394671363"

Test #9:

score: -100
Wrong Answer
time: 37ms
memory: 5324kb

input:

300 290
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
300
...

output:

976730434

result:

wrong answer 1st words differ - expected: '0', found: '976730434'