oj.uz

Submission #1112846

# Submission time Handle Problem Language Result Execution time Memory
1112846 2024-11-15T02:50:20 Z ezzzay Zapina (COCI20_zapina) C++14
0 / 110
 1 ms 504 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=355;
int dp[N][N][2];
const int mod=1e9+7;
int arr[N];
int mult[N*N*10];
int modd(int a){
    return((a%mod+mod)%mod);
}
int fun(int a, int b){
    int ans=1;
    for(int i=0;i<=31;i++){
        if(b&(1<<i)){
            ans=modd((ans*a));
        }
        a=modd(a*a);
    }
    return ans;
}
int find(int a, int b){
    if(b==0 or a==0)return 1;
    if(a==b)return 1;
    if(b>a)return 1;
    return modd(modd(arr[a]*mult[arr[a-b]])*mult[arr[b]]);
}
signed main(){
    arr[0]=1;
    for(int i=1;i<N;i++){
        arr[i]=arr[i-1]*i%mod;
    }
    
    for(int i=0;i<N;i++){
        mult[i]=fun(i,mod-2);
    }
    int n;
    cin>>n;
    dp[0][0][0]=1;
    for(int i=1;i<=n;i++){
        for(int j=0;j<=n;j++){
            for(int k=0;k<=n;k++){
                if(j+k>n)break;
                if(k==i){
                    dp[i][j+k][1]+=(dp[i-1][j][1]+dp[i-1][j][0])*find(n-j,k);
                   
                }
                else{
                    dp[i][j+k][1]+=dp[i-1][j][1]*find(n-j,k);
                    dp[i][j+k][0]+=dp[i-1][j][0]*find(n-j,k);
                }
                dp[i][j+k][1]%=mod;
                dp[i][j+k][0]%=mod;
               
            }
        }
    }
    cout<<dp[n][n][1];
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -