結果

問題 No.1935 Water Simulation
コンテスト
ユーザー au7777
提出日時 2023-09-30 18:32:07
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
MLE  
実行時間 -
コード長 4,813 bytes
コンパイル時間 4,522 ms
コンパイル使用メモリ 250,816 KB
実行使用メモリ 814,592 KB
最終ジャッジ日時 2024-07-23 12:11:19
合計ジャッジ時間 8,470 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample -- * 3
other MLE * 1 -- * 28
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
using namespace std;
typedef pair<ll, ll> P;
using namespace atcoder;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
#define USE998244353
#ifdef USE998244353
const ll MOD = 998244353;
// const double PI = 3.1415926535897932;
using mint = modint998244353;
#else
const ll MOD = 1000000007;
using mint = modint1000000007;
#endif
const int MAX = 2000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll x, ll y) {
   if (y == 0) return x;
   else if (y > x) {
       return gcd (y, x); 
   }
   else return gcd(x % y, y);
}
ll lcm(ll x, ll y) {
   return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
    // 
    ll m = 0;
    ll M = 3000000001;
    while (M - m > 1) {
        ll now = (M + m) / 2;
        if (now * now <= x) {
            m = now;
        }
        else {
            M = now;
        }
    }
    return m;
}
ll keta(ll num, ll arity) {
    ll ret = 0;
    while (num) {
        num /= arity;
        ret++;
    }
    return ret;
}
ll ceil(ll n, ll m) {
    // n > 0, m > 0
    ll ret = n / m;
    if (n % m) ret++;
    return ret;
}
ll pow_ll(ll x, ll n) {
    if (n == 0) return 1;
    if (n % 2) {
        return pow_ll(x, n - 1) * x;
    }
    else {
        ll tmp = pow_ll(x, n / 2);
        return tmp * tmp;
    }
}
vector<ll> compress(vector<ll>& v) {
    // [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0] 
    vector<ll> u = v;
    sort(u.begin(), u.end());
    u.erase(unique(u.begin(),u.end()),u.end());
    map<ll, ll> mp;
    for (int i = 0; i < u.size(); i++) {
        mp[u[i]] = i;
    }
    for (int i = 0; i < v.size(); i++) {
        v[i] = mp[v[i]];
    }
    return v;
}

vector<ll> Eratosthenes( const ll N )
{
    vector<bool> is_prime( N + 1 );
    for( ll i = 0; i <= N; i++ )
    {
        is_prime[ i ] = true;
    }
    vector<ll> P;
    for( ll i = 2; i <= N; i++ )
    {
        if( is_prime[ i ] )
        {
            for( ll j = 2 * i; j <= N; j += i )
            {
                is_prime[ j ] = false;
            }
            P.emplace_back( i );
        }
    }
    return P;
}

vector<int> nex(const vector<int>& v, vector<int> in) {
    int to1 = min(in[0], v[1] - in[1]);
    in[0] -= to1;
    in[1] += to1;

    int to2 = min(in[1], v[2] - in[2]);
    in[1] -= to2;
    in[2] += to2;

    int to3 = min(in[2], v[3] - in[3]);
    in[2] -= to3;
    in[3] += to3;

    int to0 = min(in[3], v[0] - in[0]);
    in[3] -= to0;
    in[0] += to0;

    return in;
}

vector<vector<vector<vector<vector<int>>>>> ne(101, vector<vector<vector<vector<int>>>>(101, vector<vector<vector<int>>>(101, vector<vector<int>>(61, vector<int>(4)))));
int main() {
    vector<int> v(4);
    for (int i = 0; i < 4; i++) cin >> v[i];
    ll n;
    cin >> n;
    for (int i = 0; i <= v[0]; i++) {
        for (int j = 0; j <= v[0] - i; j++) {
            for (int k = 0; k <= v[0] - i - j; k++) {
                int l = v[0] - i - j - k;
                vector<int> in = {i, j, k, l};
                ne[i][j][k][0] = nex(v, in);
            }
        }
    }
    for (int i = 0; i <= v[0]; i++) {
        for (int j = 0; j <= v[0] - i; j++) {
            for (int k = 0; k <= v[0] - i - j; k++) {
                for (int t = 1; t <= 60; t++) {
                    int ni = ne[i][j][k][t - 1][0];
                    int nj = ne[i][j][k][t - 1][1];
                    int nk = ne[i][j][k][t - 1][2];
                    // if (t == 1) cout << i << ' ' << j << ' ' << k << ' ' << ni << ' ' << nj << ' ' << nk << '\n';
                    ne[i][j][k][t] = ne[ni][nj][nk][t - 1];
                }
            }
        }
    }

    int i = v[0];
    int j = 0;
    int k = 0;
    ll round = n / 4;
    for (ll t = 0; t <= 60; t++) {
        if ((round >> t) & 1) {
            int ni = ne[i][j][k][t][0];
            int nj = ne[i][j][k][t][1];
            int nk = ne[i][j][k][t][2];
            i = ni;
            j = nj;
            k = nk;
        }
    }

    if (n % 4 >= 1) {
        int to1 = min(i, v[1] - j);
        i -= to1;
        j += to1;
    }

    if (n % 4 >= 2) {
        int to2 = min(j, v[2] - k);
        j -= to2;
        k += to2;
    }

    if (n % 4 >= 3) {
        int to3 = min(k, v[3] - (v[0] - i - j - k));
        k -= to3;
    }
    

    cout << i << ' ' << j << ' ' << k << ' ' << v[0] - i - j - k << '\n';
    return 0;
}
0