oj.uz

답안 #1112832

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112832 2024-11-15T02:38:28 Z ezzzay Zapina (COCI20_zapina) C++14
55 / 110
 1000 ms 592 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 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){
    return arr[a]%mod*fun((arr[b]%mod*(arr[a-b]%mod))%mod,mod-2)%mod;
}
signed main(){
    arr[0]=1;
    for(int i=1;i<N;i++){
        arr[i]=arr[i-1]*i%mod;
    }
    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
22.0 / 22.0

# 결과 실행 시간 메모리 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 3 ms 336 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct

Subtask #3
0 / 55.0

# 결과 실행 시간 메모리 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 3 ms 336 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Execution timed out 1068 ms 584 KB Time limit exceeded
18 Halted 0 ms 0 KB -