Submission #114741

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
114741	2019-06-02T13:21:44 Z	PeppaPig	Tents (JOI18_tents)	C++14	100 / 100	158 ms	70904 KB

tents

#include <bits/stdc++.h>

#define long long long

using namespace std;

const int N = 3e3+5;
const int M = 1e9+7;

int n, m;
long dp[N][N];

int main() {
    scanf("%d %d", &n, &m);
    for(int i = 0; i <= n; i++) for(int j = 0; j <= m; j++) {
        if(i == 0 || j == 0) dp[i][j] = 1;
        else {
            dp[i][j] = (dp[i][j] + dp[i - 1][j]) % M;
            dp[i][j] = (dp[i][j] + 4ll * j * dp[i - 1][j - 1]) % M;
            if(j > 1) dp[i][j] = (dp[i][j] + 1ll * (1ll * j * (j - 1) / 2) * dp[i - 1][j - 2]) % M;
            if(i > 1) dp[i][j] = (dp[i][j] + 1ll * j * (i - 1) * dp[i - 2][j - 1]) % M;
        }
    }
    printf("%lld\n", dp[n][m] - 1);

    return 0;
}

Compilation message

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

Subtask #1

48.0 / 48.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	512 KB	Output is correct
4	Correct	2 ms	1152 KB	Output is correct
5	Correct	2 ms	640 KB	Output is correct
6	Correct	3 ms	1408 KB	Output is correct
7	Correct	3 ms	896 KB	Output is correct
8	Correct	3 ms	1408 KB	Output is correct
9	Correct	2 ms	768 KB	Output is correct
10	Correct	3 ms	1792 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	5 ms	2304 KB	Output is correct

Subtask #2

52.0 / 52.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	512 KB	Output is correct
4	Correct	2 ms	1152 KB	Output is correct
5	Correct	2 ms	640 KB	Output is correct
6	Correct	3 ms	1408 KB	Output is correct
7	Correct	3 ms	896 KB	Output is correct
8	Correct	3 ms	1408 KB	Output is correct
9	Correct	2 ms	768 KB	Output is correct
10	Correct	3 ms	1792 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	5 ms	2304 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	8 ms	9728 KB	Output is correct
15	Correct	106 ms	55240 KB	Output is correct
16	Correct	9 ms	4096 KB	Output is correct
17	Correct	25 ms	12792 KB	Output is correct
18	Correct	31 ms	17144 KB	Output is correct
19	Correct	122 ms	62952 KB	Output is correct
20	Correct	103 ms	51064 KB	Output is correct
21	Correct	68 ms	33784 KB	Output is correct
22	Correct	70 ms	35448 KB	Output is correct
23	Correct	45 ms	27128 KB	Output is correct
24	Correct	158 ms	70904 KB	Output is correct
25	Correct	128 ms	61304 KB	Output is correct
26	Correct	146 ms	66640 KB	Output is correct
27	Correct	153 ms	68984 KB	Output is correct