제출 #370828

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
370828		azberjibiou	Designated Cities (JOI19_designated_cities)	C++17	0 / 100	2099 ms	41196 KiB

designated_cities

#include <bits/stdc++.h>
#define fir first
#define sec second
#define ll long long
using namespace std;
const int mxN=200020;
const ll INF=1000000000000000001;
int N, Q;
map <int, ll> v[mxN];
ll ans[mxN];
ll sum;
ll tot;
void dfs(int now, int pre)
{
    for(auto iter=v[now].begin();iter!=v[now].end();iter++)
    {
        if(iter->fir==pre)  continue;
        sum+=iter->sec;
        dfs(iter->fir, now);
    }
}
void solv1()
{
    ll preans=0;
    for(int i=1;i<=N;i++)
    {
        sum=0;
        dfs(i, -1);
        preans=max(preans, sum);
    }
    ans[1]=tot-preans;
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N;
    for(int i=0;i<N-1;i++)
    {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        v[a].insert({b, d});
        v[b].insert({a, c});
        tot+=c; tot+=d;
    }
    solv1();
    cin >> Q;
    while(Q--)
    {
        int a;
        cin >> a;
        cout << ans[a] << '\n';
    }
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 9
• Subtask 4: 0 / 17
• Subtask 5: 0 / 17
• Subtask 6: 0 / 44