oj.uz

Submission #558788

# Submission time Handle Problem Language Result Execution time Memory
558788 2022-05-08T10:40:06 Z hibiki Kangaroo (CEOI16_kangaroo) C++11
100 / 100
 51 ms 32016 KB 
#include<bits/stdc++.h>
using namespace std;

#define mod 1000000007

int n,s,t;
long dp[2005][2005];

long solve(int nw,long comp)
{
    if(nw == 0) return 0;
    long &val = dp[nw][comp];
    if(val != -1) return val;
    if(nw == 1) return val = (comp == 1)? 1 : 0;
    if(nw == s || nw == t)
        return val = (solve(nw - 1, comp - 1) + solve(nw - 1, comp)) % mod;
    long del = 0;
    if(nw > s) del++;
    if(nw > t) del++;
    return val = ( comp * solve(nw - 1, comp + 1) + (comp - del) * solve(nw - 1, comp - 1) ) % mod;
}

int main()
{
    memset(dp, -1, sizeof(dp));
    scanf("%d %d %d",&n,&s,&t);
    printf("%ld\n",solve(n,1));
    return 0;
}

Compilation message

kangaroo.cpp: In function 'int main()':
kangaroo.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     scanf("%d %d %d",&n,&s,&t);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31700 KB Output is correct
2 Correct 12 ms 31700 KB Output is correct
3 Correct 13 ms 31700 KB Output is correct
4 Correct 13 ms 31672 KB Output is correct
5 Correct 12 ms 31700 KB Output is correct
6 Correct 12 ms 31768 KB Output is correct
7 Correct 13 ms 31776 KB Output is correct
8 Correct 12 ms 31700 KB Output is correct
9 Correct 13 ms 31700 KB Output is correct
10 Correct 13 ms 31720 KB Output is correct
11 Correct 12 ms 31776 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31700 KB Output is correct
2 Correct 12 ms 31700 KB Output is correct
3 Correct 13 ms 31700 KB Output is correct
4 Correct 13 ms 31672 KB Output is correct
5 Correct 12 ms 31700 KB Output is correct
6 Correct 12 ms 31768 KB Output is correct
7 Correct 13 ms 31776 KB Output is correct
8 Correct 12 ms 31700 KB Output is correct
9 Correct 13 ms 31700 KB Output is correct
10 Correct 13 ms 31720 KB Output is correct
11 Correct 12 ms 31776 KB Output is correct
12 Correct 13 ms 31768 KB Output is correct
13 Correct 13 ms 31716 KB Output is correct
14 Correct 13 ms 31764 KB Output is correct
15 Correct 12 ms 31764 KB Output is correct
16 Correct 13 ms 31692 KB Output is correct
17 Correct 13 ms 31772 KB Output is correct
18 Correct 12 ms 31744 KB Output is correct
19 Correct 14 ms 31664 KB Output is correct
20 Correct 13 ms 31684 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31700 KB Output is correct
2 Correct 12 ms 31700 KB Output is correct
3 Correct 13 ms 31700 KB Output is correct
4 Correct 13 ms 31672 KB Output is correct
5 Correct 12 ms 31700 KB Output is correct
6 Correct 12 ms 31768 KB Output is correct
7 Correct 13 ms 31776 KB Output is correct
8 Correct 12 ms 31700 KB Output is correct
9 Correct 13 ms 31700 KB Output is correct
10 Correct 13 ms 31720 KB Output is correct
11 Correct 12 ms 31776 KB Output is correct
12 Correct 13 ms 31768 KB Output is correct
13 Correct 13 ms 31716 KB Output is correct
14 Correct 13 ms 31764 KB Output is correct
15 Correct 12 ms 31764 KB Output is correct
16 Correct 13 ms 31692 KB Output is correct
17 Correct 13 ms 31772 KB Output is correct
18 Correct 12 ms 31744 KB Output is correct
19 Correct 14 ms 31664 KB Output is correct
20 Correct 13 ms 31684 KB Output is correct
21 Correct 17 ms 31700 KB Output is correct
22 Correct 17 ms 31712 KB Output is correct
23 Correct 18 ms 31772 KB Output is correct
24 Correct 51 ms 31916 KB Output is correct
25 Correct 46 ms 31828 KB Output is correct
26 Correct 49 ms 32016 KB Output is correct
27 Correct 41 ms 31896 KB Output is correct
28 Correct 35 ms 31876 KB Output is correct