Code force-CodeCraft-20 (Div. 2) D. Nash Matrix 详解（DFS构造）

D. Nash Matrix time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Nash designed an interesting yet simple board game where a player is simply required to follow instructions written on the cell where the player currently stands.

This board game is played on the n×n board. Rows and columns of this board are numbered from 1 to n. The cell on the intersection of the r-th row and c-th column is denoted by (r,c).

Some cells on the board are called blocked zones. On each cell of the board, there is written one of the following 5 characters — U, D, L, R or X — instructions for the player. Suppose that the current cell is (r,c). If the character is R, the player should move to the right cell (r,c+1), for L the player should move to the left cell (r,c−1), for U the player should move to the top cell (r−1,c), for D the player should move to the bottom cell (r+1,c). Finally, if the character in the cell is X, then this cell is the blocked zone. The player should remain in this cell (the game for him isn’t very interesting from now on).

It is guaranteed that the characters are written in a way that the player will never have to step outside of the board, no matter at which cell he starts.

As a player starts from a cell, he moves according to the character in the current cell. The player keeps moving until he lands in a blocked zone. It is also possible that the player will keep moving infinitely long.

For every of the n2 cells of the board Alice, your friend, wants to know, how will the game go, if the player starts in this cell. For each starting cell of the board, she writes down the cell that the player stops at, or that the player never stops at all. She gives you the information she has written: for each cell (r,c) she wrote:

a pair (x,y), meaning if a player had started at (r,c), he would end up at cell (x,y). or a pair (−1,−1), meaning if a player had started at (r,c), he would keep moving infinitely long and would never enter the blocked zone. It might be possible that Alice is trying to fool you and there’s no possible grid that satisfies all the constraints Alice gave you. For the given information Alice provided you, you are required to decipher a possible board, or to determine that such a board doesn’t exist. If there exist several different boards that satisfy the provided information, you can find any of them.

Input The first line of the input contains a single integer n (1≤n≤103) — the side of the board.

The i-th of the next n lines of the input contains 2n integers x1,y1,x2,y2,…,xn,yn, where (xj,yj) (1≤xj≤n,1≤yj≤n, or (xj,yj)=(−1,−1)) is the pair written by Alice for the cell (i,j).

Output If there doesn’t exist a board satisfying the information that Alice gave you, print a single line containing INVALID.

Otherwise, in the first line print VALID. In the i-th of the next n lines, print the string of n characters, corresponding to the characters in the i-th row of the suitable board you found. Each character of a string can either be U, D, L, R or X. If there exist several different boards that satisfy the provided information, you can find any of them.

Examples inputCopy 2 1 1 1 1 2 2 2 2 outputCopy VALID XL RX inputCopy 3 -1 -1 -1 -1 -1 -1 -1 -1 2 2 -1 -1 -1 -1 -1 -1 -1 -1 outputCopy VALID RRD UXD ULL Note For the sample test 1 :

The given grid in output is a valid one.

If the player starts at (1,1), he doesn’t move any further following X and stops there. If the player starts at (1,2), he moves to left following L and stops at (1,1). If the player starts at (2,1), he moves to right following R and stops at (2,2). If the player starts at (2,2), he doesn’t move any further following X and stops there. The simulation can be seen below :

For the sample test 2 :

The given grid in output is a valid one, as a player starting at any cell other than the one at center (2,2), keeps moving in an infinitely long cycle and never stops. Had he started at (2,2), he wouldn’t have moved further following instruction X .

The simulation can be seen below :

题意： 给出n*n的网格，再给出每个点的终点，-1 -1为永不停止的运动，问你是否能构造出这样的地图。

思路: 先处理-1 -1的先找到一个环，然后找到所有的-1 -1 让他们进入循环，直到没有-1 -1或者存在不能处理的（IV…),然后处理其他的，如果最后还是存在不能处理的，就（IV）都处理完了，就输出。 主要就是先构造环的过程比较难想。然后只要-1 -1能连起来，就可以。 剩下的硬处理。

#include <bits/stdc++.h>
using namespace std;
template <typename t>
void read(t &x)
{
    char ch = getchar();
    x = 0;
    t f = 1;
    while (ch < '0' || ch > '9')
        f = (ch == '-' ? -1 : f), ch = getchar();
    while (ch >= '0' && ch <= '9')
        x = x * 10 + ch - '0', ch = getchar();
    x *= f;
}

#define wi(n) printf("%d ", n)
#define wl(n) printf("%lld ", n)
#define P puts(" ")
typedef long long ll;
#define MOD 1000000007
#define mp(a, b) make_pair(a, b)
#define N 20005
#define rep(i, j, n) for (int i = j; i <= n; i++)
#define red(i, n, j) for (int i = n; i >= j; i--)
#define fil(a, n) rep(i,0, n,) read(a[i])

//---------------https://lunatic.blog.csdn.net/-------------------//

const int maxn = 1e3 + 9;
pair<int,int> a[maxn][maxn];
char s[maxn][maxn];
int dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
char str1[5] = {'U', 'D', 'L', 'R'};
char str2[5] = {'D', 'U', 'R', 'L'};
int vis[maxn][maxn];
int n, flag = 1, flag1;
void dfs(int vax, int vay, int x, int y, int di)
{
    if (di == 0)
        s[x][y] = 'D';
    if (di == 1)
        s[x][y] = 'U';
    if (di == 2)
        s[x][y] = 'R';
    if (di == 3)
        s[x][y] = 'L';
    for (int i = 0; i < 4; i++)
    {
        int xx = x + dir[i][0];
        int yy = y + dir[i][1];
        if (xx < 1 || xx > n || yy < 1 || yy > n || vis[xx][yy] || a[xx][yy].first != vax || a[xx][yy].second != vay)
            continue;
        vis[xx][yy] = 1;
        dfs(vax, vay, xx, yy, i);
    }
}

void connect(int x, int y, int xx, int yy, char c, char st)
{
    s[x][y] = c;
    if (!vis[xx][yy])
        s[xx][yy] = st;
    vis[x][y] = vis[xx][yy] = 1;
}

int main()
{
    read(n);
    rep(i, 1, n)
    {
        rep(j, 1, n)
        {
            cin >> a[i][j].first >> a[i][j].second;
            if (a[i][j].first == i && a[i][j].second == j)
            {
                s[i][j] = 'X';
            }
        }
    }
    rep(i, 1, n)
    {
        rep(j, 1, n)
        {
            if (s[i][j] == 'X')
            {
                vis[i][j] = 1;
                dfs(a[i][j].first, a[i][j].second, i, j, -1);
            }
        }
    }
    rep(i, 1, n)
    {
        rep(j, 1, n)
        {
            if (a[i][j].first == -1 && !vis[i][j])
            {
                int flag = 0;
                for (int k = 0; k < 4; k++)
                {
                    int xx = i + dir[k][0];
                    int yy = j + dir[k][1];
                    if (xx < 1 || xx > n || yy < 1 || yy > n || a[xx][yy].first != -1)
                        continue;
                    connect(i, j, xx, yy, str1[k], str2[k]);
                    flag = 1;
                    break;
                }
                if (!flag)
                {
                    cout << "INVALID" << endl;
                    return 0;
                }
            }
        }
    }
    rep(i, 1, n)
    {
        rep(j, 1, n)
        {
            if (!vis[i][j])
            {
                cout << "INVALID" << endl;
                return 0;
            }
        }
    }
    cout << "VALID" << endl;
    rep(i, 1, n)
    {
        rep(j, 1, n)
        {
            cout << s[i][j];
        }
        cout << endl;
    }
}