#876008 (C++17) No.1154 シュークリームゲーム（Hard）

提出ソース

結果

問題	No.1154 シュークリームゲーム（Hard）
ユーザー	heno239
提出日時	2023-05-30 14:31:20
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	25 ms / 2,000 ms
コード長	10,264 bytes
コンパイル時間	2,884 ms
コンパイル使用メモリ	179,944 KB
実行使用メモリ	12,288 KB
最終ジャッジ日時	2024-06-08 20:10:52
合計ジャッジ時間	4,695 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	10 ms 11,776 KB
testcase_01	AC	10 ms 11,776 KB
testcase_02	AC	11 ms 11,648 KB
testcase_03	AC	10 ms 11,776 KB
testcase_04	AC	10 ms 11,648 KB
testcase_05	AC	11 ms 11,776 KB
testcase_06	AC	10 ms 11,776 KB
testcase_07	AC	11 ms 11,776 KB
testcase_08	AC	10 ms 11,648 KB
testcase_09	AC	10 ms 11,648 KB
testcase_10	AC	10 ms 11,776 KB
testcase_11	AC	10 ms 11,776 KB
testcase_12	AC	10 ms 11,776 KB
testcase_13	AC	11 ms 11,776 KB
testcase_14	AC	10 ms 11,648 KB
testcase_15	AC	10 ms 11,776 KB
testcase_16	AC	10 ms 11,776 KB
testcase_17	AC	11 ms 11,904 KB
testcase_18	AC	10 ms 11,904 KB
testcase_19	AC	11 ms 12,032 KB
testcase_20	AC	11 ms 11,776 KB
testcase_21	AC	12 ms 11,904 KB
testcase_22	AC	10 ms 11,904 KB
testcase_23	AC	11 ms 11,904 KB
testcase_24	AC	11 ms 11,904 KB
testcase_25	AC	11 ms 11,904 KB
testcase_26	AC	11 ms 11,904 KB
testcase_27	AC	11 ms 11,776 KB
testcase_28	AC	11 ms 11,776 KB
testcase_29	AC	11 ms 11,776 KB
testcase_30	AC	10 ms 11,904 KB
testcase_31	AC	11 ms 11,904 KB
testcase_32	AC	12 ms 11,648 KB
testcase_33	AC	12 ms 12,160 KB
testcase_34	AC	12 ms 12,288 KB
testcase_35	AC	11 ms 12,160 KB
testcase_36	AC	17 ms 12,288 KB
testcase_37	AC	17 ms 12,032 KB
testcase_38	AC	10 ms 11,776 KB
testcase_39	AC	11 ms 11,776 KB
testcase_40	AC	25 ms 12,160 KB
testcase_41	AC	11 ms 11,904 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = long double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
    a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
    a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
    vector<T> res;
    int ida = 0, idb = 0;
    while (ida < a.size() || idb < b.size()) {
        if (idb == b.size()) {
            res.push_back(a[ida]); ida++;
        }
        else if (ida == a.size()) {
            res.push_back(b[idb]); idb++;
        }
        else {
            if (a[ida] < b[idb]) {
                res.push_back(a[ida]); ida++;
            }
            else {
                res.push_back(b[idb]); idb++;
            }
        }
    }
    return res;
}
template<typename T>
void cinarray(vector<T>& v) {
    rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
    rep(i, v.size()) {
        if (i > 0)cout << " "; cout << v[i];
    }
    cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
    if (n < 0) {
        ll res = mod_pow(x, -n, m);
        return mod_pow(res, m - 2, m);
    }
    if (abs(x) >= m)x %= m;
    if (x < 0)x += m;
    //if (x == 0)return 0;
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
//mod should be <2^31
struct modint {
    int n;
    modint() :n(0) { ; }
    modint(ll m) {
        if (m < 0 || mod <= m) {
            m %= mod; if (m < 0)m += mod;
        }
        n = m;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
    a = abs(a); b = abs(b);
    if (a < b)swap(a, b);
    while (b) {
        ll r = a % b; a = b; b = r;
    }
    return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
    if (loc >= v.size())v.resize(loc + 1, 0);
    v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
    fill(isp + 2, isp + mn, true);
    for (int i = 2; i < mn; i++) {
        if (!isp[i])continue;
        ps.push_back(i);
        for (int j = 2 * i; j < mn; j += i) {
            isp[j] = false;
        }
    }
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    if (res == st.begin())return st.end();
    res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
    return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
    a = a + b; return a;
}
mP operator-(mP a, mP b) {
    return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
    a = a - b; return a;
}
LP operator+(LP a, LP b) {
    return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
    a = a + b; return a;
}
LP operator-(LP a, LP b) {
    return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
    a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//-----------------------------------------
ll calc(vector<ll> v0, vector<ll> v1) {
    sort(all(v0));
    sort(all(v1));
    ll res = 0;
    while (v0.size() && v0.back() >= 0) {
        res += v0.back(); v0.pop_back();
    }
    int id = 0;
    while (v1.size()) {
        if (id == 0)res += v1.back();
        else res -= v1.back();
        v1.pop_back();
        id ^= 1;
    }
    if (id == 0) {
        rep(i, v0.size())res += v0[i];
    }
    else {
        rep(i, v0.size())res -= v0[i];
    }
    return res;
}


ll sol2(int n, vector<int> a, vector<P> ps) {
    vector<int> par(n);
    vector<vector<int>> G(n);
    for (auto p : ps) {
        G[p.first].push_back(p.second);
        G[p.second].push_back(p.first);
    }
    vector<int> ss(n);
    function<void(int, int)> dfs = [&](int id, int fr) {
        par[id] = fr;
        ss[id] = (1 << id);
        for (int to : G[id])if (to != fr) {
            dfs(to, id);
            ss[id] |= (1 << to);
        }
    };
    dfs(0, -1);
    vector<bool> mem(1 << n);
    vector<ll> val(1 << n);
    mem[0] = true; val[0] = 0;
    function<ll(int)> dp = [&](int s)->ll {
        if (mem[s])return val[s];
        mem[s] = true;
        ll res = -INF;
        rep(i, n)if (s & (1 << i)) {
            int ns = s ^ ss[i];
            ll val = a[i] - dp(ns);
            chmax(res, val);
        }
        return val[s] = res;
    };
    ll ans = dp(1);
    return ans;
}


bool isg(LP a, LP b) {
    if (a.second == b.second)return a.first < b.first;
    if (a.second == 0) {
        if (a.first >= 0)return false;
        return true;
    }
    if (b.first >= 0)return true;
    else return false;
}
ll sol(int n, vector<int>a, vector<P> ps) {
    vector<int> par(n);
    vector<vector<int>> G(n);
    for (auto p : ps) {
        G[p.first].push_back(p.second);
        G[p.second].push_back(p.first);
    }
    function<vector<LP>(int, int)> dfs = [&](int id, int fr) {
        vector<LP> res;
        vector<LP> nexs;
        for (int to : G[id])if (to != fr) {
            vector<LP> nex = dfs(to, id);
            for (auto v : nex) {
                nexs.push_back(v);
            }
        }
        sort(all(nexs),isg);
        LP nw = { a[id],1 };
        while (nexs.size() && isg(nw, nexs.back())) {
            LP p = nw;
            LP las = nexs.back(); nexs.pop_back();
            if (p.second)p.first -= las.first;
            else p.first += las.first;
            p.second ^= las.second;
            nw = p;
        }
        res.push_back(nw);
        for (auto v : nexs)res.push_back(v);
        /*cout << "Hello " << id << "\n";
        for (auto p : res) {
            cout << p.first << " " << p.second << "\n";
        }**/
        //coutarray(res);
        return res;
    };
    vector<LP> v = dfs(0, -1);
    sort(all(v), isg);
   /* for (auto p : v) {
        cout << p.first << " " << p.second << "\n";
    }*/
    int col = 0;
    ll ans = 0;
    while (v.size()) {
        LP las = v.back(); v.pop_back();
        if (col)ans -= las.first;
        else ans += las.first;
        col ^= las.second;
    }
    return ans;
}

vector<P> rantree(int n) {
    vector<P> res;
    rep1(i, n - 1) {
        uniform_int_distribution<> ud(0, i - 1);
        int p = ud(mt);
        res.push_back({ p,i });
    }

    return res;
}
void expr() {
    uniform_int_distribution<> ud(0, 10);
    for (int n = 3; n <= 13; n++) {
        rep(_, 1000) {
            vector<int> a(n);
            rep(i, n)a[i] = ud(mt);
            auto ps = rantree(n);
            ll ans = sol(n, a, ps);
            ll ans2 = sol2(n, a, ps);
            if (ans != ans2) {
                cout << n << "\n";
                coutarray(a);
                for (auto p : ps) {
                    cout << p.first << " " << p.second << "\n";
                }
                cout << ans << " " << ans2 << "\n";
                return;
            }
        }
        cout << "fin " << n << "\n";
    }
}
void solve() {
    int n; cin >> n;
    vector<int> a(n);
    rep(i, n)cin >> a[i];
    vector<P> ps;
    rep(i, n - 1) {
        int a, b; cin >> a >> b;
        a--; b--;
        ps.push_back({ a,b });
    }
    ll ans = sol(n, a, ps);
    cout << ans << "\n";
    //cout << sol2(n, a, ps) << "\n";
}





signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed << setprecision(15);
    //init_f();
    //init();
    //while(true)
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード