oj.uz

답안 #362297

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362297 2021-02-02T14:32:36 Z Sho10 캥거루 (CEOI16_kangaroo) C++17
100 / 100
 39 ms 23020 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define aint(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,s1,s2,dp[2005][2005];
void sum(ll &a, ll b){
    a+=b;
    if(a>=mod)a-=mod;
}
int32_t main(){
CODE_START;
cin>>n>>s1>>s2;
if(s1>s2){
    swap(s1,s2);
}
dp[1][0]=1;
for(ll i=1;i<=n;i++)
{
    for(ll j=0;j<=i;j++)
    {
        if(i!=s1&&i!=s2){
            if(i<n&&j){
                sum(dp[i+1][j-1],1ll*dp[i][j]*j*(j-1)%mod);
            }
            if(i<n&&j<n){
                sum(dp[i+1][j+1],dp[i][j]);
            }
            if(i>s1&&i<n&&j){
                sum(dp[i+1][j-1],1ll*dp[i][j]*j%mod);
            }
            if(i>s2&&i<n&&j){
                sum(dp[i+1][j-1],1ll*dp[i][j]*j%mod);
            }
        }else {
            sum(dp[i+1][j],dp[i][j]);
            if(j){
                sum(dp[i+1][j-1],1ll*dp[i][j]*j%mod);
            }
    }
}
}
cout<<dp[n][0]<<endl;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 1260 KB Output is correct
13 Correct 1 ms 1260 KB Output is correct
14 Correct 2 ms 1260 KB Output is correct
15 Correct 1 ms 1260 KB Output is correct
16 Correct 2 ms 1260 KB Output is correct
17 Correct 2 ms 1388 KB Output is correct
18 Correct 2 ms 1132 KB Output is correct
19 Correct 2 ms 1260 KB Output is correct
20 Correct 2 ms 1388 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 1260 KB Output is correct
13 Correct 1 ms 1260 KB Output is correct
14 Correct 2 ms 1260 KB Output is correct
15 Correct 1 ms 1260 KB Output is correct
16 Correct 2 ms 1260 KB Output is correct
17 Correct 2 ms 1388 KB Output is correct
18 Correct 2 ms 1132 KB Output is correct
19 Correct 2 ms 1260 KB Output is correct
20 Correct 2 ms 1388 KB Output is correct
21 Correct 6 ms 4716 KB Output is correct
22 Correct 6 ms 5100 KB Output is correct
23 Correct 7 ms 5632 KB Output is correct
24 Correct 36 ms 23020 KB Output is correct
25 Correct 37 ms 23020 KB Output is correct
26 Correct 36 ms 23020 KB Output is correct
27 Correct 39 ms 22892 KB Output is correct
28 Correct 25 ms 15212 KB Output is correct