oj.uz

Submission #69036

# Submission time Handle Problem Language Result Execution time Memory
69036 2018-08-19T14:34:12 Z imeimi2000 Tents (JOI18_tents) C++17
100 / 100
 191 ms 35912 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>

using namespace std;
typedef long long llong;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<llong, llong> pll;

const int mod = 1e9 + 7;
int dp[3001][3001];

void add(int &x, int y) {
    x = (x + y) % mod;
}

int mul(int x, int y) {
    return (llong)x * y % mod;
}

int main() {
    int n, m;
    scanf("%d%d", &n, &m);
    dp[0][m] = 1;
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j <= m; ++j) {
            add(dp[i][j], dp[i - 1][j]);
            if (j < 1) continue;
            add(dp[i][j - 1], mul(dp[i - 1][j], 4 * j));
            if (i < n) add(dp[i + 1][j - 1], mul(dp[i - 1][j], (n - i) * j));
            if (j < 2) continue;
            add(dp[i][j - 2], mul(dp[i - 1][j], j * (j - 1) >> 1));
        }
    }
    int ans = 0;
    for (int i = 0; i < m; ++i) add(ans, dp[n][i]);
    printf("%d\n", ans);
	return 0;
}

Compilation message

tents.cpp: In function 'int main()':
tents.cpp:34: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 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 4 ms 576 KB Output is correct
4 Correct 4 ms 1268 KB Output is correct
5 Correct 4 ms 1268 KB Output is correct
6 Correct 5 ms 1560 KB Output is correct
7 Correct 3 ms 1560 KB Output is correct
8 Correct 5 ms 1792 KB Output is correct
9 Correct 4 ms 1792 KB Output is correct
10 Correct 5 ms 1892 KB Output is correct
11 Correct 2 ms 1892 KB Output is correct
12 Correct 5 ms 2200 KB Output is correct

Subtask #2
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 4 ms 576 KB Output is correct
4 Correct 4 ms 1268 KB Output is correct
5 Correct 4 ms 1268 KB Output is correct
6 Correct 5 ms 1560 KB Output is correct
7 Correct 3 ms 1560 KB Output is correct
8 Correct 5 ms 1792 KB Output is correct
9 Correct 4 ms 1792 KB Output is correct
10 Correct 5 ms 1892 KB Output is correct
11 Correct 2 ms 1892 KB Output is correct
12 Correct 5 ms 2200 KB Output is correct
13 Correct 3 ms 2200 KB Output is correct
14 Correct 14 ms 9888 KB Output is correct
15 Correct 149 ms 33096 KB Output is correct
16 Correct 12 ms 33096 KB Output is correct
17 Correct 33 ms 33096 KB Output is correct
18 Correct 40 ms 33096 KB Output is correct
19 Correct 168 ms 34868 KB Output is correct
20 Correct 134 ms 34868 KB Output is correct
21 Correct 96 ms 34868 KB Output is correct
22 Correct 92 ms 34868 KB Output is correct
23 Correct 60 ms 34868 KB Output is correct
24 Correct 191 ms 35912 KB Output is correct
25 Correct 138 ms 35912 KB Output is correct
26 Correct 181 ms 35912 KB Output is correct
27 Correct 190 ms 35912 KB Output is correct