Educational Codeforces Round 72 (Rated for Div. 2)D. Coloring Edges

链接

点击跳转

题解

构造

按照序号从小到大加入每个数，现在假设我要加入$i$这个结点，那么$i$到集合内的点的边为黑色，集合内的点到$i$的边为白色

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 5050
#define maxe 5050
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
struct Graph
{
    int etot, head[maxn], to[maxe], next[maxe], w[maxe];
    void clear(int N)
    {
        for(int i=1;i<=N;i++)head[i]=0;
        etot=0;
    }
    void adde(int a, int b, int c=0){to[++etot]=b;w[etot]=c;next[etot]=head[a];head[a]=etot;}
}G;
struct Trajan_SCC
{
    int dfn[maxn], low[maxn], vis[maxn], scc[maxn], tim, scc_cnt;
    stack<int> s;
    void clear(int n)
    {
        for(int i=1;i<=n;i++)vis[i]=0;
        tim=scc_cnt=0;
    }
    void dfs(Graph &G, int pos)
    {
        int p;
        dfn[pos]=low[pos]=++tim;
        s.emplace(pos);
        vis[pos]=1;
        for(p=G.head[pos];p;p=G.next[p])
        {
            if(vis[G.to[p]]==0)dfs(G,G.to[p]);
            if(vis[G.to[p]]==1)low[pos]=min(low[pos],low[G.to[p]]);
        }
        if(dfn[pos]==low[pos])
        {
            int x;
            scc_cnt++;
            do
            {
                x=s.top(), s.pop();
                scc[x]=scc_cnt;
                vis[x]=2;
            }
            while(x!=pos);
        }
    }
    void run(Graph &G, int n)
    {
        for(int i=1;i<=n;i++)if(!vis[i])dfs(G,i);
    }
}tarjan;
ll u[maxn], v[maxn], c[maxn], flag;
vector<ll> eout[maxn], ein[maxn];
int main()
{
    ll i, n, m;
    n=read(), m=read();
    G.clear(n);
    tarjan.clear(n);
    rep(i,m)
    {
        u[i]=read(), v[i]=read();
        G.adde(u[i],v[i]);
        eout[u[i]].emb(i);
        ein[v[i]].emb(i);
    }
    tarjan.run(G,n);
    if(tarjan.scc_cnt==n)
    {
        printf("1\n");
        rep(i,m)printf("1 ");
    }
    else
    {
        rep(i,n)
        {
            for(auto e:eout[i])if(v[e]<i)c[e]=1;
            for(auto e:ein[i])if(u[e]<i)c[e]=2;
        }
        printf("2\n");
        rep(i,m)printf("%lld ",c[i]);
    }
    return 0;
}