제출 #1163804

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1163804		mattsoh	Roadside Advertisements (NOI17_roadsideadverts)	C++20	47 / 100	1096 ms	18808 KiB

roadsideadverts

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second

typedef long long ll;

const ll maxn = 5e4 + 10;
unordered_map<ll,ll> adj[maxn];
bool fd(ll x, array<ll,4> sch){
    for (ll i = 0;i<4;i++){
        if (sch[i] == x) return true;
    }
    return false;
}
ll dfs(ll x, ll par, array<ll,4> sch){
    bool req = false;
    ll cost = 0;
    // cout<<x<<' '<<fd(x,sch)<<"sch"<<endl;
    if (fd(x, sch)){
        req = true;
    }
    for (auto i:adj[x]){
        if (i.fi == par) continue;
        // cout<<x<<' '<<i.fi<<' '<<i.se<<endl;
        ll tcost = dfs(i.fi, x, sch);
        if (tcost != -1){
            cost += i.se + tcost;
            req = true;
        }
    }
    return req ? cost : -1;
}
signed main(){
    ll n;cin>>n;
    for (ll i = 0;i<n-1;i++){
        ll u,v,w;cin>>u>>v>>w;
        adj[u][v] = w;
        adj[v][u] = w;
    }
    ll q;cin>>q;
    for (ll i = 0;i<q;i++){
        ll a;
        array<ll,4> sch;
        cin>>a;
        for (ll j = 0;j<4;j++){
            cin>>sch[j];
        }
        cout<<dfs(a, -1, sch)<<endl;
    }
}

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