Submission #658479

#	Time	Username	Problem	Language	Result	Execution time	Memory
658479		MilosMilutinovic	Fishing Game (RMI19_fishing)	C++14	0 / 100	2094 ms	524288 KiB

fishing

/**
 *    author:  wxhtzdy
 *    created: 13.11.2022 09:25:04
**/
#include <bits/stdc++.h>

using namespace std;

template <typename T>
T inverse(T a, T m) {
  T u = 0, v = 1;
  while (a != 0) {
    T t = m / a;
    m -= t * a; swap(a, m);
    u -= t * v; swap(u, v);
  }
  assert(m == 1);
  return u;
}
template <typename T>
class Modular {
 public:
  using Type = typename decay<decltype(T::value)>::type;
  constexpr Modular() : value() {}
  template <typename U>
  Modular(const U& x) {
    value = normalize(x);
  }
  template <typename U>
  static Type normalize(const U& x) {
    Type v;
    if (-mod() <= x && x < mod()) v = static_cast<Type>(x);
    else v = static_cast<Type>(x % mod());
    if (v < 0) v += mod();
    return v;
  }
  const Type& operator()() const { return value; }
  template <typename U>
  explicit operator U() const { return static_cast<U>(value); }
  constexpr static Type mod() { return T::value; }
  Modular& operator+=(const Modular& other) { if ((value += other.value) >= mod()) value -= mod(); return *this; }
  Modular& operator-=(const Modular& other) { if ((value -= other.value) < 0) value += mod(); return *this; }
  template <typename U> Modular& operator+=(const U& other) { return *this += Modular(other); }
  template <typename U> Modular& operator-=(const U& other) { return *this -= Modular(other); }
  Modular& operator++() { return *this += 1; }
  Modular& operator--() { return *this -= 1; }
  Modular operator++(int) { Modular result(*this); *this += 1; return result; }
  Modular operator--(int) { Modular result(*this); *this -= 1; return result; }
  Modular operator-() const { return Modular(-value); }
  template <typename U = T>
  typename enable_if<is_same<typename Modular<U>::Type, int>::value, Modular>::type& operator*=(const Modular& rhs) {
#ifdef _WIN32
    uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);
    uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x), d, m;
    asm(
      "divl %4; \n\t"
      : "=a" (d), "=d" (m)
      : "d" (xh), "a" (xl), "r" (mod())
    );
    value = m;
#else
    value = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));
#endif
    return *this;
  }
  template <typename U = T>
  typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value, Modular>::type& operator*=(const Modular& rhs) {
    int64_t q = static_cast<int64_t>(static_cast<long double>(value) * rhs.value / mod());
    value = normalize(value * rhs.value - q * mod());
    return *this;
  }
  template <typename U = T>
  typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type& operator*=(const Modular& rhs) {
    value = normalize(value * rhs.value);
    return *this;
  }
  Modular& operator/=(const Modular& other) { return *this *= Modular(inverse(other.value, mod())); }
  template <typename U>
  friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs);
  template <typename U>
  friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs);
  template <typename U>
  friend std::istream& operator>>(std::istream& stream, Modular<U>& number);
 private:
  Type value;
};
template <typename T> bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value == rhs.value; }
template <typename T, typename U> bool operator==(const Modular<T>& lhs, U rhs) { return lhs == Modular<T>(rhs); }
template <typename T, typename U> bool operator==(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) == rhs; }
template <typename T> bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) { return !(lhs == rhs); }
template <typename T, typename U> bool operator!=(const Modular<T>& lhs, U rhs) { return !(lhs == rhs); }
template <typename T, typename U> bool operator!=(U lhs, const Modular<T>& rhs) { return !(lhs == rhs); }
template <typename T> bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value < rhs.value; }
template <typename T> Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }
template <typename T, typename U> Modular<T> operator+(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) += rhs; }
template <typename T, typename U> Modular<T> operator+(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }
template <typename T> Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }
template <typename T, typename U> Modular<T> operator-(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) -= rhs; }
template <typename T, typename U> Modular<T> operator-(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }
template <typename T> Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }
template <typename T, typename U> Modular<T> operator*(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) *= rhs; }
template <typename T, typename U> Modular<T> operator*(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }
template <typename T> Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }
template <typename T, typename U> Modular<T> operator/(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) /= rhs; }
template <typename T, typename U> Modular<T> operator/(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }
template<typename T, typename U>
Modular<T> power(const Modular<T>& a, const U& b) {
  assert(b >= 0);
  Modular<T> x = a, res = 1;
  U p = b;
  while (p > 0) {
    if (p & 1) res *= x;
    x *= x;
    p >>= 1;
  }
  return res;
}
template <typename T>
string to_string(const Modular<T>& number) {
  return to_string(number());
}
template <typename T>
std::ostream& operator<<(std::ostream& stream, const Modular<T>& number) {
  return stream << number();
}
template <typename T>
std::istream& operator>>(std::istream& stream, Modular<T>& number) {
  typename common_type<typename Modular<T>::Type, int64_t>::type x;
  stream >> x;
  number.value = Modular<T>::normalize(x);
  return stream;
}
/*
using ModType = int;
struct VarMod { static ModType value; };
ModType VarMod::value;
ModType& md = VarMod::value;
using Mint = Modular<VarMod>;
*/
constexpr int md = 1e9 + 7;
using Mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>;

vector<Mint> fact(1, 1);
vector<Mint> inv_fact(1, 1);
 
Mint C(int n, int k) {
  if (k < 0 || k > n) {
    return 0;
  }
  while ((int) fact.size() < n + 1) {
    fact.push_back(fact.back() * (int) fact.size());
    inv_fact.push_back(1 / fact.back());
  }
  return fact[n] * inv_fact[k] * inv_fact[n - k];
}

const int N = 100;

Mint dp[4][3][3 * N][3 * N][3 * N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);  
  int n, tt;
  cin >> n >> tt;
  while (tt--) {
    vector<vector<int>> pp(3 * n);
    for (int i = 0; i < 2 * n; i++) {
      int x;
      cin >> x;
      --x;
      pp[x].push_back(0);  
    }
    for (int i = 0; i < 2 * n; i++) {
      int x;
      cin >> x;
      --x;
      pp[x].push_back(1);  
    }
    for (int i = 0; i < 2 * n; i++) {
      int x;
      cin >> x;
      --x;
      pp[x].push_back(2);  
    }
    int f0 = 0, f1 = 0, f2 = 0;  
    for (int i = 0; i < 3 * n; i++) {
      if (pp[i][0] == 0 && pp[i][1] == 1) {
        f0++;
      }
      if (pp[i][0] == 0 && pp[i][1] == 2) {
        f1++;
      }        
      if (pp[i][0] == 1 && pp[i][1] == 2) {
        f2++;
      }
    }
    if (f0 == 0 && f1 == 0 && f2 == 0) {
      cout << 1 << '\n';
      continue;
    }
    for (int r = 0; r < 3; r++) {
      for (int st = 0; st < 2; st++) { 
        for (int a = 0; a <= 3 * n; a++) {
          for (int b = 0; b <= 3 * n; b++) {
            for (int c = 0; c <= 3 * n; c++) {
              dp[r][st][a][b][c] = 0;
            }
          }
        }
      }
    }
    dp[0][0][f0][f1][f2] = 1;
    Mint ans = 0;                                                                                       
    for (int s_abc = f0 + f1 + f2; s_abc >= 0; s_abc--) {
      for (int r = 0; r < 3; r++) {
        for (int s_ab = s_abc; s_ab >= 0; s_ab--) {
          for (int a = s_ab; a >= 0; a--) {
            int b = s_ab - a;
            int c = s_abc - a - b;
            for (int st = 1; st == 1; st++) {
              if (r == 0) {
                if (a > 0) {
                  dp[r + 1][1][a - 1][b][c] += dp[r][st][a][b][c] * a;
                }
                if (b > 0) {
                  dp[r + 1][st][a][b - 1][c + 1] += dp[r][st][a][b][c] * b;
                }
                if (a + b == 0) {
                  dp[r + 1][st][a][b][c] += dp[r][st][a][b][c];
                }
              } 
              if (r == 1) {
                if (c > 0) {
                  dp[r + 1][1][a][b][c - 1] += dp[r][st][a][b][c] * c;
                }
                if (a > 0) {
                  dp[r][st][a - 1][b + 1][c] += dp[r][st][a][b][c] * a;
                }
                if (a + c == 0) {
                  dp[r + 1][st][a][b][c] += dp[r][st][a][b][c];
                }
              }
              if (r == 2) {
                if (b > 0) {
                  dp[0][0][a][b - 1][c] += dp[r][st][a][b][c] * b;
                }
                if (c > 0 && st == 1) {
                  dp[0][0][a + 1][b][c - 1] += dp[r][st][a][b][c] * c;
                }
                if (b + c == 0 && st == 1) {
                  dp[0][0][a][b][c] += dp[r][st][a][b][c];
                }
              }
              if (r == 0 && st == 0 && a == 0 && b == 0 && c == 0) {
                ans = dp[r][st][a][b][c];
              }
              dp[r][st][a][b][c] = 0;
            }
          }
        }
        for (int s_ab = s_abc; s_ab >= 0; s_ab--) {
          for (int a = s_ab; a >= 0; a--) {
            int b = s_ab - a;
            int c = s_abc - a - b;
            for (int st = 0; st == 0; st++) {
              if (r == 0) {
                if (a > 0) {
                  dp[r + 1][1][a - 1][b][c] += dp[r][st][a][b][c] * a;
                }
                if (b > 0) {
                  dp[r + 1][st][a][b - 1][c + 1] += dp[r][st][a][b][c] * b;
                }
                if (a + b == 0) {
                  dp[r + 1][st][a][b][c] += dp[r][st][a][b][c];
                }
              } 
              if (r == 1) {
                if (c > 0) {
                  dp[r + 1][1][a][b][c - 1] += dp[r][st][a][b][c] * c;
                }
                if (a > 0) {
                  dp[r][st][a - 1][b + 1][c] += dp[r][st][a][b][c] * a;
                }
                if (a + c == 0) {
                  dp[r + 1][st][a][b][c] += dp[r][st][a][b][c];
                }
              }
              if (r == 2) {
                if (b > 0) {
                  dp[0][0][a][b - 1][c] += dp[r][st][a][b][c] * b;
                }
                if (c > 0 && st == 1) {
                  dp[0][0][a + 1][b][c - 1] += dp[r][st][a][b][c] * c;
                }
                if (b + c == 0 && st == 1) {
                  dp[0][0][a][b][c] += dp[r][st][a][b][c];
                }
              }
              if (r == 0 && st == 0 && a == 0 && b == 0 && c == 0) {
                ans = dp[r][st][a][b][c];
              }
              dp[r][st][a][b][c] = 0;
            }
          }
        }
      } 
    }                                    
    cout << ans << '\n';
  }
  return 0;
}         

• Subtask 1: 0 / 100