oj.uz

답안 #283485

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283485 2020-08-25T20:23:24 Z caoash 캥거루 (CEOI16_kangaroo) C++14
100 / 100
 48 ms 31736 KB 
#include <bits/stdc++.h> 
using namespace std;

using ll = long long;

using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

const int MOD = (int) 1e9 + 7;

ll dp[2005][2005];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, a, b; cin >> n >> a >> b;
    dp[0][0] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == a || i == b) {
                dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1];
            }
            else {
                dp[i][j] = ((j * dp[i - 1][j + 1]) % MOD) + (((j - (i > a) - (i > b)) * dp[i - 1][j - 1]) % MOD) % MOD;
            }
        }
    }
    cout << dp[n][1] << '\n';
}

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 1408 KB Output is correct
13 Correct 1 ms 1408 KB Output is correct
14 Correct 1 ms 1408 KB Output is correct
15 Correct 1 ms 1408 KB Output is correct
16 Correct 1 ms 1408 KB Output is correct
17 Correct 1 ms 1408 KB Output is correct
18 Correct 1 ms 1280 KB Output is correct
19 Correct 1 ms 1408 KB Output is correct
20 Correct 1 ms 1408 KB Output is correct
21 Correct 5 ms 6400 KB Output is correct
22 Correct 6 ms 7040 KB Output is correct
23 Correct 7 ms 7808 KB Output is correct
24 Correct 37 ms 31736 KB Output is correct
25 Correct 48 ms 31736 KB Output is correct
26 Correct 31 ms 31736 KB Output is correct
27 Correct 31 ms 31608 KB Output is correct
28 Correct 21 ms 23808 KB Output is correct