Submission #1294688

---

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;
int main(){
    int n,s; cin>>n>>s;
    vvi d(101,vi(101,INF));
    vb used(101,false);
    rep(i,n){
        int temp;cin>>temp;
        if(temp)used[i+1]=true;
    }
    rep(i,n-1){
        pii hoge; cin>>hoge.first>>hoge.second;
        d[hoge.first][hoge.second]=1;
        d[hoge.second][hoge.first]=1;
    }
    rep(i,n+1){
        rep(j,n+1){
            rep(k,n+1){
                if(i==j)d[i][j]=0;
                else cmin(d[i][j],d[i][k]+d[k][j]);
            }
        }
    }
    ll ans=0;
    int now=s;
    while(true){
        bool foo=true;
        int cnt=0;
        rep(i,n+1)if(used[i])cnt++;
        if(cnt<=1)break;
        rep(i,n+1){
            if(used[i+1]&&now!=i+1){
                ans+=d[now][i+1];
                used[now]=false;
                now=i+1;
            }
        }
    }
    cout<<ans+d[now][s]<<endl;
}

Submission Info

Judge Result