oj.uz

Submission #116885

# Submission time Handle Problem Language Result Execution time Memory
116885 2019-06-14T03:28:44 Z minhtung0404 Kangaroo (CEOI16_kangaroo) C++17
100 / 100
 47 ms 16060 KB 
//https://oj.uz/problem/view/CEOI16_kangaroo

#include<bits/stdc++.h>
const int N = 2005;
const int mod = 1e9 + 7;
using namespace std;

int n, dp[N][N], s, e;

void add(int&a, int b){
    a += b; if (a >= mod) a -= mod; if (a < 0) a += mod;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n >> s >> e;
    if (s > e) swap(s, e);
    dp[0][0] = 1;
    for (int i = 1; i < n; i++){
        for (int j = 1; j <= n; j++){
            if (i != s && i != e){
                if (i >= e){
                    add(dp[i][j], 1LL * dp[i-1][j+1] * (j-1) * j % mod);
                }
                else{
                    if (i >= s){
                        add(dp[i][j], 1LL * dp[i-1][j+1] * j * j % mod);
                    }
                    else{
                        add(dp[i][j], 1LL * dp[i-1][j+1] * (j+1) * j % mod);
                    }
                }
            }
            else{
                if (i == s){
                    add(dp[i][j], 1LL * dp[i-1][j] * j % mod);
                }
                else{
                    add(dp[i][j], 1LL * dp[i-1][j] * (j-1) % mod);
                }
            }
            add(dp[i][j], dp[i-1][j-1]);
        }
    }
    if (e == n) cout << dp[n-1][1];
    else cout << dp[n-1][2];
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 316 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 316 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 316 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 1280 KB Output is correct
13 Correct 3 ms 1280 KB Output is correct
14 Correct 3 ms 1292 KB Output is correct
15 Correct 3 ms 1280 KB Output is correct
16 Correct 3 ms 1280 KB Output is correct
17 Correct 3 ms 1280 KB Output is correct
18 Correct 3 ms 1152 KB Output is correct
19 Correct 3 ms 1280 KB Output is correct
20 Correct 3 ms 1280 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 316 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 1280 KB Output is correct
13 Correct 3 ms 1280 KB Output is correct
14 Correct 3 ms 1292 KB Output is correct
15 Correct 3 ms 1280 KB Output is correct
16 Correct 3 ms 1280 KB Output is correct
17 Correct 3 ms 1280 KB Output is correct
18 Correct 3 ms 1152 KB Output is correct
19 Correct 3 ms 1280 KB Output is correct
20 Correct 3 ms 1280 KB Output is correct
21 Correct 9 ms 4736 KB Output is correct
22 Correct 9 ms 4992 KB Output is correct
23 Correct 11 ms 5632 KB Output is correct
24 Correct 44 ms 15968 KB Output is correct
25 Correct 42 ms 16060 KB Output is correct
26 Correct 47 ms 15992 KB Output is correct
27 Correct 45 ms 15936 KB Output is correct
28 Correct 29 ms 12024 KB Output is correct