Pagini recente » Cod sursa (job #189079) | Cod sursa (job #622679) | Cod sursa (job #433637) | Cod sursa (job #1880436) | Cod sursa (job #1607869)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int n,m,viz[100001],i,x,y,c;
vector < pair <int, int >> v[100001];
ifstream f("andrei.in");
ofstream g("andrei.out");
void BF(int x)
{
int i,C[100001],p,u,k;
viz[x]=1;
p=u=1;
C[p]=x;
while(p<=u)
{
k=C[p];
for(i=0;i<v[k].size();i++)
if(viz[v[k][i].first]==0)
{
if(v[k][i].second!=3)
viz[v[k][i].first]=3-viz[k];
else
viz[v[k][i].first]=viz[k];
C[++u]=v[k][i].first;
}
p++;
}
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y>>c;
v[x].push_back({y,c+1});
v[y].push_back({x,c+1});
}
BF(1);
for(i=1;i<=n;i++)
g<<viz[i]-1<<" ";
return 0;
}