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

Submission #287128

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){
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:51:28+0900 A - 閉路グラフ kei C++11 (GCC 4.8.1) 0 1302 Byte RE 271 ms 932 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
 RE × 4
 RE × 30
Set Name Test Cases
Case Name Status Exec Time Memory
subtask0_sample_01.txt RE 259 ms 752 KB
subtask0_sample_02.txt RE 246 ms 800 KB
subtask0_sample_03.txt RE 256 ms 808 KB
subtask0_sample_04.txt RE 256 ms 800 KB
subtask1_01.txt RE 254 ms 928 KB
subtask1_02.txt RE 255 ms 800 KB
subtask1_03.txt RE 256 ms 800 KB
subtask1_04.txt RE 254 ms 780 KB
subtask1_05.txt RE 259 ms 800 KB
subtask1_06.txt RE 244 ms 924 KB
subtask1_07.txt RE 252 ms 928 KB
subtask1_08.txt RE 254 ms 932 KB
subtask1_09.txt RE 263 ms 676 KB
subtask1_10.txt RE 252 ms 796 KB
subtask1_11.txt RE 264 ms 928 KB
subtask1_12.txt RE 269 ms 800 KB
subtask1_13.txt RE 260 ms 796 KB
subtask1_14.txt RE 259 ms 812 KB
subtask1_15.txt RE 258 ms 792 KB
subtask1_16.txt RE 259 ms 928 KB
subtask1_17.txt RE 265 ms 800 KB
subtask1_18.txt RE 263 ms 744 KB
subtask1_19.txt RE 246 ms 924 KB
subtask1_20.txt RE 257 ms 796 KB
subtask1_21.txt RE 257 ms 924 KB
subtask1_22.txt RE 248 ms 792 KB
subtask1_23.txt RE 267 ms 800 KB
subtask1_24.txt RE 271 ms 804 KB
subtask1_25.txt RE 258 ms 920 KB
subtask1_26.txt RE 256 ms 804 KB