Submission #950771

#	Time	Username	Problem	Language	Result	Execution time	Memory
950771		Irate	Roadside Advertisements (NOI17_roadsideadverts)	C++17	47 / 100	1044 ms	8812 KiB

roadsideadverts

#include<bits/stdc++.h>
using namespace std;
const int mxN = 5e4 + 5;

vector<pair<int, int>> G[mxN];
vector<int>path, W;
vector<bool>edge;
int p[5];
void dfs(int node, int par){
    bool check = 0;
    for(int i = 0;i < 5;++i){
        check |= (node == p[i]);
    }
    if(check){
        for(int &i : path){
            edge[i] = 1;
        }
    }
    for(auto i : G[node]){
        int to = i.first, indx = i.second;
        if(to != par){
            path.push_back(indx);
            dfs(to, node);
            path.pop_back();
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    W.resize(n);
    for(int i = 1;i < n;++i){
        int u, v, w;
        cin >> u >> v >> w;
        W[i - 1] = w;
        G[u].push_back({v, i - 1});
        G[v].push_back({u, i - 1});
    }
    edge.resize(n);
    int q;
    cin >> q;
    while(q--){
        for(int i = 0;i < n;++i){
            edge[i] = 0;
        }
        for(int i = 0;i < 5;++i){
            cin >> p[i];
        }
        dfs(p[0], p[0]);
        long long res = 0;
        for(int i = 0;i < n;++i){
            if(edge[i])res += W[i];
        }
        cout << res << '\n';
    }
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 23
• Subtask 3: 40 / 40
• Subtask 4: 0 / 30