思路:用邻接表存储整个图G,然后对每个点进行dfs,用一个vis数组标记走没走过,没走过的为0,那么遇到了就直接染成颜色1,祖先点的邻接点走完,就让祖先点的vis标记为2,为了下次其他点dfs到它就可以判断不会行成环,继续染成颜色1了,如果dfs的过程中,中途走回来遇到了祖先点,(即dis[to] == 1) 那么肯定要将此时的颜色染成2
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <functional>
#include <cmath>
#include <iomanip>
#include <numeric>
#include <string>
using namespace std;
typedef long long ll;
const int maxn = 5e3+5;
vector<pair<int, int>> G[maxn];
int color[maxn];
int vis[maxn];
bool t;
void dfs(int v) {
vis[v] = 1; //标记祖先点,等待dfs走到它以此判断是否行成了环
for (auto g : G[v]) {
int to = g.first, id = g.second;
if (vis[to] == 0) { //没走的点标记颜色1
dfs(to);
color[id] = 1; //必须要回溯的时候染色
}
else if (vis[to] == 1) { //行成环了,标记id边的颜色为2
color[id] = 2;
t = true;
}
else if (vis[to] == 2) { //不会行成环,可以放心标记成颜色1
color[id] = 1;
}
}
vis[v] = 2;
}
int main(void) {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].push_back(make_pair(b, i));
}
for (int i = 0; i < n; i++) {
if (vis[i] == 0) {
dfs(i); //从每个点开始都dfs一次
}
}
cout << (t? 2 : 1) << endl;
for (int i = 0; i < m; i++) {
cout << color[i] << " ";
}
cout << endl;
return 0;
}