oj.uz

Submission #645497

# Submission time Handle Problem Language Result Execution time Memory
645497 2022-09-27T09:04:15 Z Vanilla Paths (RMI21_paths) C++17
19 / 100
 28 ms 624 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
typedef pair <int64, int64> pii;
const int maxn = 202;
vector <int> ad [maxn];
vector <pii> lv;
int64 cost [maxn][maxn];
int dad [maxn];
int leaves = 0;

void prec (int u, int p, int64 sum) {
    bool f = 0;
    for (int v: ad[u]) {
        if (v == p) continue;
        f = 1;
        dad[v] = u;
        prec(v, u, sum + cost[u][v]);
    }
    if (!f) lv.push_back({sum, u});
}

int main() {
    int n,k;
    cin >> n >> k;
    for (int i = 0; i < n - 1; i++){
        int a,b,c;
        cin >> a >> b >> c;
        cost[a][b] = cost[b][a] = c;
        ad[a].push_back(b);
        ad[b].push_back(a);
    }
    for (int i = 1; i <= n; i++){
        if (ad[i].size() == 1) leaves++;
    }
    if (ad[1].size() == 1) leaves--;
    for (int i = 1; i <= n; i++){
        k = min(k, leaves);
        int64 rs = 0;
        vector <pair <pii, int> > back;
        for (int j = 0; j < k; j++){
            lv.clear();
            prec(i, -1, 0);
            dad[i] = -1;
            sort(lv.rbegin(), lv.rend());
            // cout << i << " " << j << " " << lv[0].first << " " << lv[0].second << "\n";
            rs+=lv[0].first;
            int k = lv[0].second;
            while (k != i) {
                int p = dad[k];
                if (cost[p][k]) back.push_back({{p, k}, cost[p][k]});
                cost[p][k] = 0;
                k = p;
            }
        }
        for (auto [x, y]: back) {
            cost[x.first][x.second] = y;
        }
        // cout << i << ": ";
        cout << rs << "\n";
        
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 312 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 27 ms 624 KB Output is correct
4 Correct 16 ms 568 KB Output is correct
5 Correct 28 ms 596 KB Output is correct
6 Correct 7 ms 596 KB Output is correct
7 Correct 15 ms 596 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 27 ms 624 KB Output is correct
4 Correct 16 ms 568 KB Output is correct
5 Correct 28 ms 596 KB Output is correct
6 Correct 7 ms 596 KB Output is correct
7 Correct 15 ms 596 KB Output is correct
8 Runtime error 1 ms 340 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 27 ms 624 KB Output is correct
4 Correct 16 ms 568 KB Output is correct
5 Correct 28 ms 596 KB Output is correct
6 Correct 7 ms 596 KB Output is correct
7 Correct 15 ms 596 KB Output is correct
8 Runtime error 1 ms 340 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 27 ms 624 KB Output is correct
4 Correct 16 ms 568 KB Output is correct
5 Correct 28 ms 596 KB Output is correct
6 Correct 7 ms 596 KB Output is correct
7 Correct 15 ms 596 KB Output is correct
8 Runtime error 1 ms 340 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -