#1046187 (C++23) No.5021 Addition Pyramid

• 問題: No.5021 Addition Pyramid
• ユーザー: てんぷら
• 提出日時: 2025-02-25 22:12:06
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 1,670 ms / 2,000 ms
• コード長: 6,782 bytes
• コンパイル時間: 7,353 ms
• コンパイル使用メモリ: 335,788 KB
• 実行使用メモリ: 6,932 KB
• スコア: 262,170,339
• 最終ジャッジ日時: 2025-02-25 22:13:39
• 合計ジャッジ時間: 79,061 ms
• ジャッジサーバーID （参考情報）: judge5 / judge7

ファイルパターン	結果
other	AC * 50

ソースコード

#include <atcoder/all>
#include <bits/stdc++.h>
using ll = long long;
using ull = unsigned long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
using namespace std;
using namespace atcoder;
using mint = modint998244353;
const int inf = 1000000007;
const ll longinf = 1ll << 60;

struct Timer {
    chrono::system_clock::time_point start, last_updated;

    Timer() {
        start = chrono::system_clock::now();
        last_updated = chrono::system_clock::now();
    }

    void reset() {
        start = chrono::system_clock::now();
    }

    void update() {
        last_updated = chrono::system_clock::now();
    }

    double getTime() {
        auto now = chrono::system_clock::now();
        return chrono::duration<double>(now - start).count();
    }
};

Timer timer;
struct Xor128 {
    unsigned x, y, z, w;

    Xor128() : x(123456789), y(362436069), z(521288629), w(88675123){};

    inline unsigned xor128() {
        unsigned t;
        t = x ^ (x << 11);
        x = y;
        y = z;
        z = w;
        return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
    }

    int nextInt(int x, int y) {
        return xor128() % (y - x) + x;
    }

    double nextDouble(double a, double b) {
        return (double)(xor128() & 0xffff) / 0xffff * (b - a) + a;
    }
};
auto rnd = Xor128();

const int N = 50;
const int mod = 100000000;
int a[N][N];

inline int calc_diff(int x, int y) {
    int diff = abs(x - y);
    return min(diff, mod - diff);
}

vector<vector<int>> create_next_row(vector<int> &prv, int diff, int cnt) {
    int m = prv.size();
    int s = 0;
    vector<pair<int, int>> segs;
    rep(i, m + 1) {
        if(i % 2 == 0) {
            // a-diff <=  x + s <= a + diff
            // a - s - diff <= x <= a - s + diff
            int l = a[m][i] - s - diff;
            int r = a[m][i] - s + diff;
            while(l < 0) {
                l += mod;
                r += mod;
            }
            if(r < mod) {
                segs.push_back({l, 1});
                segs.push_back({r + 1, -1});
            } else {
                segs.push_back({l, 1});
                segs.push_back({mod, -1});
                segs.push_back({0, 1});
                segs.push_back({r + 1 - mod, -1});
            }
        } else {
            // a-diff <=  -x + s <= a + diff
            // a - s - diff <= -x <= a - s + diff
            // s - a - diff <= x <= a - s - diff;
            int l = s - a[m][i] - diff;
            int r = s - a[m][i] + diff;
            while(l < 0) {
                l += mod;
                r += mod;
            }
            if(r < mod) {
                segs.push_back({l, 1});
                segs.push_back({r + 1, -1});
            } else {
                segs.push_back({l, 1});
                segs.push_back({mod, -1});
                segs.push_back({0, 1});
                segs.push_back({r + 1 - mod, -1});
            }
        }
        if(i != m) {
            s = (mod + prv[i] - s) % mod;
        }
    }
    sort(segs.begin(), segs.end());
    int c = 0;
    vector<pair<int, int>> valids;
    int len = 0;
    for(auto [v, sgn] : segs) {
        c += sgn;
        if(sgn == 1 && c == m + 1) {
            valids.push_back({v, -1});
            len -= v;
        }
        if(sgn == -1 && c == m) {
            valids.back().second = v;
            len += v;
        }
    }
    if(len == 0) {
        return vector<vector<int>>();
    } else {
        cnt = min(cnt, len);
        vector<vector<int>> rets;
        rep(_, cnt) {
            int s = 0;
            vector<int> ret(m + 1);
            int target_seg = 0;
            auto [l, r] = valids[target_seg];
            int target = rnd.nextInt(l, r);
            rep(i, m + 1) {
                if(i % 2 == 0) {
                    ret[i] = (target + s) % mod;
                } else {
                    ret[i] = (mod - target + s) % mod;
                }
                if(i != m) {
                    s = (mod + prv[i] - s) % mod;
                }
            }
            rets.push_back(ret);
        }
        return rets;
    }
}

void input() {
    int _;
    cin >> _;
    rep(i, N) {
        rep(j, i + 1) cin >> a[i][j];
    }
}

int evaluate(vector<int> &c) {
    vector<vector<int>> ans(N, vector(N, 0));
    rep(i, N) ans[N - 1][i] = c[i];
    int max_diff = 0;
    for(int i = N - 2; i >= 0; i--) {
        for(int j = 0; j <= i; j++) {
            ans[i][j] = (ans[i + 1][j] + ans[i + 1][j + 1]) % mod;
            int diff = abs(ans[i][j] - a[i][j]);
            max_diff = max(max_diff, min(diff, mod - diff));
        }
    }
    return max_diff;
}

void output(vector<int> &c) {
    rep(i, N) cout << c[i] << " \n"[i + 1 == N];
    cerr << evaluate(c) << endl;
}

const int BW = 500;
const int NS = 20;

struct State {
    int score;
    vector<int> a;
    State(vector<int> &a, int score) : score(score), a(a) {}
    State() : score(0), a(0) {}
    bool operator<(const State &other) const {
        return score < other.score;
    }
    bool operator>(const State &other) const {
        return score > other.score;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    input();
    vector<State> states;
    rep(i, BW) {
        vector<int> v = {rnd.nextInt(0, mod)};
        states.push_back(State(v, calc_diff(v[0], a[0][0])));
    }
    rep(turn, N - 1) {
        nth_element(states.begin(), states.begin() + BW, states.end());
        states.resize(BW);
        vector<State> nstates;
        for(auto &state : states) {
            // cerr << state.score << " ";
            auto nxts = create_next_row(state.a, state.score, NS);
            if(nxts.size() >= NS) {
                for(auto ns : nxts) {
                    nstates.push_back(State(ns, state.score));
                }
            } else {
                int ng = state.score, ok = 50'000'000;
                // 誤差1000くらいまでいければよしとする
                while(ok - ng > 1000) {
                    int mid = (ok + ng) / 2;
                    auto ret = create_next_row(state.a, mid, NS);
                    if(ret.size() >= NS) {
                        ok = mid;
                    } else {
                        ng = mid;
                    }
                }
                auto nxts = create_next_row(state.a, ok, NS);
                for(auto ns : nxts) {
                    nstates.push_back(State(ns, ok));
                }
            }
        }
        states.swap(nstates);
        // cerr << endl;
    }
    nth_element(states.begin(), states.begin() + 1, states.end());
    cerr << states[0].score << endl;
    cerr << states[0].a.size() << endl;
    output(states[0].a);
    return 0;
}