oj.uz

답안 #524104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
524104 2022-02-08T16:03:33 Z wdjpng Paths (RMI21_paths) C++17
0 / 100
 442 ms 28920 KB 
#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#include <bits/stdc++.h>

#define int long long
#define rep(i,n) for(int i =0; i<n;i++)
#define all(a) a.begin(), a.end()

using namespace std;

int k;
struct edge{
    int c, w;
};

struct topkmultiset{
    int k;
    int sum = 0;
    multiset<pair<int, int>>other,topk;
    void rebalance()
    {
        while (other.size()&&topk.size()<k)
        {
            auto a = other.rbegin();
            auto end  = *a;
            sum+=end.first;
            topk.insert(end);
            other.erase(end);
        }
        
        while (other.size()&&topk.size()&&*(other.rbegin())>*(topk.begin()))
        {
           auto a = *(other.rbegin()), b = *(topk.begin());
           sum+=a.first-b.first;
           topk.erase(b);
           other.insert(b);
           
           other.erase(a);
           topk.insert(a);
        }
        
    }

    void replace(pair<int, int> a, pair<int, int> b) {
        if(find(all(topk), a)!=topk.end()) {
            sum-=a.first;
            topk.erase(a);
        } else other.erase(a);

        other.insert(b);
        rebalance();
    }
};

int precount=0;
vector<int>pre,post;
void predfs(int v, int p, vector<vector<edge>>&E)
{
    pre[v]=precount++;
    for(auto e : E[v]) if(e.w!=p) predfs(e.w,v,E);
    post[v]=precount++;
}

vector<pair<int, int>>bestofsubtree;
vector<pair<int, int>>bestofsubtreefromotherchild;
multiset<pair<int, int>> dfs(int v, int p, vector<vector<edge>>& E)
{
    multiset<pair<int, int>> cs;
    cs.insert({0,v});

    pair<int, int>best={0,0}, second_best = {0,0};

    for(edge e : E[v])
    {
        if(e.w==p) continue;
        multiset<pair<int, int>> ns = dfs(e.w, v, E);
        
        auto it = ns.end();
        it--;
        pair<int,int> tmp = *it;

        ns.erase(it);
        tmp.first+=e.c;

        if(tmp>best) {second_best=best;best=tmp;}
        else second_best=max(second_best, tmp);

        ns.insert(tmp);
        bestofsubtree[e.w]=tmp;

        if(cs.size()<ns.size()) swap(cs, ns);
        for(auto x : ns) cs.insert(x);
    }
    bestofsubtreefromotherchild[v] = second_best;
    bestofsubtree[v] = best;
    // while (cs.size()>k+3) cs.erase(cs.begin()); 
    
    return cs;
}


bool ischild(int w, int v) {return pre[v]<=pre[w]&&post[w]<=post[v];}
vector<int>sol;
pair<int, int>defau = {-1,-1};
void meta_dfs(int v, int p, topkmultiset&ts, vector<vector<edge>>& E, pair<int, int>bestedge)
{
    for(edge e : E[v])
    {
        if(e.w==p) continue;

        // remove edge from child to root from biggest path of child
        pair<int, int>uchild = bestofsubtree[e.w];
        uchild.first-=e.c;
        ts.replace(bestofsubtree[e.w], uchild);
        
        // add that edge to biggest path not coming from subtree of child 

        pair<int, int>tmp;
        tmp = bestofsubtree[v];
        if(ischild(tmp.second, e.w) || bestofsubtreefromotherchild[v] > tmp &&(!ischild(bestofsubtreefromotherchild[v].second, e.w))) tmp = bestofsubtreefromotherchild[v];
        if(bestedge > tmp&&!(ischild(bestedge.second, e.w))) tmp = bestedge;

        auto mod = tmp;
        mod.first+=e.c;
        ts.replace(tmp, mod);

        sol[e.w]=ts.sum;
        meta_dfs(e.w,v,ts, E, mod);
       
        // remove child weight from biggest link
        ts.replace(mod, tmp);

        // place biggest link to child in again
        ts.replace(uchild, bestofsubtree[e.w]);
    }
}


signed main()
{
    int n;
    cin>>n>>k;
    
    bestofsubtree.assign(n+1, {-1,-1});
    bestofsubtreefromotherchild.assign(n+1, {-1,-1});
    pre.assign(n+1, -1);
    post.assign(n+1,-1);

    vector<vector<edge>>E(n+1);
    rep(i, n-1)
    {
        int a, b, c;
        cin>>a>>b>>c;

        E[a].push_back({c,b});
        E[b].push_back({c,a});
    }
    predfs(1,-1,E);
    sol.resize(n+1);
    multiset<pair<int, int>>s  = dfs(1, -1, E);
    topkmultiset ts = topkmultiset();
    ts.k=k;
    ts.other = s;
    ts.rebalance();
    sol[1]=ts.sum;

    meta_dfs(1, -1, ts, E, {0,0});
    for(int i = 1;i <= n; i++) cout<<sol[i]<<"\n";
}

Compilation message

Main.cpp: In member function 'void topkmultiset::rebalance()':
Main.cpp:25:41: warning: comparison of integer expressions of different signedness: 'std::multiset<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   25 |         while (other.size()&&topk.size()<k)
      |                              ~~~~~~~~~~~^~
Main.cpp: In function 'void meta_dfs(long long int, long long int, topkmultiset&, std::vector<std::vector<edge> >&, std::pair<long long int, long long int>)':
Main.cpp:123:77: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  123 |         if(ischild(tmp.second, e.w) || bestofsubtreefromotherchild[v] > tmp &&(!ischild(bestofsubtreefromotherchild[v].second, e.w))) tmp = bestofsubtreefromotherchild[v];

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 442 ms 28920 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 276 KB Output isn't correct
2 Halted 0 ms 0 KB -