結果
問題 | No.1935 Water Simulation |
ユーザー | tokusakurai |
提出日時 | 2022-05-13 21:48:19 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 19 ms / 2,000 ms |
コード長 | 3,707 bytes |
コンパイル時間 | 2,304 ms |
コンパイル使用メモリ | 206,996 KB |
最終ジャッジ日時 | 2025-01-29 06:49:41 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 29 |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < n; i++) #define rep2(i, x, n) for (int i = x; i <= n; i++) #define rep3(i, x, n) for (int i = x; i >= n; i--) #define each(e, v) for (auto &e : v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template <typename T> int flg(T x, int i) { return (x >> i) & 1; } template <typename T> void print(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template <typename T> void printn(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template <typename T> int lb(const vector<T> &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template <typename T> int ub(const vector<T> &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template <typename T> void rearrange(vector<T> &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template <typename T> vector<int> id_sort(const vector<T> &v, bool greater = false) { int n = v.size(); vector<int> ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template <typename S, typename T> pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first + q.first, p.second + q.second); } template <typename S, typename T> pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first - q.first, p.second - q.second); } template <typename S, typename T> istream &operator>>(istream &is, pair<S, T> &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template <typename S, typename T> ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; const int inf = (1 << 30) - 1; const ll INF = (1LL << 60) - 1; const int MOD = 1000000007; // const int MOD = 998244353; map<pll, ll> mp; vector<ll> a(4); ll N; ll to_i(const vector<ll> &v) { ll ret = 0; rep(i, 4) { ret *= 101; ret += v[i]; } return ret; } vector<ll> to_v(ll x) { vector<ll> ret(4); rep(i, 4) { ret[i] = x % 101; x /= 101; } reverse(all(ret)); return ret; } void dfs(ll x, ll t) { vector<ll> v = to_v(x); if (t == N) { print(v); return; } ll p = t % 4; if (mp.count(pii(x, p))) { ll s = mp[pii(x, p)]; ll k = (N - s) % (t - s); each(e, mp) { if (e.second == s + k) { print(to_v(e.first.first)); return; } } } mp[pll(x, p)] = t; { ll i = t % 4; ll j = (i + 1) % 4; ll f = min(v[i], a[j] - v[j]); v[i] -= f, v[j] += f; } // print(v); dfs(to_i(v), t + 1); } int main() { rep(i, 4) cin >> a[i]; cin >> N; vector<ll> v(4, 0); v[0] = a[0]; dfs(to_i(v), 0); }