编号 题目 状态 分数 总时间 内存 代码 / 答案文件 提交者 提交时间
#2554 #1005. 兜圈子 Accepted 100 4991 ms 22556 K Java / 2.1 K s230034011 2023-11-19 0:10:06
显示原始代码
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int H = scanner.nextInt(); // Rows
        int W = scanner.nextInt(); // Columns

        char[][] grid = new char[H + 1][W + 1]; // +1 because we are using 1-based indexing

        // Read the grid input
        for (int i = 1; i <= H; i++) {
            String line = scanner.next();
            for (int j = 1; j <= W; j++) {
                grid[i][j] = line.charAt(j - 1);
            }
        }

        boolean[][] visited = new boolean[H + 1][W + 1]; // Track visited cells
        int i = 1, j = 1;

        // Movement logic
        while (true) {
            if (visited[i][j]) {
                // If we've visited the cell before, we're in a loop
                System.out.println(-1);
                scanner.close();
                return;
            }
            visited[i][j] = true;

            // Perform the move according to the character
            switch (grid[i][j]) {
                case 'U':
                    if (i == 1) {
                        printPosition(i, j);
                        return;
                    }
                    i--;
                    break;
                case 'D':
                    if (i == H) {
                        printPosition(i, j);
                        return;
                    }
                    i++;
                    break;
                case 'L':
                    if (j == 1) {
                        printPosition(i, j);
                        return;
                    }
                    j--;
                    break;
                case 'R':
                    if (j == W) {
                        printPosition(i, j);
                        return;
                    }
                    j++;
                    break;
                default:
                    printPosition(i, j);
                    return;
            }
        }
    }

    private static void printPosition(int i, int j) {
        System.out.println(i + " " + j);
    }
}
子任务 #1
Accepted
得分:100
测试点 #1
Accepted
得分:100
用时:232 ms
内存:15884 KiB

输入文件(00_sample_00.in

2 3
RDU
LRU

答案文件(00_sample_00.out

1 3

用户输出

1 3

系统信息

Exited with return code 0
测试点 #2
Accepted
得分:100
用时:227 ms
内存:13416 KiB

输入文件(00_sample_01.in

2 3
RRD
ULL

答案文件(00_sample_01.out

-1

用户输出

-1

系统信息

Exited with return code 0
测试点 #3
Accepted
得分:100
用时:337 ms
内存:16304 KiB

输入文件(00_sample_02.in

9 44
RRDDDDRRRDDDRRRRRRDDDRDDDDRDDRDDDDDDRRDRRRRR
RRRDLRDRDLLLLRDRRLLLDDRDLLLRDDDLLLDRRLLLLLDD
DRDLR
<310 bytes omitted>

答案文件(00_sample_02.out

9 5

用户输出

9 5

系统信息

Exited with return code 0
测试点 #4
Accepted
得分:100
用时:367 ms
内存:20036 KiB

输入文件(01_random_1_00.in

500 500
RRUURUUURDRURLLLUDDRLRUUUURRRLRUUULRLURDUDUURDRRUDDRDLLLRRLLLLULRUULRRLDDRURDLULDUDDLRRRLUDR
<250408 bytes omitted>

答案文件(01_random_1_00.out

1 3

用户输出

1 3

系统信息

Exited with return code 0
测试点 #5
Accepted
得分:100
用时:314 ms
内存:16960 KiB

输入文件(01_random_1_01.in

500 500
DDDUUULULDUUUUDRULURDLLULUURDLRUULDLUDRLLDDDULUURDLLDLDDRDULUUURULDRDUDUDDRDLLLLRDDUULLRLUUD
<250408 bytes omitted>

答案文件(01_random_1_01.out

-1

用户输出

-1

系统信息

Exited with return code 0
测试点 #6
Accepted
得分:100
用时:346 ms
内存:22556 KiB

输入文件(01_random_1_02.in

500 500
LULRRLLRDDULRUULRDULRUDUDLDDULRUDLLRRDULDRLDUDLDRULUUDUURLLLDRRLLDUUULUURRLRLLLDDRLDLDDRUDRD
<250408 bytes omitted>

答案文件(01_random_1_02.out

1 1

用户输出

1 1

系统信息

Exited with return code 0
测试点 #7
Accepted
得分:100
用时:423 ms
内存:17252 KiB

输入文件(02_random_2_00.in

500 500
RRRDLURDUUDLRRRUURUDLUDRURURUURUDDRUDDDDURUDURULDLRRRLDRDDRDDULURDDDLRDURUDDRLUUDRLUDLLDURRL
<250408 bytes omitted>

答案文件(02_random_2_00.out

-1

用户输出

-1

系统信息

Exited with return code 0
测试点 #8
Accepted
得分:100
用时:295 ms
内存:16904 KiB

输入文件(02_random_2_01.in

500 500
RRRRRDDLDLDLRRRRDLRLLLLLRUUURRUDRURDULLDLUUDLULLDLURUDDLRLRRLLRLRUUURLURDURULLRRRDULRDLDDLUU
<250408 bytes omitted>

答案文件(02_random_2_01.out

-1

用户输出

-1

系统信息

Exited with return code 0
测试点 #9
Accepted
得分:100
用时:264 ms
内存:17232 KiB

输入文件(02_random_2_02.in

500 500
DRDULLRDDURDLLLUDULRLLRRDLDUDDUULDDURUDDURDDRLRDRDRRLURDRUDLRULDRDRDURUUUDDRDDRLRDRLRUURRRUL
<250408 bytes omitted>

答案文件(02_random_2_02.out

-1

用户输出

-1

系统信息

Exited with return code 0
测试点 #10
Accepted
得分:100
用时:292 ms
内存:19260 KiB

输入文件(03_max_00.in

500 500
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR
<250408 bytes omitted>

答案文件(03_max_00.out

-1

用户输出

-1

系统信息

Exited with return code 0
测试点 #11
Accepted
得分:100
用时:514 ms
内存:19992 KiB

输入文件(03_max_01.in

500 500
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR
<250408 bytes omitted>

答案文件(03_max_01.out

341 1

用户输出

341 1

系统信息

Exited with return code 0
测试点 #12
Accepted
得分:100
用时:433 ms
内存:19564 KiB

输入文件(03_max_02.in

500 500
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR
<250408 bytes omitted>

答案文件(03_max_02.out

500 432

用户输出

500 432

系统信息

Exited with return code 0
测试点 #13
Accepted
得分:100
用时:562 ms
内存:18696 KiB

输入文件(03_max_03.in

500 500
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR
<250408 bytes omitted>

答案文件(03_max_03.out

432 500

用户输出

432 500

系统信息

Exited with return code 0
测试点 #14
Accepted
得分:100
用时:385 ms
内存:18852 KiB

输入文件(03_max_04.in

500 500
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR
<250408 bytes omitted>

答案文件(03_max_04.out

1 441

用户输出

1 441

系统信息

Exited with return code 0