oj.uz

답안 #525946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525946 2022-02-13T09:32:41 Z Josia Paths (RMI21_paths) C++14
56 / 100
 600 ms 8516 KB 
#pragma GCC optimize ("O3")

#include <bits/stdc++.h>

using namespace std;
#define int int64_t



vector<int> parents;
vector<vector<pair<int, int>>> graph;
int n, k;



void merge(priority_queue<int> &A, priority_queue<int> &B) {
    if (A.size() > B.size()) A.swap(B);
    int sizea = A.size();
    for (int i = 0; i<min((int)sizea, k); i++) {B.push(A.top()); A.pop();}
}


priority_queue<int> dfs(int v, int p) {
    priority_queue<int> res;

    if (graph[v].size() == 1) res.push(0);

    if (parents[v] != -1) return res;

    parents[v] = p;

    for (auto u: graph[v]) {
        if (parents[u.first] != -1) continue;
        priority_queue<int> tmp = dfs(u.first, v);

        int newElem = tmp.top() + u.second;
        tmp.pop();
        tmp.push(newElem);

        merge(tmp, res);
    }

    return res;
}

void solve() {
    
    cin >> n >> k;
    graph.resize(n);
    parents.resize(n);

    for (int i = 0; i<n-1; i++) {
        int a, b, c; cin >> a >> b >> c;
        a--; b--;
        graph[a].push_back({b, c});
        graph[b].push_back({a, c});
    }

    for (int i = 0; i<n; i++) {
        fill(parents.begin(), parents.end(), -1);

        priority_queue<int> pq = dfs(i, -2);

        int res = 0;

        for (int i = 0; i<k; i++) {
            if (pq.empty()) break;
            res += pq.top();
            pq.pop();
        }

        cout << res << "\n";
    }
}

signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    solve();

    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 4 ms 332 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 4 ms 332 KB Output is correct
8 Correct 85 ms 408 KB Output is correct
9 Correct 76 ms 484 KB Output is correct
10 Correct 41 ms 428 KB Output is correct
11 Correct 56 ms 400 KB Output is correct
12 Correct 53 ms 408 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 4 ms 332 KB Output is correct
8 Correct 85 ms 408 KB Output is correct
9 Correct 76 ms 484 KB Output is correct
10 Correct 41 ms 428 KB Output is correct
11 Correct 56 ms 400 KB Output is correct
12 Correct 53 ms 408 KB Output is correct
13 Correct 478 ms 532 KB Output is correct
14 Correct 324 ms 632 KB Output is correct
15 Correct 154 ms 552 KB Output is correct
16 Correct 268 ms 460 KB Output is correct
17 Correct 270 ms 516 KB Output is correct
18 Correct 198 ms 500 KB Output is correct
19 Correct 474 ms 484 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1083 ms 8516 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 4 ms 332 KB Output is correct
8 Correct 85 ms 408 KB Output is correct
9 Correct 76 ms 484 KB Output is correct
10 Correct 41 ms 428 KB Output is correct
11 Correct 56 ms 400 KB Output is correct
12 Correct 53 ms 408 KB Output is correct
13 Correct 478 ms 532 KB Output is correct
14 Correct 324 ms 632 KB Output is correct
15 Correct 154 ms 552 KB Output is correct
16 Correct 268 ms 460 KB Output is correct
17 Correct 270 ms 516 KB Output is correct
18 Correct 198 ms 500 KB Output is correct
19 Correct 474 ms 484 KB Output is correct
20 Execution timed out 1083 ms 8516 KB Time limit exceeded
21 Halted 0 ms 0 KB -