oj.uz

Submission #506237

# Submission time Handle Problem Language Result Execution time Memory
506237 2022-01-11T23:11:22 Z rodov Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 16 ms 24036 KB 
#include <bits/stdc++.h>

using namespace std;
long long n,s,f,k;
long long d[5007][5007];
const long long MOD = 1000000007;
int main() {
    cin >> n >> s >> f;
    d[1][1] = 1;
    for(int i=2; i<=n; i++)
        for(int j=1; j<=i; j++) {
            if(i==s || i==f) d[i][j] = (d[i-1][j-1]+d[i-1][j])%MOD;
            else {
                k = j;
                if(i>s) k--;
                if(i>f) k--;
                if(k<0) k = 0;
                d[i][j] = (d[i-1][j+1]*j + d[i-1][j-1]*k) % MOD;
            }
        }
    cout << d[n][1] << endl;

    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 0 ms 460 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Correct 1 ms 1228 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1228 KB Output is correct
15 Correct 1 ms 1228 KB Output is correct
16 Correct 1 ms 1228 KB Output is correct
17 Correct 1 ms 1228 KB Output is correct
18 Correct 1 ms 1100 KB Output is correct
19 Correct 1 ms 1160 KB Output is correct
20 Correct 1 ms 1228 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Correct 1 ms 1228 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1228 KB Output is correct
15 Correct 1 ms 1228 KB Output is correct
16 Correct 1 ms 1228 KB Output is correct
17 Correct 1 ms 1228 KB Output is correct
18 Correct 1 ms 1100 KB Output is correct
19 Correct 1 ms 1160 KB Output is correct
20 Correct 1 ms 1228 KB Output is correct
21 Correct 2 ms 4556 KB Output is correct
22 Correct 4 ms 4940 KB Output is correct
23 Correct 3 ms 5580 KB Output is correct
24 Correct 14 ms 24012 KB Output is correct
25 Correct 16 ms 24004 KB Output is correct
26 Correct 16 ms 24036 KB Output is correct
27 Correct 15 ms 23848 KB Output is correct
28 Correct 9 ms 15052 KB Output is correct