Submission #1112820

#	Time	Username	Problem	Language	Result	Execution time	Memory
1112820		InvMOD	Harbingers (CEOI09_harbingers)	C++14	80 / 100	144 ms	52424 KiB

harbingers

#include <bits/stdc++.h>

#define FOR(i, a, b) for(int i = (a); i <= (b); i++)

#define sz(v) (int)(v).size()

using namespace std;

using ll = long long;

const int N = 1e5;


struct LichaoOptMem{
    struct Line{
        int a; ll b;
        Line(int a = 0, ll b = LLONG_MAX): a(a), b(b) {}
        ll f(ll x){return 1ll*a*x + b;}
        ll slope(){return a;}
        bool operator != (const Line& x) const{
            return (a != x.a || b != x.b);
        }
    };
    vector<bool> rekt;

    vector<int> compress; int global_version = -1;

    vector<vector<pair<Line, int>>> st; int trsz;

    void init(vector<int>& comp){
        trsz = sz(comp)-1;
        st.resize(trsz+1);
        compress = comp;
        rekt.resize(trsz);
        return;
    }

    void update(int l, int r, Line curLine){
        if(l > r) return;
        if(l == r){
            if(!sz(st[l]) || st[l].back().first.f(compress[l]) > curLine.f(compress[l]))
                return st[l].push_back(make_pair(curLine, global_version)), void();
        }
        else{
            int mid = l+r>>1;
            while(sz(st[mid]) && rekt[st[mid].back().second]) st[mid].pop_back();
            if(!sz(st[mid])) return st[mid].push_back(make_pair(curLine, global_version)), void();
            Line version = st[mid].back().first;
            if(version.f(compress[mid]) > curLine.f(compress[mid])) swap(curLine, version);
            if(version.slope() < curLine.slope()) update(l, mid-1, curLine);
            if(version.slope() > curLine.slope()) update(mid+1, r, curLine);
            if(version != st[mid].back().first) st[mid].push_back(make_pair(version, global_version));
        }
        return;
    }

    ll query(int l, int r, ll x){
        if(l > r) return LLONG_MAX;
        int mid = l+r>>1;
        while(sz(st[mid]) && rekt[st[mid].back().second]) st[mid].pop_back();
        ll cur = (st[mid].size() ? st[mid].back().first.f(x) : LLONG_MAX);
        if(x == compress[mid]) return cur;
        if(x < compress[mid]) return min(cur, query(l, mid-1, x));
        if(x > compress[mid]) return min(cur, query(mid+1, r, x));
        return -1;
    }

    ll query(ll x){
        return query(0, trsz, x);
    }

    int addLine(int a, ll b){return ++global_version, update(0, trsz, Line(a, b)), global_version;}

    void rmvLine(int version){return rekt[version] = true, void();}
};

int speed[N];

ll dp[N], cur_dist[N];

pair<int,int> E[N];

basic_string<int> adj[N];

LichaoOptMem lichao;

void dfs(int x){
    if(x) dp[x] += lichao.query(speed[x]) + (1ll * cur_dist[x] * speed[x]);

    int rem_version = lichao.addLine(-cur_dist[x], dp[x]);

    for(int id : adj[x]){
        int v = E[id].first ^ x, w = E[id].second;
        if(v && !cur_dist[v]){
            cur_dist[v] = cur_dist[x] + 1ll * w;
            dfs(v);
        }
    }
    lichao.rmvLine(rem_version);
    return;
}

void solve()
{
    int n; cin >> n;
    FOR(i, 1, n-1){
        int u,v,w; cin >> u >> v >> w;
        u--, v--;
        E[i] = make_pair(u^v, w);
        adj[u].push_back(i);
        adj[v].push_back(i);
    }

    vector<int> compress;
    FOR(i, 1, n-1){
        cin >> dp[i] >> speed[i];
        compress.push_back(speed[i]);
    }

    sort(compress.begin(), compress.end());

    lichao.init(compress);
    dfs(0);

    FOR(i, 1, n-1) cout << dp[i] <<" \n"[i == n-1];
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
  
	solve();
 	return 0;
}

Compilation message (stderr)

harbingers.cpp: In member function 'void LichaoOptMem::update(int, int, LichaoOptMem::Line)':
harbingers.cpp:45:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 |             int mid = l+r>>1;
      |                       ~^~
harbingers.cpp: In member function 'll LichaoOptMem::query(int, int, ll)':
harbingers.cpp:59:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   59 |         int mid = l+r>>1;
      |                   ~^~

• Subtask 1: 80 / 100