Pagini recente » Cod sursa (job #1017863) | Cod sursa (job #978643) | Cod sursa (job #1397352) | Cod sursa (job #1734943) | Cod sursa (job #1300970)
# include <fstream>
# include <algorithm>
# include <vector>
using namespace std;
ifstream f("andrei.in");
ofstream g("andrei.out");
struct elem
{
int y, col;
}E;
vector <elem> v[100005];
int i,j,n,m,x,y;
int gr[100005], ap[100005];
void DFS (int k)
{
ap[k]=1;
for (int i=0; i<v[k].size(); ++i)
{
if (! ap[v[k][i].y])
{
if (v[k][i].col==0 || v[k][i].col==1) gr[v[k][i].y]=1-gr[k];
if (v[k][i].col==2) gr[v[k][i].y]=gr[k];
DFS (v[k][i].y);
}
}
}
int main ()
{
f>>n>>m;
for (i=1; i<=m; ++i)
{
f>>x>>y>>E.col;
E.y=y; v[x].push_back(E);
E.y=x; v[y].push_back(E);
}
for (i=1; i<=n; ++i)
{
if (! ap[i])
DFS (i);
}
for (i=1; i<=n; ++i)
g<<gr[i]<<" ";
g<<"\n";
return 0;
}