Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream fin("milkvisits.in");
- ofstream fout("milkvisits.out");
- int n,m,i,j,a,b,p,gasit,viz[100010],x,y;
- char sir[100010],c;
- queue<int>q;
- vector<int>v[100010];
- void dfs(int nod,int ok)
- {
- viz[nod]=1;
- if(sir[nod-1]==c)
- ok=1;
- if(gasit==1)
- return;
- if(nod==b && ok==1)
- gasit=1;
- for(int i=0;i<v[nod].size();i++)
- if(viz[v[nod][i]]==0)
- dfs(v[nod][i],ok);
- }
- int main()
- {
- ios_base::sync_with_stdio(false);
- fin>>n>>m;
- fin>>sir;
- for(i=1;i<=n-1;++i)
- {
- fin>>x>>y;
- v[x].push_back(y);
- v[y].push_back(x);
- }
- for(i=1;i<=m;++i)
- {
- gasit=0;
- for(j=1;j<=n;++j)
- viz[j]=0;
- fin>>a>>b>>c;
- if(sir[a-1]==c || sir[b-1]==c)
- fout<<1;
- else
- {
- dfs(a,0);
- fout<<gasit;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement