oj.uz

Submission #796886

# Submission time Handle Problem Language Result Execution time Memory
796886 2023-07-28T21:42:39 Z Liudas Traffic (IOI10_traffic) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
#include "traffic.h"
using namespace std;
int LocateCentre(int N, int P[], int S[], int D[]){
    vector<vector<int>> tree(N);
    vector<int> maxim(N), total(N), vis(N), siz(N);
    priority_queue<pair<int, int>> que;
    for(int i = 0; i < N-1; i ++){
        tree[S[i]].push_back(D[i]);
        tree[D[i]].push_back(S[i]);
    }
    for(int i = 0; i < N; i ++){
        siz[i] = tree[i].size();
        if(tree[i].size() == 1){
            que.push({-P[i], i});
            vis[i] = true;
        }
    }
    while(!que.empty()){
        int val = -que.top().first, a = que.top().second;
        que.pop();
        for(int i : tree[a]){
            if(vis[i])continue;
            maxim[i] = max(val, maxim[i]);
            total[i] += val;
            siz[i]--;
            if(siz[i] == 1){
                que.push({-(total[i]+P[i]), i});
            }
            if(siz[i] == 0){
                return i;
            }
        }
    }
    return 0;
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -