oj.uz

Submission #786182

# Submission time Handle Problem Language Result Execution time Memory
786182 2023-07-18T05:07:29 Z 반딧불(#10026) Paths (RMI21_paths) C++17
8 / 100
 600 ms 12428 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n, k;
vector<pair<int, ll> > link[100002];
multiset<ll> st[100002];

void add(multiset<ll> &A, multiset<ll> &B){
    if(A.size() < B.size()) A.swap(B);
    for(int x: B){
        A.insert(x);
    }
    B.clear();
    while((int)A.size() > k) A.erase(A.begin());
}

void dfs(int x, int p=-1){
    if((int)link[x].size() - int(p!=-1) == 0){
        st[x].insert(0);
        return;
    }
    for(auto y: link[x]){
        if(y.first==p) continue;
        dfs(y.first, x);
        ll tmp = *st[y.first].rbegin();
        st[y.first].erase(prev(st[y.first].end()));
        st[y.first].insert(tmp+y.second);

        add(st[x], st[y.first]);
    }
//    printf("Parent %d, x %d: ", p, x);
//    for(auto t: st[x]) printf("%lld ", t);
//    puts("");
}

int main(){
    scanf("%d %d", &n, &k);
    for(int i=1; i<n; i++){
        int x, y; ll c;
        scanf("%d %d %lld", &x, &y, &c);
        link[x].push_back(make_pair(y, c));
        link[y].push_back(make_pair(x, c));
    }
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++) st[j].clear();
        dfs(i);
        ll sum = 0;
        while((int)st[i].size() > k){
            st[i].erase(st[i].begin());
        }
        for(auto x: st[i]) sum+=x;
        printf("%lld\n", sum);
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:40:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |         scanf("%d %d %lld", &x, &y, &c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Incorrect 7 ms 7252 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Incorrect 7 ms 7252 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Incorrect 7 ms 7252 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1058 ms 12428 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Incorrect 7 ms 7252 KB Output isn't correct
4 Halted 0 ms 0 KB -