結果

問題 No.1935 Water Simulation
ユーザー stoqstoq
提出日時 2022-05-13 22:03:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 312 ms / 2,000 ms
コード長 6,767 bytes
コンパイル時間 4,850 ms
コンパイル使用メモリ 271,360 KB
実行使用メモリ 398,976 KB
最終ジャッジ日時 2024-07-22 04:35:04
合計ジャッジ時間 9,679 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 78 ms
97,152 KB
testcase_01 AC 80 ms
97,152 KB
testcase_02 AC 15 ms
11,776 KB
testcase_03 AC 194 ms
238,976 KB
testcase_04 AC 79 ms
92,928 KB
testcase_05 AC 276 ms
314,112 KB
testcase_06 AC 235 ms
298,496 KB
testcase_07 AC 148 ms
196,096 KB
testcase_08 AC 183 ms
211,712 KB
testcase_09 AC 256 ms
313,728 KB
testcase_10 AC 212 ms
271,616 KB
testcase_11 AC 117 ms
144,640 KB
testcase_12 AC 18 ms
14,592 KB
testcase_13 AC 16 ms
13,440 KB
testcase_14 AC 90 ms
87,552 KB
testcase_15 AC 120 ms
143,616 KB
testcase_16 AC 196 ms
240,128 KB
testcase_17 AC 124 ms
151,936 KB
testcase_18 AC 15 ms
11,008 KB
testcase_19 AC 191 ms
240,256 KB
testcase_20 AC 32 ms
32,640 KB
testcase_21 AC 201 ms
257,792 KB
testcase_22 AC 97 ms
117,504 KB
testcase_23 AC 86 ms
83,968 KB
testcase_24 AC 312 ms
398,976 KB
testcase_25 AC 151 ms
196,352 KB
testcase_26 AC 24 ms
25,088 KB
testcase_27 AC 112 ms
129,920 KB
testcase_28 AC 88 ms
98,048 KB
testcase_29 AC 13 ms
9,216 KB
testcase_30 AC 18 ms
16,384 KB
testcase_31 AC 58 ms
65,152 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 2

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

#include <atcoder/all>
//#include <atcoder/lazysegtree>
//#include <atcoder/modint>
//#include <atcoder/segtree>

using namespace atcoder;

#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#pragma region Macros

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif

using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
const double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())

struct io_init {
  io_init() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll floor(ll a, ll b) {
  if (b < 0) a *= -1, b *= -1;
  if (a >= 0) return a / b;
  return -((-a + b - 1) / b);
}
inline ll ceil(ll a, ll b) { return floor(a + b - 1, b); }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}
ostream &operator<<(ostream &os, modint m) {
  os << m.val();
  return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++) is >> v[i];
  return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++)
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  return os;
}
template <typename T>
constexpr void operator--(vector<T> &v, int) noexcept {
  for (int i = 0; i < v.size(); i++) v[i]--;
}

random_device seed_gen;
mt19937_64 engine(seed_gen());

struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};

BiCoef bc(300010);

#pragma endregion

// -------------------------------

int dba[60][101][101][101];
int dbb[60][101][101][101];
int dbc[60][101][101][101];

void solve() {
  int v[4];
  rep(i, 4) cin >> v[i];
  ll n;
  cin >> n;
  int a, b, c, d;
  repi(i, v[0] + 1) repi(j, v[1] + 1) repi(k, v[2] + 1) {
    d = v[0] - i - j - k;
    if (d < 0) continue;
    a = i, b = j, c = k;

    b += a, a = 0;
    if (b > v[1]) a = b - v[1], b = v[1];

    c += b, b = 0;
    if (c > v[2]) b = c - v[2], c = v[2];

    d += c, c = 0;
    if (d > v[3]) c = d - v[3], d = v[3];

    a += d, d = 0;
    if (a > v[0]) d = a - v[0], a = v[0];

    dba[0][i][j][k] = a;
    dbb[0][i][j][k] = b;
    dbc[0][i][j][k] = c;
  }
  rep(d, 60 - 1) repi(i, v[0] + 1) repi(j, v[1] + 1) repi(k, v[2] + 1) {
    if (v[0] - i - j - k < 0) continue;
    a = dba[d][i][j][k];
    b = dbb[d][i][j][k];
    c = dbc[d][i][j][k];
    dba[d + 1][i][j][k] = dba[d][a][b][c];
    dbb[d + 1][i][j][k] = dbb[d][a][b][c];
    dbc[d + 1][i][j][k] = dbc[d][a][b][c];
  }

  ll q = n / 4, r = n % 4;
  a = v[0], b = c = d = 0;
  int a_, b_, c_;
  rep(k, 60) {
    if (not((1LL << k) & q)) continue;
    a_ = dba[k][a][b][c];
    b_ = dbb[k][a][b][c];
    c_ = dbc[k][a][b][c];
    a = a_, b = b_, c = c_;
  }
  d = v[0] - a - b - c;
  auto f = [&](ll &t) {
    if (t == 0) {
      cout << a << " " << b << " " << c << " " << d << "\n";
      exit(0);
    }
    t--;
  };
  f(r);
  b += a, a = 0;
  if (b > v[1]) a = b - v[1], b = v[1];
  f(r);
  c += b, b = 0;
  if (c > v[2]) b = c - v[2], c = v[2];
  f(r);
  d += c, c = 0;
  if (d > v[3]) c = d - v[3], d = v[3];
  f(r);
  assert(0);
}

int main() { solve(); }
0