oj.uz

Submission #710467

# Submission time Handle Problem Language Result Execution time Memory
710467 2023-03-15T09:05:12 Z lukameladze Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 43 ms 39612 KB 
# include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
#define pii pair <int, int>
#define pb push_back
const int N = 3005, mod = 1e9 + 7;
int t,n,a[N],dp[N][N],cs,cf;
main() {
    std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>cs>>cf;
    dp[0][0] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == cs || i == cf) {
                dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1]; dp[i][j] %= mod;
            } else {
                dp[i][j] += dp[i - 1][j + 1] * j % mod;
                dp[i][j] += dp[i - 1][j - 1] * (j - (i > cs) - (i > cf)) % mod;
                dp[i][j] %= mod;
            }
        }
    }
    cout<<dp[n][1]<<"\n";
}

Compilation message

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

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 1 ms 468 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 3 ms 1352 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 2 ms 1352 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 1356 KB Output is correct
17 Correct 1 ms 1364 KB Output is correct
18 Correct 2 ms 1236 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 3 ms 1352 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 2 ms 1352 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 1356 KB Output is correct
17 Correct 1 ms 1364 KB Output is correct
18 Correct 2 ms 1236 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct
21 Correct 6 ms 6248 KB Output is correct
22 Correct 7 ms 6984 KB Output is correct
23 Correct 8 ms 7796 KB Output is correct
24 Correct 42 ms 39612 KB Output is correct
25 Correct 43 ms 39596 KB Output is correct
26 Correct 40 ms 39544 KB Output is correct
27 Correct 40 ms 39308 KB Output is correct
28 Correct 26 ms 23784 KB Output is correct