!2-SAT (doesn't work)

#include <iostream>
#include <vector>
#include <cstdio>
#include <map>
#include <algorithm>
#include <math.h>
#include <string>
#include <cstring>
#include <set>
using namespace std;

typedef long long ll;
typedef double ld;

const int N = 2000003, T = 1005;

int a[N], used[N], have[N];
int fir[N], sec[N];
vector<int> g[N], p[N], c[N], top;

void dfs(int v)
{
    used[v] = 1;
    for (int u : g[v])
        if (!used[u])
            dfs(u);
    top.push_back(v);
}

void dfs1(int v)
{
    if (a[v])
        return;
    a[v] = 1;
    int go = v;
    if (v < T)
        go += T;
    else
        go -= T;
    a[go] = -1;
    for (int u : g[v])
        dfs1(u);
}

int main()
{
    ios::sync_with_stdio(0); cin.tie(0);
    freopen("in.txt", "r", stdin);
    int n;
    cin >> n;
    int T = n * n;
    for (int i = 0; i < n; i++)
    {
        int a, b, cc;
        cin >> a >> b >> cc;
        b--;
        fir[i] = i * n + a;
        sec[i] = b * i + cc;
        p[i].push_back(a);
        c[a].push_back(i);
        p[b].push_back(cc);
        c[cc].push_back(b);
        g[i * n + a].push_back(T + b * n + cc);
        g[T + b * n + cc].push_back(i * n + a);
        have[T + i * n + a] = have[b * n + cc] = have[T + b * n + cc] = have[i * n + a] = 1;
        g[b * n + cc].push_back(T + i * n + a);
        g[T + i * n + a].push_back(b * n + cc);
    }
    for (int i = 0; i < T; i++)
        for (int j = 0; j < p[i].size(); j++)
            for (int k = 0; k < p[i].size(); k++)
                if (j != k)
                    g[i * n + p[i][j]].push_back(T + i * n + p[i][k]);
    for (int i = 0; i < T; i++)
        for (int j = 0; j < c[i].size(); j++)
            for (int k = 0; k < c[i].size(); k++)
                if (j != k)
                    g[c[i][j] * n + i].push_back(T + c[i][k] * n + i);
    for (int i = 0; i < N; i++)
        if (have[i] && !used[i])
            dfs(i);
    for (int i = 0; i < top.size(); i++)
        dfs1(top[i]);
    for (int i = 0; i < n; i++)
        cout << (a[fir[i]] == 2 ? "2 " : "1 ");
    return 0;
}