Submission #814458

#	Time	Username	Problem	Language	Result	Execution time	Memory
814458		arush_agu	Kangaroo (CEOI16_kangaroo)	C++17	100 / 100	24 ms	31792 KiB

kangaroo

#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;

// Saw Solution
// Also see: https://codeforces.com/blog/entry/47764 Connected Component DP
// Also see: https://codeforces.com/blog/entry/92602 Connected Component DP

void solve() {
  int n, a, b;
  cin >> n >> a >> b;

  if (a > b)
    swap(a, b);

  vvl dp(n + 2, vl(n + 2));
  dp[1][1] = 1;

  for (int i = 2; i <= n; i++)
    for (int comp = 1; comp <= n; comp++) {
      if (i == a || i == b)
        dp[i][comp] = (dp[i - 1][comp - 1] + dp[i - 1][comp]) % MOD;
      else if (i < a)
        dp[i][comp] =
            (comp * dp[i - 1][comp - 1] + comp * dp[i - 1][comp + 1]) % MOD;
      else if (a < i && i < b)
        dp[i][comp] =
            ((comp - 1) * dp[i - 1][comp - 1] + comp * dp[i - 1][comp + 1]) %
            MOD;
      else
        dp[i][comp] = (max(0, (comp - 2)) * dp[i - 1][comp - 1] +
                       comp * dp[i - 1][comp + 1]) %
                      MOD;
    }
  cout << dp[n][1] << "\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 (stderr)

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

• Subtask 1: 6 / 6
• Subtask 2: 30 / 30
• Subtask 3: 15 / 15
• Subtask 4: 49 / 49