Submission #286598
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
#define ll long long
#define ull unsigned ll
void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}
void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}
#define MD 1000000007
int N, X;
int H[111];
int edge[111][111], es[111];
int sum[111];
void dfs(int now, int bef){
int i, j, k;
sum[now] = H[now];
rep(i,es[now]){
k = edge[now][i];
if(k==bef) continue;
dfs(k, now);
sum[now] += sum[k];
}
}
int main(){
int i, j, k;
int res;
reader(&N,&X); X--;
rep(i,N) reader(H+i);
REP(i,1,N){
reader(&j,&k); j--; k--;
edge[j][es[j]++] = k;
edge[k][es[k]++] = j;
}
dfs(X, -1);
res = 0;
rep(i,N) if(sum[i] && i!=X) res+=2;
writerLn(res);
return 0;
}
Submission Info
Submission Time |
|
Task |
B - ツリーグラフ |
User |
LayCurse |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
2563 Byte |
Status |
AC |
Exec Time |
24 ms |
Memory |
932 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
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 |
796 KB |
subtask0_sample_02.txt |
AC |
22 ms |
800 KB |
subtask1_line01.txt |
AC |
23 ms |
716 KB |
subtask1_line02.txt |
AC |
21 ms |
928 KB |
subtask1_line03.txt |
AC |
23 ms |
800 KB |
subtask1_line04.txt |
AC |
21 ms |
928 KB |
subtask1_line05.txt |
AC |
22 ms |
804 KB |
subtask1_line06.txt |
AC |
24 ms |
800 KB |
subtask1_random01.txt |
AC |
22 ms |
928 KB |
subtask1_random02.txt |
AC |
21 ms |
920 KB |
subtask1_random03.txt |
AC |
21 ms |
800 KB |
subtask1_random04.txt |
AC |
24 ms |
932 KB |
subtask1_random05.txt |
AC |
22 ms |
928 KB |
subtask1_random06.txt |
AC |
23 ms |
796 KB |
subtask1_random07.txt |
AC |
22 ms |
804 KB |
subtask1_random08.txt |
AC |
24 ms |
928 KB |
subtask1_special01.txt |
AC |
22 ms |
928 KB |
subtask1_special02.txt |
AC |
21 ms |
800 KB |
subtask1_special03.txt |
AC |
22 ms |
924 KB |
subtask1_special04.txt |
AC |
22 ms |
928 KB |