Advertisement
Guest User

Untitled

a guest
Dec 15th, 2019
58
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.95 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. ifstream fin("milkvisits.in");
  4. ofstream fout("milkvisits.out");
  5. int n,m,i,j,a,b,p,gasit,viz[100010],x,y;
  6. char sir[100010],c;
  7. queue<int>q;
  8. vector<int>v[100010];
  9. void dfs(int nod,int ok)
  10. {
  11. viz[nod]=1;
  12. if(sir[nod-1]==c)
  13. ok=1;
  14. if(gasit==1)
  15. return;
  16. if(nod==b && ok==1)
  17. gasit=1;
  18. for(int i=0;i<v[nod].size();i++)
  19. if(viz[v[nod][i]]==0)
  20. dfs(v[nod][i],ok);
  21. }
  22. int main()
  23. {
  24. ios_base::sync_with_stdio(false);
  25. fin>>n>>m;
  26. fin>>sir;
  27. for(i=1;i<=n-1;++i)
  28. {
  29. fin>>x>>y;
  30. v[x].push_back(y);
  31. v[y].push_back(x);
  32. }
  33. for(i=1;i<=m;++i)
  34. {
  35. gasit=0;
  36. for(j=1;j<=n;++j)
  37. viz[j]=0;
  38. fin>>a>>b>>c;
  39. if(sir[a-1]==c || sir[b-1]==c)
  40. fout<<1;
  41. else
  42. {
  43. dfs(a,0);
  44. fout<<gasit;
  45. }
  46. }
  47. return 0;
  48. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement