oj.uz

Submission #44194

# Submission time Handle Problem Language Result Execution time Memory
44194 2018-03-30T13:05:57 Z igzi Kangaroo (CEOI16_kangaroo) C++17
51 / 100
 371 ms 259104 KB 
#include <bits/stdc++.h>
#define mod 1000000007
#define maxN 202

using namespace std;

long long dp[2][maxN][maxN][maxN],a[2][maxN][maxN],n,i,j,k,s,e,x;

int main()
{
    cin>>n>>s>>e;
    dp[0][1][1][1]=dp[1][1][1][1]=1;
    a[0][1][1]=a[1][1][1]=1;
    for(i=2;i<=n;i++){
        for(j=1;j<=i;j++){
            for(k=1;k<=i;k++){
                if(j==k) {dp[0][j][k][i]=dp[1][j][k][i]=0; continue;}
                if(j<k) x=k-1;
                else x=k;
                dp[0][j][k][i]=a[1][j][x];
                dp[0][j][k][i]%=mod;
                dp[1][j][k][i]=a[0][j-1][x];
                dp[1][j][k][i]%=mod;
                //if(i==2 && j==2 && k==1) cout<<dp[1][j][k][i]<<endl;
                //if(i==3) cout<<a[1][1][1]<<" "<<dp[1][1][2][2]<<" "<<dp[1][2][1][2]<<endl;
            }
        }
        for(j=1;j<=i;j++){
            a[0][0][j]=a[1][i+1][j]=0;
            for(k=1;k<=i;k++){
                a[0][k][j]=a[0][k-1][j]+dp[0][k][j][i];
                a[0][k][j]%=mod;
            }
            for(k=i;k>0;k--){
                a[1][k][j]=a[1][k+1][j]+dp[1][k][j][i];
                a[1][k][j]%=mod;
            }
        }
    }
    cout<<(dp[0][s][e][n]+dp[1][s][e][n])%mod<<endl;
    return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 616 KB Output is correct
3 Correct 3 ms 2904 KB Output is correct
4 Correct 5 ms 6092 KB Output is correct
5 Correct 6 ms 6092 KB Output is correct
6 Correct 6 ms 6092 KB Output is correct
7 Correct 5 ms 6092 KB Output is correct
8 Correct 5 ms 6092 KB Output is correct
9 Correct 6 ms 6092 KB Output is correct
10 Correct 6 ms 6092 KB Output is correct
11 Correct 6 ms 6092 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 616 KB Output is correct
3 Correct 3 ms 2904 KB Output is correct
4 Correct 5 ms 6092 KB Output is correct
5 Correct 6 ms 6092 KB Output is correct
6 Correct 6 ms 6092 KB Output is correct
7 Correct 5 ms 6092 KB Output is correct
8 Correct 5 ms 6092 KB Output is correct
9 Correct 6 ms 6092 KB Output is correct
10 Correct 6 ms 6092 KB Output is correct
11 Correct 6 ms 6092 KB Output is correct
12 Correct 205 ms 127848 KB Output is correct
13 Correct 180 ms 127848 KB Output is correct
14 Correct 202 ms 127888 KB Output is correct
15 Correct 226 ms 129124 KB Output is correct
16 Correct 250 ms 129124 KB Output is correct
17 Correct 309 ms 129124 KB Output is correct
18 Correct 187 ms 129124 KB Output is correct
19 Correct 244 ms 129124 KB Output is correct
20 Correct 245 ms 129124 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 616 KB Output is correct
3 Correct 3 ms 2904 KB Output is correct
4 Correct 5 ms 6092 KB Output is correct
5 Correct 6 ms 6092 KB Output is correct
6 Correct 6 ms 6092 KB Output is correct
7 Correct 5 ms 6092 KB Output is correct
8 Correct 5 ms 6092 KB Output is correct
9 Correct 6 ms 6092 KB Output is correct
10 Correct 6 ms 6092 KB Output is correct
11 Correct 6 ms 6092 KB Output is correct
12 Correct 205 ms 127848 KB Output is correct
13 Correct 180 ms 127848 KB Output is correct
14 Correct 202 ms 127888 KB Output is correct
15 Correct 226 ms 129124 KB Output is correct
16 Correct 250 ms 129124 KB Output is correct
17 Correct 309 ms 129124 KB Output is correct
18 Correct 187 ms 129124 KB Output is correct
19 Correct 244 ms 129124 KB Output is correct
20 Correct 245 ms 129124 KB Output is correct
21 Runtime error 371 ms 259104 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -