제출 #937985

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
937985		GrindMachine	봉쇄 시간 (IOI23_closing)	C++17	43 / 100	179 ms	52012 KiB

closing

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/121499

*/

const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "closing.h"

template<typename T>
struct fenwick {
    int siz;
    vector<T> tree;

    fenwick() {

    }

    fenwick(int n) {
        siz = n;
        tree = vector<T>(n + 1);
    }

    int lsb(int x) {
        return x & -x;
    }

    void build(vector<T> &a, int n) {
        for (int i = 1; i <= n; ++i) {
            int par = i + lsb(i);
            tree[i] += a[i];

            if (par <= siz) {
                tree[par] += tree[i];
            }
        }
    }

    void pupd(int i, T v) {
        while (i <= siz) {
            tree[i] += v;
            i += lsb(i);
        }
    }

    T sum(int i) {
        T res = 0;

        while (i) {
            res += tree[i];
            i -= lsb(i);
        }

        return res;
    }

    T query(int l, int r) {
        if (l > r) return 0;
        T res = sum(r) - sum(l - 1);
        return res;
    }
};

vector<pll> adj[N];
ll dis[N][2];

void dfs1(ll u, ll p, ll t){
    for(auto [v,w] : adj[u]){
        if(v == p) conts;
        dis[v][t] = dis[u][t]+w;
        dfs1(v,u,t);
    }
}

vector<bool> on_path(N);
vector<ll> curr_path;

void dfs2(ll u, ll p, ll des){
    curr_path.pb(u);

    if(u == des){
        trav(v,curr_path){
            on_path[v] = 1;
        }
    }

    for(auto [v,w] : adj[u]){
        if(v == p) conts;
        dfs2(v,u,des);
    }

    curr_path.pop_back();
}

int max_score(int n, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    rep(i,n){
        adj[i].clear();
        on_path[i] = 0;
    }

    rep(i,n-1){
        ll u = U[i], v = V[i], w = W[i];
        adj[u].pb({v,w}), adj[v].pb({u,w});
    }

    dis[X][0] = dis[Y][1] = 0;    
    dfs1(X,-1,0);
    dfs1(Y,-1,1);
    dfs2(X,-1,Y);

    vector<ll> a(n), b(n);
    rep(i,n){
        ll dx = dis[i][0], dy = dis[i][1];
        a[i] = min(dx,dy);
        b[i] = max(dx,dy)-a[i];
    }

    ll ans = 0;

    // only 1s
    {
        vector<ll> vals;
        rep(i,n) vals.pb(a[i]);
        sort(all(vals));
        ll sum = 0;
        ll guys = 0;

        rep(i,n){
            sum += vals[i];
            if(sum > K) break;
            guys++;
        }

        amax(ans,guys);
    }

    // 1s and 2s
    // all guys on path from X to Y must be at least 1
    ll forced_cost = 0, on_path_cnt = 0;

    rep(i,n){
        if(on_path[i]){
            forced_cost += a[i];
            on_path_cnt++;
            a[i] = b[i];
            b[i] = inf2;
        }
    }

    vector<pll> c;
    rep(i,n){
        c.pb({a[i],b[i]});
    }

    auto cmp = [&](pll p1, pll p2){
        return p1.ff+p1.ss < p2.ff+p2.ss;
    };

    sort(all(c),cmp);
    c.pb({inf2,inf2});

    vector<ll> d;
    rep(i,n){
        auto [x,y] = c[i];
        d.pb(x);
        d.pb(y);
    }

    sort(all(d));
    d.resize(unique(all(d))-d.begin());
    ll m = sz(d);
    fenwick<__int128> fenw_cnt(m+5), fenw_sum(m+5);

    auto upd = [&](ll x, ll add){
        ll i = lower_bound(all(d),x)-d.begin()+1;
        fenw_cnt.pupd(i,add);
        fenw_sum.pupd(i,x*add);
    };

    rep(i,n){
        auto [x,y] = c[i];
        upd(x,1);
    }

    rep(i,n+1){
        // i = first 0
        // everybody to the left = 1/2
        // everybody to the right = 0/1
            
        if(forced_cost > K) break;

        auto [x,y] = c[i];
        upd(x,-1);

        ll l = 1, r = m;
        ll pos = 0;

        while(l <= r){
            ll mid = (l+r) >> 1;
            if(forced_cost+fenw_sum.query(1,mid) <= K){
                pos = mid;
                l = mid+1;
            }
            else{
                r = mid-1;
            }
        }

        ll cnt = i+on_path_cnt+fenw_cnt.query(1,pos);
        ll extra_sum = K-forced_cost-fenw_sum.query(1,pos);
        assert(extra_sum >= 0);
        if(pos < m){
            cnt += extra_sum/d[pos];
        }

        amax(ans,cnt);

        if(y < inf2){
            upd(y,1);
        }

        forced_cost += x;
    }

    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 12 / 12
• Subtask 4: 14 / 14
• Subtask 5: 0 / 9
• Subtask 6: 0 / 11
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 17