Submission #1293901

---

Source Code Expand

#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
typedef pair<ll,ll>pll;
vector<pii>g[1000];
vi d(1000,INF);
int s,G;
void dijkstra(){
    priority_queue<pii,vector<pii>,greater<pii>>que;
    d[s]=0;
    que.push(pii(0,s));
    while(!que.empty()){
        pii now=que.top();
        que.pop();
        if(d[now.second]<now.first)continue; //仮の最短距離を弾く
        for(int i=0; i<g[now.second].size();i++){
            pii e=g[now.second][i];
            if(d[e.first]<d[now.second]+e.second)continue;
            d[e.first]=d[now.second]+e.second;
            que.push(pii(d[e.first],e.first));
        }
    }
}
int main(){
    int n;
    cin>>n>>s;
    vb flag(10000,false);
    rep(i,n){
        int hoge; cin>>hoge;
        if(hoge)flag[i+1]=true;
    }
    rep(i,n-1){
        pii gotiusa;
        cin>>gotiusa.first>>gotiusa.second;
        g[gotiusa.first].push_back(pii(gotiusa.second,1));
        g[gotiusa.second].push_back(pii(gotiusa.first,1));
    }
    dijkstra();
    ll ans=0;
    rep(i,n+1){
        if(i!=s&&flag[i])ans+=d[i]*2;
    }
    cout<<ans<<endl;
    
}

Submission Info

Judge Result