QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#256441#7751. Palindrome Pathucup-team1191#AC ✓109ms10984kbC++208.3kb2023-11-18 19:23:262023-11-18 19:23:27

Judging History

你现在查看的是最新测评结果

  • [2023-11-18 19:23:27]
  • 评测
  • 测评结果:AC
  • 用时:109ms
  • 内存:10984kb
  • [2023-11-18 19:23:26]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

#define y1 y1_

const int dx[4] = {0, -1, 0, 1};
const int dy[4] = {1, 0, -1, 0};
string MOVE = "RULD";

const int M = 30;
const int BIG = 1e9 + 239;

int n, m;
string s[M];
int x1, y1, x2, y2;

bool check(int i, int j) {
    return i >= 0 && i < n && j >= 0 && j < m && s[i][j] == '1';
}

bool used[M][M];

void dfs(int i, int j) {
    used[i][j] = true;
    for (int d = 0; d < 4; d++) {
        int ni = i + dx[d];
        int nj = j + dy[d];
        if (check(ni, nj) && !used[ni][nj]) {
            dfs(ni, nj);
        }
    }
}

int dist[M][M][M][M];
tuple<char, char, char, char, char> pr[M][M][M][M];

void solve() {
    cin >> n >> m;

    for (int i = 0; i < n; i++) {
        cin >> s[i];
    }

    int tot = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (s[i][j] == '1') {
                tot++;
            }
        }
    }
    if (tot == 1) {
        cout << "\n";
        return;
    }

    cin >> x1 >> y1 >> x2 >> y2;
    x1--;
    y1--;
    x2--;
    y2--;
    dfs(x1, y1);

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (s[i][j] == '1' && !used[i][j]) {
                cout << "-1\n";
                return;
            }
        }
    }

    memset(used, 0, sizeof(used));

    string ans;
    string btw;

    int non_used = tot;
    if (!used[x1][y1]) {
        used[x1][y1] = true;
        non_used--;
    }
    if (!used[x2][y2]) {
        used[x2][y2] = true;
        non_used--;
    }
    while (non_used > 0) {
        for (int a = 0; a < n; a++) {
            for (int b = 0; b < m; b++) {
                for (int c = 0; c < n; c++) {
                    for (int d = 0; d < m; d++) {
                        dist[a][b][c][d] = BIG;
                    }
                }
            }
        }

        int nx1 = -1;
        int ny1 = -1;
        int nx2 = -1;
        int ny2 = -1;

        dist[x1][y1][x2][y2] = 0;
        queue<tuple<int, int, int, int>> que;
        que.push(make_tuple(x1, y1, x2, y2));
        while (!que.empty()) {
            auto tp = que.front();
            que.pop();

            int i1 = get<0>(tp);
            int j1 = get<1>(tp);
            int i2 = get<2>(tp);
            int j2 = get<3>(tp);

            if (!used[i1][j1] || !used[i2][j2]) {
                nx1 = i1;
                ny1 = j1;
                nx2 = i2;
                ny2 = j2;
                break;
            }

            for (int d = 0; d < 4; d++) {
                int ni1 = i1 + dx[d];
                int nj1 = j1 + dy[d];
                if (!check(ni1, nj1)) {
                    ni1 = i1;
                    nj1 = j1;
                }
                int ni2 = i2 - dx[d];
                int nj2 = j2 - dy[d];
                if (check(ni2, nj2)) {
                    if (dist[ni1][nj1][ni2][nj2] > dist[i1][j1][i2][j2] + 1) {
                        dist[ni1][nj1][ni2][nj2] = dist[i1][j1][i2][j2] + 1;
                        que.push(make_tuple(ni1, nj1, ni2, nj2));
                        pr[ni1][nj1][ni2][nj2] = make_tuple(i1, j1, i2, j2, d);
                    }
                }
                if (!check(i2 + dx[d], j2 + dy[d])) {
                    ni2 = i2;
                    nj2 = j2;
                    if (dist[ni1][nj1][ni2][nj2] > dist[i1][j1][i2][j2] + 1) {
                        dist[ni1][nj1][ni2][nj2] = dist[i1][j1][i2][j2] + 1;
                        que.push(make_tuple(ni1, nj1, ni2, nj2));
                        pr[ni1][nj1][ni2][nj2] = make_tuple(i1, j1, i2, j2, d);
                    }
                }
            }
        }

        if (nx1 == -1) {
            cout << "-1\n";
            return;
        }

        string path;
        int i1 = nx1;
        int j1 = ny1;
        int i2 = nx2;
        int j2 = ny2;
        while (i1 != x1 || j1 != y1 || i2 != x2 || j2 != y2) {
            if (!used[i1][j1]) {
                used[i1][j1] = true;
                non_used--;
            }
            if (!used[i2][j2]) {
                used[i2][j2] = true;
                non_used--;
            }
            auto to = pr[i1][j1][i2][j2];
            path += MOVE[get<4>(to)];
            i1 = get<0>(to);
            j1 = get<1>(to);
            i2 = get<2>(to);
            j2 = get<3>(to);
        }
        reverse(path.begin(), path.end());
        ans += path;

        x1 = nx1;
        y1 = ny1;
        x2 = nx2;
        y2 = ny2;
    }

    {
        for (int a = 0; a < n; a++) {
            for (int b = 0; b < m; b++) {
                for (int c = 0; c < n; c++) {
                    for (int d = 0; d < m; d++) {
                        dist[a][b][c][d] = BIG;
                    }
                }
            }
        }

        int nx1 = -1;
        int ny1 = -1;
        int nx2 = -1;
        int ny2 = -1;

        dist[x1][y1][x2][y2] = 0;
        queue<tuple<int, int, int, int>> que;
        que.push(make_tuple(x1, y1, x2, y2));
        while (!que.empty()) {
            auto tp = que.front();
            que.pop();

            int i1 = get<0>(tp);
            int j1 = get<1>(tp);
            int i2 = get<2>(tp);
            int j2 = get<3>(tp);

            if (abs(i1 - i2) + abs(j1 - j2) == 1) {
                nx1 = i1;
                ny1 = j1;
                nx2 = i2;
                ny2 = j2;
                break;
            }

            for (int d = 0; d < 4; d++) {
                int ni1 = i1 + dx[d];
                int nj1 = j1 + dy[d];
                if (!check(ni1, nj1)) {
                    ni1 = i1;
                    nj1 = j1;
                }
                int ni2 = i2 - dx[d];
                int nj2 = j2 - dy[d];
                if (check(ni2, nj2)) {
                    if (dist[ni1][nj1][ni2][nj2] > dist[i1][j1][i2][j2] + 1) {
                        dist[ni1][nj1][ni2][nj2] = dist[i1][j1][i2][j2] + 1;
                        que.push(make_tuple(ni1, nj1, ni2, nj2));
                        pr[ni1][nj1][ni2][nj2] = make_tuple(i1, j1, i2, j2, d);
                    }
                }
                if (!check(i2 + dx[d], j2 + dy[d])) {
                    ni2 = i2;
                    nj2 = j2;
                    if (dist[ni1][nj1][ni2][nj2] > dist[i1][j1][i2][j2] + 1) {
                        dist[ni1][nj1][ni2][nj2] = dist[i1][j1][i2][j2] + 1;
                        que.push(make_tuple(ni1, nj1, ni2, nj2));
                        pr[ni1][nj1][ni2][nj2] = make_tuple(i1, j1, i2, j2, d);
                    }
                }
            }
        }

        if (nx1 == -1) {
            cout << "-1\n";
            return;
        }

        if (!(nx1 == nx2 && ny1 == ny2)) {
            for (int d = 0; d < 4; d++) {
                if (nx2 == nx1 + dx[d] && ny2 == ny1 + dy[d]) {
                    btw += MOVE[d];
                    break;
                }
            }
        }

        string path;
        int i1 = nx1;
        int j1 = ny1;
        int i2 = nx2;
        int j2 = ny2;
        while (i1 != x1 || j1 != y1 || i2 != x2 || j2 != y2) {
            if (!used[i1][j1]) {
                used[i1][j1] = true;
                non_used--;
            }
            if (!used[i2][j2]) {
                used[i2][j2] = true;
                non_used--;
            }
            auto to = pr[i1][j1][i2][j2];
            path += MOVE[get<4>(to)];
            i1 = get<0>(to);
            j1 = get<1>(to);
            i2 = get<2>(to);
            j2 = get<3>(to);
        }
        reverse(path.begin(), path.end());
        ans += path;

        x1 = nx1;
        y1 = ny1;
        x2 = nx2;
        y2 = ny2;
    }

    {
        string res;
        res += ans;
        res += btw;
        reverse(ans.begin(), ans.end());
        res += ans;
        assert(res.size() <= 1'000'000);
        cout << res << "\n";
    }
}

int main() {
#ifdef ONPC
    freopen("input", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}

这程序好像有点Bug,我给组数据试试?

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 5520kb

input:

2 2
11
11
1 1 2 2

output:

RLDLR

result:

ok Valid Solution (Length = 5).

Test #2:

score: 0
Accepted
time: 0ms
memory: 3452kb

input:

2 2
10
01
1 1 2 2

output:

-1

result:

ok No Solution.

Test #3:

score: 0
Accepted
time: 0ms
memory: 3328kb

input:

1 1
1
1 1 1 1

output:



result:

ok Valid Solution (Length = 0).

Test #4:

score: 0
Accepted
time: 1ms
memory: 7576kb

input:

5 4
1111
1111
1111
1111
1111
4 2 4 2

output:

RULLLDDDRRRDLLLRUURUURLLLDRRRDDDLLLUR

result:

ok Valid Solution (Length = 37).

Test #5:

score: 0
Accepted
time: 1ms
memory: 5508kb

input:

5 5
11111
10101
11111
10101
11111
1 4 5 5

output:

RRRRDDLLUULLDDRRRRRDDLLUULLDDRRRR

result:

ok Valid Solution (Length = 33).

Test #6:

score: 0
Accepted
time: 0ms
memory: 5468kb

input:

5 3
111
100
111
001
111
4 3 3 2

output:

RDLLDLLRRUULLLUURRLLDLLDR

result:

ok Valid Solution (Length = 25).

Test #7:

score: 0
Accepted
time: 1ms
memory: 5552kb

input:

5 4
1001
1101
1111
0011
0010
2 2 1 1

output:

UULLUUDLDDDRRRUUURRRDDDLDUULLUU

result:

ok Valid Solution (Length = 31).

Test #8:

score: 0
Accepted
time: 1ms
memory: 5472kb

input:

5 3
101
111
100
111
100
4 1 2 2

output:

RURUUDDDDULLDUURRURRUUDLLUDDDDUURUR

result:

ok Valid Solution (Length = 35).

Test #9:

score: 0
Accepted
time: 1ms
memory: 5528kb

input:

5 5
01110
10110
11110
11011
11100
2 4 5 1

output:

LLURDRDLRDRULLDDRLULULULRDDLLURDRLDRDRULL

result:

ok Valid Solution (Length = 41).

Test #10:

score: 0
Accepted
time: 0ms
memory: 5480kb

input:

5 3
011
111
110
111
011
3 1 2 1

output:

LRUULRDULULDRDDLDDRDLULUDRLUURL

result:

ok Valid Solution (Length = 31).

Test #11:

score: 0
Accepted
time: 1ms
memory: 5512kb

input:

4 5
11111
11111
11111
11111
3 2 1 3

output:

RRUUULLLLDRRRRULLDDDLLURRRRDLLLLUUURR

result:

ok Valid Solution (Length = 37).

Test #12:

score: 0
Accepted
time: 1ms
memory: 7660kb

input:

5 5
11111
10101
11111
10101
11111
2 5 1 1

output:

UUUULLLLDDRRUUDDDDDUURRDDLLLLUUUU

result:

ok Valid Solution (Length = 33).

Test #13:

score: 0
Accepted
time: 0ms
memory: 7504kb

input:

4 5
11111
10000
11111
00001
1 3 4 5

output:

RRDRRRRDDLRLLLLLRLDDRRRRDRR

result:

ok Valid Solution (Length = 27).

Test #14:

score: 0
Accepted
time: 0ms
memory: 3392kb

input:

3 5
10100
00010
00111
1 3 1 1

output:

-1

result:

ok No Solution.

Test #15:

score: 0
Accepted
time: 1ms
memory: 5484kb

input:

4 5
10001
11111
11100
11111
4 5 3 1

output:

ULLDRDRDULLLLDURRURRUDLLLLUDRDRDLLU

result:

ok Valid Solution (Length = 35).

Test #16:

score: 0
Accepted
time: 1ms
memory: 5488kb

input:

3 5
11111
10100
11111
1 2 3 5

output:

RRRRDDLLUDULLDDRRRR

result:

ok Valid Solution (Length = 19).

Test #17:

score: 0
Accepted
time: 0ms
memory: 3444kb

input:

4 5
01110
10101
11011
10111
1 3 2 3

output:

-1

result:

ok No Solution.

Test #18:

score: 0
Accepted
time: 0ms
memory: 5592kb

input:

5 5
11111
11111
11111
11111
11111
1 3 5 2

output:

RDLLULLDRDRRRUULLDDDDDLLUURRRDRDLLULLDR

result:

ok Valid Solution (Length = 39).

Test #19:

score: 0
Accepted
time: 1ms
memory: 5544kb

input:

5 5
11111
10101
11111
10101
11111
5 1 2 3

output:

RRRRURRUULULLLDLDRRURRDDDRRURRDLDLLLULUURRURRRR

result:

ok Valid Solution (Length = 47).

Test #20:

score: 0
Accepted
time: 0ms
memory: 7576kb

input:

5 5
11111
10000
11111
00001
11111
4 5 5 3

output:

RRULLLLDURURRRLLLLRRRRLLLLDDRRRRRDDLLLLRRRRLLLLRRRURUDLLLLURR

result:

ok Valid Solution (Length = 61).

Test #21:

score: 0
Accepted
time: 1ms
memory: 3476kb

input:

5 5
01010
10101
10101
11001
10011
4 1 5 4

output:

-1

result:

ok No Solution.

Test #22:

score: 0
Accepted
time: 1ms
memory: 5580kb

input:

5 5
10101
11111
10101
11111
11111
3 1 2 4

output:

RRRDRRRRUUUULLLLRRDDDDUULULULUUDDDDRRLLLLUUUURRRRDRRR

result:

ok Valid Solution (Length = 53).

Test #23:

score: 0
Accepted
time: 1ms
memory: 9600kb

input:

5 5
00001
11111
01110
01111
01111
1 5 5 2

output:

LLLDRRRLLLRDRRDRLULLLULRDRRDRLLLRRRDLLL

result:

ok Valid Solution (Length = 39).

Test #24:

score: 0
Accepted
time: 0ms
memory: 3416kb

input:

5 5
01011
10111
11011
10101
01110
4 1 2 3

output:

-1

result:

ok No Solution.

Test #25:

score: 0
Accepted
time: 0ms
memory: 5720kb

input:

10 8
11111111
11111111
11111111
11111111
11111111
11111111
11111111
11111111
11111111
11111111
7 7 3 6

output:

RRRRRUUUUUUULLLLLLLDRRRRRRDLLLLLLRDRRRRRDLLLLLLRRRRDRRRRLLLLLLDRRRRRDRLLLLLLDRRRRRRDLLLLLLLUUUUUUURRRRR

result:

ok Valid Solution (Length = 103).

Test #26:

score: 0
Accepted
time: 1ms
memory: 5640kb

input:

10 6
111111
101010
111111
101010
111111
101010
111111
101010
111111
101010
1 6 2 3

output:

URRUUUUUUULLLLLDLLUDLLUDLRDDRRRLUDDRRRRRLUURLUDLLDLLLRDRRDRRDRLLLDLLDULRUULRRRRRDDULRRRDDRLDULLDULLDLLLLLUUUUUUURRU

result:

ok Valid Solution (Length = 115).

Test #27:

score: 0
Accepted
time: 1ms
memory: 5708kb

input:

10 10
1111111111
1000000000
1111111111
0000000001
1111111111
1000000000
1111111111
0000000001
1111111111
1000000000
5 5 5 2

output:

RURRRRULULLLLLLLLUURRRRRRRRRUDDLLLLLLLRRRRRRRUULLLLLLLLLDUDUURRRRRRRRRDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDRRRRRRRRRUUDUDLLLLLLLLLUURRRRRRRLLLLLLLDDURRRRRRRRRUULLLLLLLLULURRRRUR

result:

ok Valid Solution (Length = 195).

Test #28:

score: 0
Accepted
time: 1ms
memory: 3388kb

input:

10 10
1010110101
0000011010
1001001001
0011111000
1000111100
1011101001
1100110011
0110001011
0011111000
0101011101
7 5 4 3

output:

-1

result:

ok No Solution.

Test #29:

score: 0
Accepted
time: 1ms
memory: 7680kb

input:

10 6
100100
111111
100001
111111
101111
111111
101010
111111
111100
111111
6 5 7 3

output:

RURRUULLLLULRRDRRDLLLLRDRRLDLRRRRRUDDDDDLLLDURRRDUULULLLLLULUUDRRRUDLLLDDDDDURRRRRLDLRRDRLLLLDRRDRRLULLLLUURRUR

result:

ok Valid Solution (Length = 111).

Test #30:

score: 0
Accepted
time: 1ms
memory: 5680kb

input:

10 8
11111110
11110111
01111111
11111101
11011101
11111111
11111011
11011101
11001111
11111110
7 1 2 1

output:

LRDLLUURURUULLULULUURRRRDLDDRDLLLLUULUULDLDDRDRDRRLLDDLLUUUDDDDRRDLURUURRUUURRUURULDRRDDDDUUULLDDLLRRDRDRDDLDLUULUULLLLDRDDLDRRRRUULULULLUURURUULLDRL

result:

ok Valid Solution (Length = 149).

Test #31:

score: 0
Accepted
time: 0ms
memory: 3392kb

input:

10 10
1111011101
1110111110
1111011111
1011101111
0101010111
1110111111
0111010111
1011111011
0111010101
1011111110
2 6 7 4

output:

-1

result:

ok No Solution.

Test #32:

score: 0
Accepted
time: 1ms
memory: 5764kb

input:

8 10
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
8 10 6 10

output:

RRRRRRRRRUULLLLLLLLDRRRDDRRRRRDLLLLLLULLLDRRDRRRRRRRDLLLLLLLLULDDRRRRRRRRRUUULLLLLULLLLLUUURRRRRRRRRDDLULLLLLLLLDRRRRRRRDRRDLLLULLLLLLDRRRRRDDRRRDLLLLLLLLUURRRRRRRRR

result:

ok Valid Solution (Length = 165).

Test #33:

score: 0
Accepted
time: 1ms
memory: 7792kb

input:

10 10
1111111111
1010101010
1111111111
1010101010
1111111111
1010101010
1111111111
1010101010
1111111111
1010101010
3 5 9 1

output:

UDLLUDLLUDLLUDLLUDLDDRRRRRRRRRDDLUURDLUURLLLLLLLLLDLLUDLLUDLLUDLLUDLRDRRDDDRRRRUUUULLDDDDDUURURRRURUUDDDDDLLUUUURRRRDDDRRDRLDULLDULLDULLDULLDLLLLLLLLLRUULDRUULDDRRRRRRRRRDDLDULLDULLDULLDULLDU

result:

ok Valid Solution (Length = 191).

Test #34:

score: 0
Accepted
time: 1ms
memory: 5692kb

input:

10 10
1111111111
1000000000
1111111111
0000000001
1111111111
1000000000
1111111111
0000000001
1111111111
1000000000
5 4 7 2

output:

RDRRRRRULULLLLLLLLUURRRRRRRRRULLLLLLLLLDUDUURRRRRRRRRDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDDRRRRRRRRRDDLLLLLLLLLDRRRRRRRRRUUDUDLLLLLLLLLURRRRRRRRRUULLLLLLLLULURRRRRDR

result:

ok Valid Solution (Length = 161).

Test #35:

score: 0
Accepted
time: 1ms
memory: 3444kb

input:

9 10
1111001000
1110010111
0001001000
0101000101
1101000001
0111100110
0010010000
0001001000
1011001101
2 8 5 2

output:

-1

result:

ok No Solution.

Test #36:

score: 0
Accepted
time: 1ms
memory: 5592kb

input:

5 10
1001011101
1111111111
1000011001
1111111111
1101110010
4 3 4 7

output:

RRURDRRRULRDDDLLLLLULDLLLUURRLURRDUDRRRURRLLRRDRRURDDDDUULLLLLLLLLUUDDDDRURRDRRLLRRURRRDUDRRULRRUULLLDLULLLLLDDDRLURRRDRURR

result:

ok Valid Solution (Length = 123).

Test #37:

score: 0
Accepted
time: 0ms
memory: 3388kb

input:

7 10
1111111001
1111101110
1111011111
1101011101
1111011111
1111001011
1111111011
7 10 7 2

output:

-1

result:

ok No Solution.

Test #38:

score: 0
Accepted
time: 1ms
memory: 5784kb

input:

9 10
0101011101
1111111111
0101111111
1111111111
1111110101
1011111111
1101111101
1111111011
1101011111
3 7 7 10

output:

RRRURURRRDRRRRRULDLLULLDRRDRDRDLLULULLLUDLDRRRDRDRRRLDDRLLLULUDDRDURRDURURDDDLLLUUUULLLUUUULLLDDDRURUDRRUDRDDULULLLRDDLRRRDRDRRRDLDULLLULULLDRDRDRRDLLULLDLURRRRRDRRRURURRR

result:

ok Valid Solution (Length = 171).

Test #39:

score: 0
Accepted
time: 1ms
memory: 7936kb

input:

10 10
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
9 5 3 2

output:

RUUUUUUULLLLLLLLLDRRRRDRRRRRUULLLDRRDDRDLLULLLLULLLDRRRDRDDDDDRRRRRLLLLLLLLLRRRRUUUUURUUUUURRRRLLLLLLLLLRRRRRDDDDDRDRRRDLLLULLLLULLDRDDRRDLLLUURRRRRDRRRRDLLLLLLLLLUUUUUUUR

result:

ok Valid Solution (Length = 171).

Test #40:

score: 0
Accepted
time: 2ms
memory: 9580kb

input:

10 10
1111111111
1010101010
1111111111
1010101010
1111111111
1010101010
1111111111
1010101010
1111111111
1010101010
2 1 1 3

output:

RRUUUUUUUUUDLLUDLLUDLLUDLLUDLRDRRRRRRRRRDRRRRRRRLUURLLLLLLRDDDDRRRRRLUDDDRLDUUULLUUUUULLDDDDDDDDDLLUUUUULLUUUDLRDDDULRRRRRDDDDRLLLLLLRUULRRRRRRRDRRRRRRRRRDRLDULLDULLDULLDULLDUUUUUUUUURR

result:

ok Valid Solution (Length = 185).

Test #41:

score: 0
Accepted
time: 0ms
memory: 5736kb

input:

10 10
1111111111
1000000000
1111111111
0000000001
1111111111
1000000000
1111111111
0000000001
1111111111
1000000000
7 4 3 5

output:

RRRRDRRDLLLLLLLLLDRLRRLLRRRLLLRRRRLLLLRRRRRLLLLLRRRRRRLLLLLLRRRRRRRLLLLLLLRRRRRRRRRUULLLLLLLLLUURRRRLLLLDDRRRRRRRRRDDLLLLLLLLLDURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUULLLLLLLLLUURRRRRRRRRUDLLLLLLLLLDDRRRRRRRRRDDLLLLRRRRUULLLLLLLLLUURRRRRRRRRLLLLLLLRRRRRRRLLLLLLRRRRRRLLLLLRRRRRLLLLRRRRLLLRRRLLRRLRDLLLLLLLL...

result:

ok Valid Solution (Length = 309).

Test #42:

score: 0
Accepted
time: 1ms
memory: 3448kb

input:

10 10
1110000101
1100110001
1011011001
0000000111
0010010111
0100111011
1110010011
1100111111
0110001110
0100000101
9 9 6 10

output:

-1

result:

ok No Solution.

Test #43:

score: 0
Accepted
time: 2ms
memory: 9792kb

input:

10 10
1110111011
1111111111
1110110000
1111111111
1010011100
1111111111
1111001110
1111111111
1001010011
1111111111
6 9 2 9

output:

RRRRRRRRUUUUUUUULLUURRLLLLULLLLLDRDRRRRRRRDLLDRRRDLLDLLURDLRDRDDRLLULLDLLULLLDRLUUUURRRDDRRRULUULULULUULURRRDDRRRUUUULRDLLLULLDLLULLRDDRDRLDRULLDLLDRRRDLLDRRRRRRRDRDLLLLLULLLLRRUULLUUUUUUUURRRRRRRR

result:

ok Valid Solution (Length = 197).

Test #44:

score: 0
Accepted
time: 0ms
memory: 9596kb

input:

10 10
1111110011
1011111110
0111011111
1101101101
1111111110
1110111101
1011011111
1111111101
1011111101
1111111011
7 3 5 5

output:

RRRRUUUUULULLLLLDRRRRDRLLLLLLUDDRRDRLLLDRRRDRDRRURLDLDLLLULULDLLUDRDRRRDRRRRRUDUURRDUUDDDLDLULLLLLLDLRURUUULRUULLDLLUURLUUURURLDLLLLLLULDLDDDUUDRRUUDURRRRRDRRRDRDULLDLULULLLDLDLRURRDRDRRRDLLLRDRRDDULLLLLLRDRRRRDLLLLLULUUUUURRRR

result:

ok Valid Solution (Length = 227).

Test #45:

score: 0
Accepted
time: 0ms
memory: 3436kb

input:

10 10
1101011101
1110111011
0101110101
1111101011
1111111111
1010111010
0111111101
1111101011
0111111101
1011101111
3 8 2 2

output:

-1

result:

ok No Solution.

Test #46:

score: 0
Accepted
time: 3ms
memory: 8000kb

input:

20 12
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
111111111111
16 8 13 12

output:

RRRRRRRRRRRUUUUUUULLLLLLLLLLLDRRRRRRRRRRDLLLLLLLLLLDRRRRRRRRRRDLLLLLDRRRRRDLLLDDDDDDRRRRDLLLLLULLLLLLDRRRRRDRRRRRRDLLLLLLLULLLLDRRRDRRRRRRRRDLLLLLLLLLULLDRDRRRRRRRRRRDLLLLLLLLLLLURRRRRRUUUUUUUUUUUUUUUUURRRRRRULLLLLLLLLLLDRRRRRRRRRRDRDLLULLLLLLLLLDRRRRRRRRDRRRDLLLLULLLLLLLDRRRRRRDRRRRRDLLLLLLULLLLLDR...

result:

ok Valid Solution (Length = 387).

Test #47:

score: 0
Accepted
time: 6ms
memory: 8528kb

input:

20 17
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
11111111111111111
10101010101010101
111111...

output:

RRRRRRRRRRRUUUUUUUUUUUUUULLLLLLLLLLLLLLLLDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDDRRRRRRRRRRRRRRRDRRRRRRRRRRRRRRRLULUDDDRDRLLLULUUULLDDDLLUUULLDDDLLUUULLDDDLLUUULLDDDLLUUULLDDDLLUUUDLLDDRDRRRRRRRRRDRDDRRRDRURRRRRUDDDLLUUUUUULLDDDDDDRRDLLUUUDLLLLUDLLUDLLUDLLUDLLUULLUDDDRLDLLLLUULLUUUULLDDDDRRDDRRDURRDULLLLL...

result:

ok Valid Solution (Length = 707).

Test #48:

score: 0
Accepted
time: 4ms
memory: 6080kb

input:

20 19
1111111111111111111
1000000000000000000
1111111111111111111
0000000000000000001
1111111111111111111
1000000000000000000
1111111111111111111
0000000000000000001
1111111111111111111
1000000000000000000
1111111111111111111
0000000000000000001
1111111111111111111
1000000000000000000
11111111111111...

output:

RRRRRRRRRRRLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLLLLLUDUURRRRRRRRRRRRRRRRRRLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRDDLLLLLLLL...

result:

ok Valid Solution (Length = 481).

Test #49:

score: 0
Accepted
time: 0ms
memory: 3480kb

input:

20 16
0101001111110001
0000111101001011
0000111100011001
1101110100110100
1011011110001101
1101000110111111
0111010111100101
1101101111011001
1101010100000101
1111001000110010
0001011000101000
0101111010110110
0001101111000111
1010100010000110
0100100011011100
0100100101011111
0001000001001110
10011...

output:

-1

result:

ok No Solution.

Test #50:

score: 0
Accepted
time: 8ms
memory: 8640kb

input:

20 18
100101011111011110
111111111111111111
101111101010000001
111111111111111111
110010011011001010
111111111111111111
110110111110000010
111111111111111111
100001000001111000
111111111111111111
100010100111111000
111111111111111111
111100011010110111
111111111111111111
111101010111011110
111111111...

output:

RRRRRRRRRRRRRUUUUUUUUUUUUUUUULLLLURDRRDLLLLLUURLLLLLURDDRRUDDRRRRDRRRRRRDLLDRRDRDLLULDLLULLUURRRLUUURRRRRURRDRLLLUURRRLULLLURLUURLLLDDRLLLLULDLLUULLUURRRRRRRRRRRDULLURLLLDLLULLLLRDDDLDDLLLUULURRUUDLLULLRDLDRRRDDLLLRRDRDRRRRRRDLULDLLDRRDRRRRRDLLDLULLLLLUULULULLUDDDRRRDRDDLLLLDLDDLLUULLRRRRDDLDLRURRRD...

result:

ok Valid Solution (Length = 673).

Test #51:

score: 0
Accepted
time: 6ms
memory: 9664kb

input:

20 16
1110111111111111
1111111001111111
1111110111111011
1111110011111111
1111111111011111
1111110111101111
1111011111111111
1101111111111111
1011111111111001
0111111011111111
1110111111111111
1111111111111111
1111011011111111
0101110111111111
1110111101111110
1111111111111111
1111111111011111
11111...

output:

RRRRURUULUURUUUUULLLLLLLLLLLLLLDRDRRRRRRRRRRRRURLLLLULLDRDRRRDRDRLLLULLLUULLLLRDDRRDRRRRRRURUULDLLRDDDRRUDLLRDRRRRRRUUUUUULLLLDRDRRUDDLLLURDDRRDRDDLLULULLLDLLUURLLLULLLULUDDDRRRDRRDRDRDRRRRRRRDLDRLLLULLLLULLULULLULDLDRRRRDRRURUDRURRDDLDDDRRRDRLDDRRRUUDLDLDRRDLLUULUUURRUUUUUUURLDDDDLDDDLLLLDLLLDLLLLD...

result:

ok Valid Solution (Length = 585).

Test #52:

score: 0
Accepted
time: 0ms
memory: 3432kb

input:

20 18
110111110101110101
101010111110101010
110101111101111101
111011111011101111
010111110111111101
111011111011111011
011111110111010111
101110101010111010
010111110101110111
101010101011101110
011101110111011111
101010111011111010
010101111111110101
101011101110111011
110101011101010101
101010101...

output:

-1

result:

ok No Solution.

Test #53:

score: 0
Accepted
time: 5ms
memory: 9788kb

input:

14 20
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
...

output:

RRRRRDRRRRRRRULLLLLDDRRRRRDLLLLLLUURRRRRRULLLLLLDDDDRRRRRRDLLLLLLLULLLLLLLUUUULLLLLDRRRRDLLLLDRRRRDLLLLDRRRRRRRRRRRDRRRRRRRRDLLLLLLLLLULLLLLLLLLLDRRRRRRRRRDRRRRRRRRRRDLLLLLLLLLLLULLLLLLLLDRRRRRRRDRRRRRRRRRRRRDLLLLLLLLLLLLLULLLLLLDRRRRRDRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLULLLLDRRRRRRRRRUUUUUUURUUUUUUURRRR...

result:

ok Valid Solution (Length = 577).

Test #54:

score: 0
Accepted
time: 7ms
memory: 8560kb

input:

19 20
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
...

output:

RRRRRRRRRRRRRRRRRRRURRRRRRRRRRRRRRUUUUUUUULLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRLULDDRDRLLLULUULLDDRRDLLUUUDLLUDDDRDRRRDDRURRLUDDDRLLLUULLUDLLUULLUDLLUDLLUDLLUDLLUDLLUDDDRRRRRRRRRRRRDDRRRRDLLUUULLDLLLLUULLUDLLUDLLUDLLUDLLUDLLUDLRDDRRRRRRRRRRRRDDRRRRDRRRRRLUDDDRDRRULLLUDLLUDLLUUUULLUUUULLDDDDRRDDDD...

result:

ok Valid Solution (Length = 809).

Test #55:

score: 0
Accepted
time: 1ms
memory: 5704kb

input:

10 20
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
5 6 8 20

output:

RRRRRRRRRRRRRRURRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLDUDUURRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRUUDUDLLLLLLLLLLLLLLLLLLLURRRRRRRRRRRRRRRRRRRURRRRRRRRRRRRRR

result:

ok Valid Solution (Length = 261).

Test #56:

score: 0
Accepted
time: 0ms
memory: 3396kb

input:

18 20
11011110100011011100
01100010001011110000
11100110001011101110
10110111100011001111
10100011111011110011
00001010110000010010
01101101100110010001
10001000111110000100
11000011001000001001
10101011101010100110
01111011011010100001
00010110000101101011
10110101011011000011
00110010111011000100
...

output:

-1

result:

ok No Solution.

Test #57:

score: 0
Accepted
time: 6ms
memory: 8644kb

input:

20 20
10101101000110011011
11111111111111111111
10110101010011101111
11111111111111111111
11010000010101011110
11111111111111111111
10100110101011011011
11111111111111111111
10010101101010101001
11111111111111111111
11101001101101101010
11111111111111111111
11100110110111110111
11111111111111111111
...

output:

URRRRRRURRRRRUUULUURLLLUURRRDDLLLLLUURURURRRDLUUULURLURLLULLLLLLLLLLLLLLLLLDRDRRRRRRRRRRRRDDLDLLUURURRRULLLLUULLDDLDLLDRRRRDDRRRRRRRRRRULDDRDLLUDLLLULDLLULULLUURLLUURRDLULULDLLLLURDRLDRDRRUDDDRRRDRDLDLLULULULLULULLLURRDDLLDRRRRDDRRDRRDRDRRRRRRRRRRULLDLDDRRRUDDDLLULDLLLUURLUDLLULDLRDDRRURDRRDDRRRULRD...

result:

ok Valid Solution (Length = 789).

Test #58:

score: 0
Accepted
time: 7ms
memory: 9912kb

input:

18 20
11111111111110111111
01111111111011111111
01111111111110011111
11111111111101111111
11111011111110111111
11111111111110111110
11111111111111011111
11011111111111111110
11110111111111001111
10111111110110111111
11111011111111111111
11111111111011101111
11101111001111111111
11111111111111111111
...

output:

RRRRRRRRDLDRDLLULDLLUULDLDRDRRRRRRUDDLLDRRDLLLULULLLULULLLUUULLLLLLLLDRRRRRRRRRRURRRRRRRRRDLDRDLLULDLLUULLDRDLLULDLLLULLLLDUUULLDDDLRDRDDRURRUURUURRRULLLLLLLDUURLLLDUURRDUURRRRRRRRRRRRDRURRRRDLDRLLLRRRRULLLULURRLLURRLLURRLLURRLLURRLLURRLLURRLLLDLLDLLULLLLLLLLLDRRRRRRRRDRRDRDLLULLUDLLULLLLLDRRRDRRRRR...

result:

ok Valid Solution (Length = 871).

Test #59:

score: 0
Accepted
time: 1ms
memory: 3432kb

input:

13 20
11011101111111110111
11111110111010111111
11111111111101011101
10111010101111111010
01011101111111010111
10101011101110101110
01111101010101011111
11111011111110101011
11110111111111011111
11111010101011101011
01111111110101011111
10111010101011111110
11111111110111011101
12 16 1 20

output:

-1

result:

ok No Solution.

Test #60:

score: 0
Accepted
time: 6ms
memory: 9692kb

input:

20 20
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
11111111111111111111
...

output:

RRRRRRRRRRRRRRRUUUUUUUUUUUUUUULLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRLLLLLLLLLLDLLLLLLLLLLRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRDLLLL...

result:

ok Valid Solution (Length = 459).

Test #61:

score: 0
Accepted
time: 4ms
memory: 8516kb

input:

20 20
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
11111111111111111111
10101010101010101010
...

output:

RRRRRRRRRRRRRRRRUUUUUUUUUUUUUUUUULDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLDRDDRRRRRRRRRRRRRRRRRLUUUDLLUDDDRRDDRLLLUULLUUUDLLUDLLUDLLUDLLUDLLUDLLUDLRDDRRRRRRRRRRRRDDRRDDRRRLUDDDRLLLUULLUULLUUUULLDDDDRRDDRRDDRRDDDDDDRRRLDDDDRRULLUUUULLUULLULULULUUUUUURRRRRRRRRRRLUURLUURLLLLLLLLLLLLLLLLRDDDDRRRRUUUURRDDD...

result:

ok Valid Solution (Length = 745).

Test #62:

score: 0
Accepted
time: 3ms
memory: 8424kb

input:

20 20
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
11111111111111111111
00000000000000000001
11111111111111111111
10000000000000000000
...

output:

RDRRRRRRRRDLLLLLLLLLLLLLLLLLLLDRLRRLLRRRLLLRRRRLLLLRRRRRLLLLLRRRRRRLLLLLLRRRRRRRLLLLLLLRRRRRRRRLLLLLLLLRRRRRRRRRLLLLLLLLLRRRRRRRRRRLLLLLLLLLLRRRRRRRRRRRLLLLLLLLLLLRRRRRRRRRRRRRRRRRRRUULLLLLLLLLRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRUDLDLLLLLLLLLLLLLLLLLLRRRRRRRRRRRRRRRRRRRLLLLLLLLLLLLLLL...

result:

ok Valid Solution (Length = 1169).

Test #63:

score: 0
Accepted
time: 1ms
memory: 3400kb

input:

20 20
11110100001010101100
10110001101110101000
01011110111010110000
10111001001011011100
00110111011000010101
01001111110001010010
00101001010111010111
10110100100010001000
10101010001110000010
01111111010110101011
00100101001111000101
00110001001001111000
10101110010001000010
00000100010000110000
...

output:

-1

result:

ok No Solution.

Test #64:

score: 0
Accepted
time: 6ms
memory: 9724kb

input:

20 20
11010001010100101010
11111111111111111111
11000010111011001011
11111111111111111111
10010100111100111110
11111111111111111111
11101100001110000111
11111111111111111111
11010100111101000011
11111111111111111111
11010011111100110100
11111111111111111111
10001011110000111010
11111111111111111111
...

output:

RRRRRDLDRDLLULUULLLLLLLULLLLLLLLLDRDRRRRRRRRRRRRRRLULLUDLLLLUDLLULDDRDRRRRRRRRRRRRRRDRRRDRDRLLULDLLUDLLLLURLLLDRDDRRRRRRRRUDDDLLLLULUULDLDRDLLULLLLUURRLLLLULLLLUUURRDURULLDDDDRRUDRDDRRRRDRRRDRLLLLLLLLLUULLLLLRDDRRRULRDDRDRRRRRRRRRRRRRRULDDRDLLLUUURRURURDUDRRULDRRUDDDDDLLDRRDDDDLLLRRDURRUULLLLLLDLDLL...

result:

ok Valid Solution (Length = 779).

Test #65:

score: 0
Accepted
time: 8ms
memory: 9868kb

input:

20 20
11111111111101111111
11111111111111111101
11111110111110111111
11111011110111111111
11010010110111111011
11111111111111101111
11111111111111111111
11111111111111111001
11111111011110111111
11111111111111111101
11101011111111111111
11111110111111101111
11111111111111111101
10111111111111100111
...

output:

UUUUUUUURRRRRRRRUUUUULULLLLLLLLLLLLLLDLRDRRRRRRRRRRRRRRURLLLDDRRDLLLURULLULLLDDRDRRRDRRDLLLLULDLLULUURLLLLLLLULUULLDRDLDRRDRRRRRRDLLLLLLDLRDRRRRRRRRRRRRRRRRDRDLLULLLLDLLULLLLLLDRRRRRDRRRRRRRRDLULLURRRRUUURUURRRULLLLDDRRLLULDLLDDLLLLLLLDLLDLLLUUUURRDDDDDRRDRRRRRDRLLLDRRLDDDLLLLLUUUURRULLLDLLUURLDDDDR...

result:

ok Valid Solution (Length = 725).

Test #66:

score: 0
Accepted
time: 0ms
memory: 3400kb

input:

20 20
11010111110101010101
10111010101111101010
11111101111101110111
10101011111010101110
11111111110101111101
10111111111010101111
11110101010111111101
10111110101011101111
01110111011101111101
10111011101010111010
11010111011111010111
11111011101011101111
01010111011111011111
11111010111110111011
...

output:

-1

result:

ok No Solution.

Test #67:

score: 0
Accepted
time: 46ms
memory: 10304kb

input:

30 25
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
1111111111111111111111111
11111111...

output:

RUUUULLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLDDRRRRRRRDLLLLLLLLULLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRDRRRRRRRRRDLLLLLLLLLLULLLLLLLLLLLLLLDRRRRRRRRRRRRRDRRRRRRRRRRRDLLLLLLLLLLLLULLLLLLLLLLLLDRRRRRRRRRRRDRRRRRRRRRRRRRDLLLLLLLLLLLLLLULLLLLLLLLLDRRRRRRRRRDRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLULLL...

result:

ok Valid Solution (Length = 901).

Test #68:

score: 0
Accepted
time: 47ms
memory: 10540kb

input:

30 25
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
1010101010101010101010101
1111111111111111111111111
10101010...

output:

UUUUUUUUUUUUUUUUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDDDRRRRRRRRRRRRRRRRRRRRRRRRUUUDLLUDLLUDLLUDLLUDLLUDLLUDLRDDDDRRRRRRRRRRRRUDDDLLUUUUUULLDDDDDDRRDDRRUDDDLLUULLUULLUUUUUULLDDDDDDRRDDRRDDRRDDRRUDDDLLUULLUULLUULLUULLUUUUUULLLLDDDDRRDDRRDDRRDDRRDDRRDDRRDDRRUDDDLLUULLUULLUULLUULLUULLUULLUUL...

result:

ok Valid Solution (Length = 1177).

Test #69:

score: 0
Accepted
time: 37ms
memory: 9244kb

input:

30 25
1111111111111111111111111
1000000000000000000000000
1111111111111111111111111
0000000000000000000000001
1111111111111111111111111
1000000000000000000000000
1111111111111111111111111
0000000000000000000000001
1111111111111111111111111
1000000000000000000000000
1111111111111111111111111
00000000...

output:

RRRRRRRRRRRRRRRRRRRURRRRRDLDLLLLLLLLLLLLLLLLLLLLLLLDLDRRRRRRRRRRRRRRRRRRRRRRRRDRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLDLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRDRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRR...

result:

ok Valid Solution (Length = 1367).

Test #70:

score: 0
Accepted
time: 0ms
memory: 3440kb

input:

30 30
011110110001111010011111110010
011101110110100110001101010100
100100100111010000000011100101
111110001011110110101000100000
100110011100000111100111100010
110011101000111000101110011101
011000001101110100001010011100
001101101010010100111111110011
100010111001110111010110100001
000101010010110...

output:

-1

result:

ok No Solution.

Test #71:

score: 0
Accepted
time: 80ms
memory: 10492kb

input:

30 30
101011111010110011011100010111
111111111111111111111111111111
101000010010011000101010010010
111111111111111111111111111111
101010011110010001011010010101
111111111111111111111111111111
111100010110101001000001000001
111111111111111111111111111111
111101000101101001001000100001
111111111111111...

output:

URRRRRRRRRRRRRRRRRRRRRRRRRUUUUULLLLLLLLLLLUURRRRRRRRRRRLDLLLULLDRDRRRRLLRDDRDDRDRRULLLLULULLULLDRLLLLLUURUUURRRRRRRRRDUDLLULDDDDRUURRUULLLLLLLLUURRRRRRRRDDLDLUUDDDLLLLULULLULURULURRRRRRRRRDULDRULLLLLUUULUURULLDLLULLLLLLLLLLLLLLLDRRRDRRRRRRRRRRRRRDDRRDRLLLLULULLDRLLLLUUURRRDLLLLULLULDRDDRRRRRDDRRRLDU...

result:

ok Valid Solution (Length = 1607).

Test #72:

score: 0
Accepted
time: 109ms
memory: 10984kb

input:

30 30
111111111111111101111111011011
111111100111011111111111101010
111111111111111111111111011111
111111111101111111110111111110
111111111111111011111111111111
111110111111111111111111011111
111111111111111111111111111011
111101111111011111111111111111
111111111111111111111111111111
101110111110111...

output:

URRRRRRRRRRRRRRRRRRRRRRRRRUUURRRRRRRRRRRRUUUUUUUUUUUUULUURUUULUURLDLLULLLLLLLLLLLLLLLLDRRRRRDRRURRRRRRRRDRRDRDLLULUULDLLLLLDRRRRRRDDRRDLLLULULLLLLULLLLULLDRDRRRRDRRRRRLLLDLLLUURRULLULUURDRLLLLLLLDRRRRDRDLLLURLDLDRRRRRLDLLLLLULUURUURLDLLULLLLLLLLDRRRRRRRDRDLLULLDRDRRRDRRRRRRRRRRRRRUDDRRDRRRRLLULLLLDR...

result:

ok Valid Solution (Length = 1723).

Test #73:

score: 0
Accepted
time: 1ms
memory: 3516kb

input:

30 30
110111011111110111011111110101
101110101010111010101011101010
011101111101011101011111010111
111110101110111111111011101110
010101110101011101010101111111
101111101011111111111110101011
111101110111010101011101010101
111011111010101010101010101111
011111011111110101011111111101
111010101111101...

output:

-1

result:

ok No Solution.

Test #74:

score: 0
Accepted
time: 29ms
memory: 10132kb

input:

21 30
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111...

output:

RRRRUUUUUUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRDRRDLLLULLLLLLLLLLLLLLLLLLLLLLDDDDDDDDDDRRRRRRRRRRRRRRRRRR...

result:

ok Valid Solution (Length = 827).

Test #75:

score: 0
Accepted
time: 32ms
memory: 9404kb

input:

21 30
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101...

output:

RRRRRUUUUUUUUUUUUUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRDDRRRRRRRRRRRRRRRRRRRRRRLUURLLULLLLLLLLLLLLLLLLLLRDDDRDRURRRRRRRRRRRRRRRRRRLUDDDRLLLUUUUUDLLUDDDDDRRDLLUULLUUUULLDDDDRRDDDRRRDRRRLUDDDRLLLUULLUUUULLUUUULLDDDDRRDDRLLLUULLUUUULLDDDDRRDDRRDDRRRRDDRRDDRRRLUDDDRRDDLLULUULLUULLUUUDLLLLUULLUDLLUUUUU...

result:

ok Valid Solution (Length = 1169).

Test #76:

score: 0
Accepted
time: 22ms
memory: 9600kb

input:

21 30
111111111111111111111111111111
100000000000000000000000000000
111111111111111111111111111111
000000000000000000000000000001
111111111111111111111111111111
100000000000000000000000000000
111111111111111111111111111111
000000000000000000000000000001
111111111111111111111111111111
100000000000000...

output:

RURRRRRRRRRRRRULULLLLLLLLLLLLLLLLLLLLLLLLLLLLUURRRRRRRRRRRRRRRRRRRRRRRRRRRRRUUDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRR...

result:

ok Valid Solution (Length = 1053).

Test #77:

score: 0
Accepted
time: 1ms
memory: 3508kb

input:

25 30
011010010110010101001110110111
000011111001111101110011010001
011011100010011000110100110000
001111001100100010111111101001
000101111100111001000000001111
001010110011101110101000010000
001010011001010000011001001001
011111010111110110101001110000
011001010011100010100101011000
100011000011110...

output:

-1

result:

ok No Solution.

Test #78:

score: 0
Accepted
time: 51ms
memory: 10208kb

input:

25 30
101100000100000111111100110011
111111111111111111111111111111
100111110101001111010001110011
111111111111111111111111111111
101101100110111111011110101110
111111111111111111111111111111
111001000110101100010101000110
111111111111111111111111111111
100000001011110010001101011010
111111111111111...

output:

URRRRRRRRRRRRRRRRRRRRRRRRRRRRURUUUUUUUUUUUUUUUUUUUUUULDLLULDLLLUDLLLLULLLDRRRDDRRRRRRRRRULLLDDRLLDRRRRURLDLDLDRRLULULUURRLUULLLLLLLULLLDRRRDLLLLULLUDLLLULLDRLUDLLLULLLLDRRRURLLDDLDLLULLLLRRDRDRRRRRRRRRRRRRRRDRRRRRRRRRRRRRRRRRRRRDRRRRRRRULDLDRDRRLLULLLLUDLLULDLLLLUDLLLULUURURULDLLULDLLLLLLDDDDRRRRRRR...

result:

ok Valid Solution (Length = 1351).

Test #79:

score: 0
Accepted
time: 53ms
memory: 10148kb

input:

25 30
111111101111111111111111111111
111111111111111101111111110111
111111111111101111111111111111
111111111111111101101111111111
011101111111111111111111101111
111011100111111110111110111111
111111110111111111111111111111
111111111111110111111111111111
111111111111111101111111111111
111111111111111...

output:

RRRRURRUUULLLLLLLLLDRRRRRRRRRULLLLLDDRRDRRRULRRUUDDDDRRRRRRULUURLULLLLDRDRDRLLLUDLLULLLULULLLLLLLLLURRRRRRDRRURDDLDRRRDRRDLLLULLLULULULLLLDRRRRDDRDRRRLLDRRRRRRDRRRRRRRUULLLLLDRRDDRRRDLDRDLLULULULLLLULLLULLUUURLLLDLLULLLULUULLLLLLLLDRRRRRRRDLLLLLLLDDRRRRRRRRRRRDRRRUUUURRRRRRRRRRRRRRRDLDRDLLUUDLLLULLD...

result:

ok Valid Solution (Length = 1347).

Test #80:

score: 0
Accepted
time: 0ms
memory: 3404kb

input:

25 30
110101110101011111010101010111
101111101011111011111110101010
110111011101110111111101011101
101011111011101011111111111011
110111111101011111110111111111
111111111110101011111111101010
110101010101010101011111011101
101010111010101111111111101111
111101110111011101011111010111
101010101010111...

output:

-1

result:

ok No Solution.

Test #81:

score: 0
Accepted
time: 62ms
memory: 10596kb

input:

30 30
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111...

output:

RRRRRRRRRRRRRRRRRRUUUUUUUUUUUUUUUUUUUUUUUULLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLL...

result:

ok Valid Solution (Length = 989).

Test #82:

score: 0
Accepted
time: 68ms
memory: 10500kb

input:

30 30
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101010101010101010
111111111111111111111111111111
101010101010101...

output:

RRRRRRRRRRRRRRRRRRRRRRRRUUUUUUUUUUUUUUUUUUULDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLDRDDRRRRRRRRRRRRRRRRRRRRRRRRRRRLUUUDLLUDDDRRDDRLLLUULLUUUDLLUDDDRRDDRRDDRRRLUDDDRLLLUULLUULLUULLUUUDLLUDDDRRDDRRDDRRDDRRDDRRRLUDDDRLLLUULLUULLUULLUULLUULLUUUDLLUDLLUDLLUDLLUDLLUDLLUDLLUDLRDDRRRRRRRR...

result:

ok Valid Solution (Length = 1485).

Test #83:

score: 0
Accepted
time: 70ms
memory: 9992kb

input:

30 30
111111111111111111111111111111
100000000000000000000000000000
111111111111111111111111111111
000000000000000000000000000001
111111111111111111111111111111
100000000000000000000000000000
111111111111111111111111111111
000000000000000000000000000001
111111111111111111111111111111
100000000000000...

output:

RRRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLLLLLLRRRRRRRRRRRRRRDDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRUDLDLLLLLLLLLLLLLLLLLLLLLLLLLLLLRRRRRRRRRRRRRRRRRRRRRRRRRRRRRLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRUDLDLLLLLLLLLLLLLLLLLLLLLLLLLLLLRRRRRRRRRRRRRRRRRRRRRRRRRR...

result:

ok Valid Solution (Length = 2099).

Test #84:

score: 0
Accepted
time: 0ms
memory: 3428kb

input:

30 30
010110110101101010000010000110
101110000111000001001111100101
010100011111100110100001111101
101101100010111011011010001010
100101010100001011101100101100
101001111001111101101100001110
000111101010011110100001110100
111111001101000001011110000111
010000100010000100000011101000
100001010111010...

output:

-1

result:

ok No Solution.

Test #85:

score: 0
Accepted
time: 85ms
memory: 10320kb

input:

30 30
100110101011111011001000111100
111111111111111111111111111111
101001000111011110000110011110
111111111111111111111111111111
111001111110100011111000000010
111111111111111111111111111111
100111001001100000100010001101
111111111111111111111111111111
110001101000111011111010110110
111111111111111...

output:

RRRRRRRRRRRRRRRRRRRRRRRRRRRRUULLLLLLLLLUURRRRRRRRRLUURLLUURRDDDLLLULUURURRRLURLURLUURLURLURLUURLLLLLLLLUURRRRRRRRDULURLURLULLLDLLLDRDRDRRRRRDDLLULDLLLLLUURRULLULULUULLLLLLLLLLLLLLLLLLLRRDRLLULLURLDDDRRRDLDRLLLDRRDRRRRRRRRRRRRRRRRRRDRDRURRRRRRDRDLLURRUULLLDDLDLLLUDLLUDLLLUULULULUDDDRDRRDLLLURRDRDLLLL...

result:

ok Valid Solution (Length = 1741).

Test #86:

score: 0
Accepted
time: 84ms
memory: 10756kb

input:

30 30
111101111111111111111011111111
100111111111111111111111011111
111111011111111111011111111110
101111111101111111111111111111
111111111111111111111111111111
111111101111011111111110111111
111011111111111111111111111111
111111111111111111111101111111
111111111111111111111111111111
011111100111111...

output:

RRUUUULUURUUUUUUUUUUURRRRRULURLURLURLLLLLLLLLLLURRRRRRRRRDLLLLLLLLRDRRRRDRRRRRRRRRUURRRULLLLLLLRDRDRRRRRDLDRDLLULLLLLLLLULULUULLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRDLLLLLLDRRRRRRRDRDRRRRRRRRUUDDDRRLLLLULDLLLLLLULULULLLLULDLLULLLLLLLLDRRRRRRRDRRRRRRRDRDRDRRRDLLLLULULULLLLLLLULLLLLLDRRRRRDRDRRRRRURLLDDRDL...

result:

ok Valid Solution (Length = 1515).

Test #87:

score: 0
Accepted
time: 0ms
memory: 3392kb

input:

30 30
011111010101111111011101111101
111011101011111110111111101011
111111010101011101111101110101
111110101011101110111111101110
010111011101110101110101111101
101111101011101110101010111111
110101010101010111011101010101
101110101111101110101110111111
110111011101010111010111110101
101011111110111...

output:

-1

result:

ok No Solution.

Test #88:

score: 0
Accepted
time: 63ms
memory: 10536kb

input:

30 30
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111111111111111111
111111111111111...

output:

UUUUUUUUUUUUUUUUUUUUUUUUUUUULRDLLULLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRULLLLLLLLLLLLLLLLLLLLLLLLLLLDDRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLLLLLULDDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLLLLLLDRRRRRRRRRRRRRRRRRRRRRRRRRRRRRDLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...

result:

ok Valid Solution (Length = 1051).

Extra Test:

score: 0
Extra Test Passed