oj.uz

Submission #803615

# Submission time Handle Problem Language Result Execution time Memory
803615 2023-08-03T05:07:18 Z arush_agu Tents (JOI18_tents) C++17
100 / 100
 316 ms 71384 KB 
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

void solve() {
  int n, m;
  cin >> n >> m;

  if (n > m)
    swap(n, m);

  vvl dp(n + 1, vl(m + 1, -1));
  function<ll(ll, ll)> f = [&](ll r, ll c) -> ll {
    if (r == 0 || c == 0)
      return 1;
    if (r > n || c > m)
      return 0;

    ll &x = dp[r][c];
    if (x != -1)
      return x;

    x = f(r - 1, c);
    x += 4 * c * f(r - 1, c - 1), x %= MOD;
    if (c > 1)
      x += (c * (c - 1)) / 2 * f(r - 1, c - 2), x %= MOD;
    if (r > 1)
      x += (r - 1) * c * f(r - 2, c - 1), x %= MOD;
    return x;
  };

  cout << (f(n, m) - 1 + MOD) % MOD << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message

tents.cpp: In function 'int main()':
tents.cpp:126:11: warning: unused variable 'start' [-Wunused-variable]
  126 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 0 ms 316 KB Output is correct
12 Correct 3 ms 956 KB Output is correct

Subtask #2
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 0 ms 316 KB Output is correct
12 Correct 3 ms 956 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 160 ms 44508 KB Output is correct
16 Correct 3 ms 3136 KB Output is correct
17 Correct 18 ms 10196 KB Output is correct
18 Correct 40 ms 12628 KB Output is correct
19 Correct 183 ms 51788 KB Output is correct
20 Correct 157 ms 41532 KB Output is correct
21 Correct 94 ms 27492 KB Output is correct
22 Correct 92 ms 27092 KB Output is correct
23 Correct 18 ms 15060 KB Output is correct
24 Correct 316 ms 71384 KB Output is correct
25 Correct 195 ms 53044 KB Output is correct
26 Correct 219 ms 60732 KB Output is correct
27 Correct 308 ms 68620 KB Output is correct