【HDU】3663 Power Stations

#include<cstdio>
#include<cstring>
#define MAXN 400000
#define MAXM 70
#define INF 0x7FFFFFFF
bool G[MAXM][MAXM], vis[MAXM << 5];
int L[MAXN], R[MAXN], U[MAXN], D[MAXN];
int S[MAXN], C[MAXN], X[MAXN], H[MAXN];
int n, m, d, size, row[MAXM][10][10];
void Init(int x)
{
    int i, j, k, t;
    for (i = t = 1; i <= n; i++)
    {
        H[t] = -1;
        row[i][0][0] = t++;
        for (j = 1; j <= d; j++)
        {
            for (k = j; k <= d; k++)
            {
                H[t] = -1;
                row[i][j][k] = t++;
            }
        }
    }
    memset(vis, false, sizeof(vis));
    memset(G, false, sizeof(G));
    for (i = 0; i <= x; i++)
    {
        R[i] = i + 1;
        L[i + 1] = i;
        U[i] = D[i] = i;
        S[i] = 0;
    }
    R[x] = 0;
    size = x + 1;
}
void Link(int r, int c)
{
    U[size] = c;
    D[size] = D[c];
    U[D[c]] = size;
    D[c] = size;
    if (H[r] < 0)
        H[r] = L[size] = R[size] = size;
    else
    {
        L[size] = H[r];
        R[size] = R[H[r]];
        L[R[H[r]]] = size;
        R[H[r]] = size;
    }
    S[c]++;
    X[size] = r;
    C[size++] = c;
}
void Remove(int c)
{
    int i, j;
    L[R[c]] = L[c];
    R[L[c]] = R[c];
    for (i = D[c]; i != c; i = D[i])
    {
        for (j = R[i]; j != i; j = R[j])
        {
            S[C[j]]--;
            U[D[j]] = U[j];
            D[U[j]] = D[j];
        }
    }
}
void Resume(int c)
{
    int i, j;
    L[R[c]] = R[L[c]] = c;
    for (i = D[c]; i != c; i = D[i])
    {
        for (j = R[i]; j != i; j = R[j])
        {
            S[C[j]]++;
            U[D[j]] = D[U[j]] = j;
        }
    }
}
bool Dance()
{
    if (R[0] == 0)
        return true;
    int i, j, temp, c;
    for (temp = INF,i = R[0]; i; i = R[i])
    {
        if (temp > S[i])
        {
            temp = S[i];
            c = i;
        }
    }
    Remove(c);
    for (i = D[c]; i != c; i = D[i])
    {
        vis[X[i]] = true;
        for (j = R[i]; j != i; j = R[j])
            Remove(C[j]);
        if (Dance())
            return true;
        for (j = L[i]; j != i; j = L[j])
            Resume(C[j]);
        vis[X[i]] = false;
    }
    Resume(c);
    return false;
}
int main()
{
    int i, j, k, t, p, u, v;
    while (~scanf("%d%d%d", &n, &m, &d))
    {
        Init(n * d + n);
        while (m--)
        {
            scanf("%d%d", &u, &v);
            G[u][v] = G[v][u] = true;
        }
        for (i = 1; i <= n; i++)
        {
            G[i][i] = true;
            scanf("%d%d", &u, &v);
            Link(row[i][0][0], n * d + i);
            for (j = u; j <= v; j++)
            {
                for (k = j; k <= v; k++)
                {
                    for (t = 1; t <= n; t++)
                    {
                        if (G[i][t])
                        {
                            for (p = j; p <= k; p++)
                                Link(row[i][j][k], (t - 1) * d + p);
                        }
                    }
                    Link(row[i][j][k], n * d + i);
                }
            }
        }
        if (Dance())
        {
            for (i = 1; i <= n; i++)
            {
                for (j = 1; j <= d; j++)
                {
                    for (k = j; k <= d; k++)
                    {
                        if (vis[row[i][j][k]])
                        {
                            printf("%d %d\n", j, k);
                            break;
                        }
                    }
                    if (k <= d)
                        break;
                }
                if (j > d)
                    puts("0 0");
            }
        }
        else
            puts("No solution");
        putchar('\n');
    }
    return 0;
}