Contest Duration: - (local time) (90 minutes) Back to Home

Submission #287151

Source Code Expand

Copy
```#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;
int 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]==1)) res += 2;
return res;
}

int main(){
cin >> n >> x;
rep(i,n) cin >> h[i];
rep(i,n-1){
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

Submission Time 2014-11-29 21:53:54+0900 B - ツリーグラフ kei C++11 (GCC 4.8.1) 100 1304 Byte AC 23 ms 928 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
 AC × 2
 AC × 20
Set Name Test Cases
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 22 ms 792 KB
subtask0_sample_02.txt AC 22 ms 924 KB
subtask1_line01.txt AC 22 ms 700 KB
subtask1_line02.txt AC 21 ms 800 KB
subtask1_line03.txt AC 22 ms 728 KB
subtask1_line04.txt AC 22 ms 928 KB
subtask1_line05.txt AC 21 ms 924 KB
subtask1_line06.txt AC 21 ms 800 KB
subtask1_random01.txt AC 22 ms 800 KB
subtask1_random02.txt AC 22 ms 676 KB
subtask1_random03.txt AC 23 ms 928 KB
subtask1_random04.txt AC 22 ms 800 KB
subtask1_random05.txt AC 22 ms 676 KB
subtask1_random06.txt AC 22 ms 800 KB
subtask1_random07.txt AC 22 ms 672 KB
subtask1_random08.txt AC 21 ms 800 KB
subtask1_special01.txt AC 23 ms 804 KB
subtask1_special02.txt AC 22 ms 920 KB
subtask1_special03.txt AC 23 ms 800 KB
subtask1_special04.txt AC 21 ms 676 KB