# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
158706 | Ruxandra985 | Kangaroo (CEOI16_kangaroo) | C++14 | 5 ms | 3576 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <iostream>
#define MOD 1000000007
using namespace std;
int spc[210][210][210] , spd[210][210][210] , c[210][210][210] , d[210][210][210];
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n , cs , cf , len , bgn , ed;
fscanf (fin,"%d%d%d",&n,&cs,&cf);
if (cs > cf)
swap(cs , cf);
c[2][1][2] = d[2][2][1] = 1;
spc[2][1][2] = spd[2][2][1] = spc[2][2][2] = 1;
for (len = 3 ; len <= n ; len++){
for (bgn = 1 ; bgn <= len ; bgn++){
for (ed = 1 ; ed <= len ; ed ++){
if (bgn == ed){
spc[len][bgn][ed] = (spc[len][bgn - 1][ed] + c[len][bgn][ed])%MOD;
spd[len][bgn][ed] = (spd[len][bgn - 1][ed] + d[len][bgn][ed])%MOD;
continue;
}
//if (len == 3 && bgn == 2 && ed == 1)
// printf ("a");
c[len][bgn][ed] = (spd[len-1][len-1][ed - (bgn < ed)] - spd[len-1][bgn-1][ed - (bgn < ed)]) ;
spc[len][bgn][ed] = (spc[len][bgn - 1][ed] + c[len][bgn][ed])%MOD;
d[len][bgn][ed] = spc[len-1][bgn - 1][ed - (bgn < ed)];
spd[len][bgn][ed] = (spd[len][bgn - 1][ed] + d[len][bgn][ed])%MOD;
}
}
}
fprintf (fout,"%d",c[n][cs][cf] + d[n][cs][cf]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |