Pagini recente » Cod sursa (job #2333320) | Cod sursa (job #2478171) | Cod sursa (job #1876065) | Cod sursa (job #1276681) | Cod sursa (job #2909055)
#include <bits/stdc++.h>
using namespace std;
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9) {
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch) {
while (*ch) {
write_ch(*ch);
++ch;
}
return *this;
}
};
InParser fin("andrei.in");
OutParser fout("andrei.out");
int cnt, ctc[200005], st[200005], nr;
vector<int> G[200005], GT[200005];
bitset<200005> v;
void adaugare(int a, int b) {
G[a].push_back(b);
GT[b].push_back(a);
}
void dfs(int nod) {
v[nod] = true;
for(auto i : G[nod]) {
if(!v[i]) {
dfs(i);
}
}
st[++nr] = nod;
}
void dfsT(int nod) {
v[nod] = true;
ctc[nod] = cnt;
for(auto i : GT[nod]) {
if(!v[i]) {
dfsT(i);
}
}
}
int main() {
ios_base::sync_with_stdio(false);
int n, m, x, y, z;
fin >> n >> m;
for(int i = 1; i <= m; i++) {
fin >> x >> y >> z;
if(z == 0) {
adaugare(x, y + n);
adaugare(y, x + n);
}
if(z == 1) {
adaugare(x + n, y);
adaugare(y + n, x);
}
if(z == 2) {
adaugare(x, y);
adaugare(y, x);
adaugare(x + n, y + n);
adaugare(y + n, x + n);
}
}
for(int i = 1; i <= 2 * n; i++) {
if(!v[i]) {
dfs(i);
}
}
for(int i = 1; i <= 2 * n; i++) {
v[i] = false;
}
for(int i = 2 * n; i >= 1; i--) {
if(!v[st[i]]) {
cnt++;
dfsT(st[i]);
}
}
for(int i = 1; i <= n; i++) {
fout << (ctc[i] < ctc[i + n]) << " ";
}
return 0;
}