oj.uz

Submission #329655

# Submission time Handle Problem Language Result Execution time Memory
329655 2020-11-21T22:14:27 Z VROOM_VARUN Tents (JOI18_tents) C++14
100 / 100
 86 ms 70892 KB 
/*
ID: varunra2
LANG: C++
TASK: tents
*/

#include <bits/stdc++.h>
using namespace std;

#define int long long

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

int32_t main() {
// #ifndef ONLINE_JUDGE
  // freopen("tents.in", "r", stdin);
  // freopen("tents.out", "w", stdout);
// #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  int n, m;

  cin >> n >> m;

  VVI dp(n + 1, VI(m + 1, 1));

  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      dp[i][j] = dp[i - 1][j];
      if (j >= 2) {
        dp[i][j] += dp[i - 1][j - 2] * (j * (j - 1)) / 2;
      }
      if (i >= 2) dp[i][j] += dp[i - 2][j - 1] * j * (i - 1);
      dp[i][j] += 4 * j * dp[i - 1][j - 1];
      dp[i][j] %= MOD;
    }
  }

  cout << dp[n][m] - 1 << '\n';

  return 0;
}

Subtask #1
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 1004 KB Output is correct

Subtask #2
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 1004 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 53 ms 44268 KB Output is correct
16 Correct 4 ms 3180 KB Output is correct
17 Correct 13 ms 10092 KB Output is correct
18 Correct 16 ms 12524 KB Output is correct
19 Correct 64 ms 51564 KB Output is correct
20 Correct 50 ms 41324 KB Output is correct
21 Correct 33 ms 27264 KB Output is correct
22 Correct 33 ms 26860 KB Output is correct
23 Correct 19 ms 15084 KB Output is correct
24 Correct 86 ms 70892 KB Output is correct
25 Correct 64 ms 52716 KB Output is correct
26 Correct 73 ms 60396 KB Output is correct
27 Correct 82 ms 68204 KB Output is correct