QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #768800 | #9254. Random Variables | Neil_Qian | WA | 0ms | 15188kb | C++14 | 659b | 2024-11-21 14:32:56 | 2024-11-21 14:33:08 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;using ll=long long;
const int N=1002;ll T,p,w=1000,n,m,C[N][N],dp[N][N],f[N],ans;
int main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0),cin>>T>>p,C[0][0]=1;
for(int i=1;i<=w;i++){
C[i][0]=C[i-1][0];
for(int j=1;j<=i;j++)C[i][j]=(C[i-1][j]+C[i-1][j-1])%p;
}
while(T--){
cin>>n>>m,ans=0;
for(int k=1,M;k<=n;k++){
M=max(m-(n/k),1LL);
for(int i=M;i<=m;i++)dp[0][i]=1;
for(int i=1;i<=n;i++)for(int j=M;j<=m;j++)
dp[i][j]=(j*(dp[i-1][j]+p-(i-k-1>=0?dp[i-k-1][j-1]*C[i-1][k]%p:0))%p);
f[k]=dp[n][m],(ans+=k*(f[k]+p-f[k-1])%p)%=p;
}
cout<<ans<<"\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 15188kb
input:
3 123456789 3 2 5 5 7 7
output:
18 7145 2066323
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 12892kb
input:
100 2 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 2 1 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 3 1 3 2 3 3 3 4 3 5 3 6 3 7 3 8 3 9 3 10 4 1 4 2 4 3 4 4 4 5 4 6 4 7 4 8 4 9 4 10 5 1 5 2 5 3 5 4 5 5 5 6 5 7 5 8 5 9 5 10 6 1 6 2 6 3 6 4 6 5 6 6 6 7 6 8 6 9 6 10 7 1 7 2 7 3 7 4 7 5 7 6 7 7 7 8 7 9 7 10 8 1 8 2...
output:
1 0 1 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0
result:
wrong answer 11th lines differ - expected: '0', found: '1'