oj.uz

Submission #399612

# Submission time Handle Problem Language Result Execution time Memory
399612 2021-05-06T09:45:52 Z KienTranluvChaeng Kangaroo (CEOI16_kangaroo) C++17
100 / 100
 53 ms 31708 KB 
#include <bits/stdc++.h>
#define int long long
#define mod 1000000007

using namespace std;

void Add(int &x, int y){
    x += y; x %= mod;
}

main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n, cs, cf; cin >> n >> cs >> cf;
    vector <int> f[n + 2];
    for (int i = 1; i <= n; ++ i) f[i].resize(n + 2);
    f[1][0] = 1;
    for (int i = 1; i < n; ++ i){
        for (int j = 0; j <= i; ++ j){
            if (i == cs || i == cf){
                Add(f[i + 1][j], f[i][j]);
                if (j) Add(f[i + 1][j - 1], f[i][j] * j);
                continue;
            }
            Add(f[i + 1][j + 1], f[i][j]);
            if (j) Add(f[i + 1][j - 1], f[i][j] * j % mod * (j - 1) % mod);
            if (i > cs && j) Add(f[i + 1][j - 1], j * f[i][j]);
            if (i > cf && j) Add(f[i + 1][j - 1], j * f[i][j]);
        }
    }
    cout << f[n][0];
}

Compilation message

kangaroo.cpp:11:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   11 | main(){
      |      ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory 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

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

Subtask #3
15.0 / 15.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 2 ms 572 KB Output is correct
16 Correct 2 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 2 ms 588 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 7 ms 3660 KB Output is correct
22 Correct 8 ms 4184 KB Output is correct
23 Correct 9 ms 4684 KB Output is correct
24 Correct 49 ms 31692 KB Output is correct
25 Correct 50 ms 31692 KB Output is correct
26 Correct 50 ms 31708 KB Output is correct
27 Correct 53 ms 31416 KB Output is correct
28 Correct 32 ms 17892 KB Output is correct