oj.uz

답안 #442345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
442345 2021-07-07T13:26:28 Z Bench0310 캥거루 (CEOI16_kangaroo) C++17
100 / 100
 38 ms 336 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,x,y;
    cin >> n >> x >> y;
    vector<ll> dp(n+1,0);
    dp[0]=1;
    const ll mod=1000000007;
    auto add=[&](ll a,ll b)->ll{return (a+b)%mod;};
    auto mul=[&](ll a,ll b)->ll{return (a*b)%mod;};
    for(int i=1;i<=n;i++)
    {
        vector<ll> ndp(n+1,0);
        for(int j=0;j<=n;j++)
        {
            if(i!=x&&i!=y)
            {
                //merge groups
                if(j>0) ndp[j-1]=add(ndp[j-1],mul(j-1,dp[j]));
                //make new group
                if(j<n&&j+1-(i>x)-(i>y)>=0) ndp[j+1]=add(ndp[j+1],mul(j+1-(i>x)-(i>y),dp[j]));
            }
            else if(i==x)
            {
                //add to front of first group
                ndp[j]=add(ndp[j],dp[j]);
                //make new first group
                if(j<n) ndp[j+1]=add(ndp[j+1],dp[j]);
            }
            else if(i==y)
            {
                //add to end of last group
                ndp[j]=add(ndp[j],dp[j]);
                //make new last group
                if(j<n) ndp[j+1]=add(ndp[j+1],dp[j]);
            }
        }
        dp=ndp;
    }
    cout << dp[1] << "\n";
    return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 284 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 6 ms 204 KB Output is correct
22 Correct 5 ms 204 KB Output is correct
23 Correct 7 ms 204 KB Output is correct
24 Correct 37 ms 332 KB Output is correct
25 Correct 37 ms 332 KB Output is correct
26 Correct 38 ms 332 KB Output is correct
27 Correct 36 ms 332 KB Output is correct
28 Correct 21 ms 336 KB Output is correct