Submission #287026

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <cstdlib>

using namespace std;

#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define REP(i,j,k) for(int i=j;i<(int)(k);++i)
#define foreach(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef long long ll;
// const int INF = 1 << 29;
// const double EPS = 1e-9;


int n,x;
bool h[105];
bool ok[105];
vi G[105];

int dfs(int now){
    cout << "now" << " " << now << endl;
    
    ok[now] = true;
    int res = 0;
    for(auto i : G[now]) {
        if(ok[i]) continue;
        res += dfs(i);
    }

    if(now!=x-1 && (res>0 || h[now])) res += 2;
    return res;
}

int main(){
    cin >> n >> x;
    rep(i,n) cin >> h[i];
    rep(i,n){
        int a,b;
        cin >> a >> b;
        G[a-1].pb(b-1);
        G[b-1].pb(a-1);
    }

    rep(i,n) ok[i] = false;
    cout << dfs(x-1) << endl;
    return 0;
}

Submission Info

Judge Result