Pagini recente » Cod sursa (job #1912407) | Cod sursa (job #2792780) | Cod sursa (job #578679) | Cod sursa (job #13794) | Cod sursa (job #2347703)
#include <bits/stdc++.h>
#define MAXN 200005
int N, M, Color[MAXN];
std::vector <int> ADC[MAXN];
bool Seen[MAXN];
int Opus(int X) {
return 2*N - X;
}
inline void AddEdge(int X, int Y) {
ADC[-X+N].push_back(Y+N);
ADC[Y+N].push_back(-X+N);
ADC[-Y+N].push_back(X+N);
ADC[X+N].push_back(-Y+N);
}
void DFS2(int Vertex, int t) {
Seen[Vertex] = 1;
Color[Vertex] = t;
for (auto Edge:ADC[Vertex])
if (!Seen[Edge])
DFS2(Edge, 1-t);
}
std::ifstream In ("andrei.in");
std::ofstream Out("andrei.out");
void Citire() {
In >> N >> M;
for (int i=1, X, Y, W; i<=M; ++i) {
In >> X >> Y >> W;
if (W == 0)
AddEdge(X, Y);
else if (W == 1)
AddEdge(-X, -Y);
else if (W == 2)
AddEdge(X, -Y), AddEdge(-X, Y);
}
}
void Rezolvare() {
for (int i=0; i<=2*N; ++i)
if (!Seen[i]) DFS2(i, Color[Opus(i)]);
for (int i=1; i<=N; ++i, Out << ' ')
Out << Color[i+N];
}
int main()
{
Citire();
Rezolvare();
return 0;
}