Submission #286724


Source Code Expand

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reg(i,a,b) for(int i=(a);i<=(b);i++)
#define irep(i,n) for(int i=((int)(n))-1;i>=0;i--)
#define ireg(i,a,b) for(int i=(b);i>=(a);i--)
typedef long long int lli;
typedef pair<int,int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX

int n,st;
vector<int> vs[105];
int is[105]={};
int gone[105]={};

int dfs(int no){
	if(gone[no]!=0)return 0;
	gone[no] = 1;
	int res = 0;
	rep(i,vs[no].size()){
		int to = vs[no][i];
		if(gone[to]!=0)continue;
		res += dfs(to);
	}
	if(res>0 || is[no]==1)res++;
	//printf("nor .. %d\n",res);
	return res;
}

int main(void){
	scanf("%d%d",&n,&st);
	reg(i,1,n){
		scanf("%d",&is[i]);
	}
	rep(i,n-1){
		int a,b;
		scanf("%d%d",&a,&b);
		vs[a].push_back(b);
		vs[b].push_back(a);
	}
	printf("%d\n",max(dfs(st)*2-2,0));
	
	return 0;
}



Submission Info

Submission Time
Task B - ツリーグラフ
User satos
Language C++ (G++ 4.6.4)
Score 100
Code Size 1066 Byte
Status AC
Exec Time 23 ms
Memory 916 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:41:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:43:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:47:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

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