Submission #34207490


Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;

int n, m;
char arr[510][510];
bool visited[510][510];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main()
{
	int i, j;
	int x, y;
	int dir;
	int nx, ny;

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

	x = 0;
	y = 0;
	while (1)
	{
		if (visited[x][y])
		{
			cout << -1;
			return 0;
		}

		visited[x][y] = true;

		if (arr[x][y] == 'D') dir = 0;
		else if (arr[x][y] == 'R') dir = 1;
		else if (arr[x][y] == 'U') dir = 2;
		else dir = 3;

		nx = x + dx[dir];
		ny = y + dy[dir];

		if (nx < 0 || nx >= n || ny < 0 || ny >= m)
		{
			cout << x + 1 << ' ' << y + 1;
			return 0;
		}

		x = nx;
		y = ny;
	}
}

Submission Info

Submission Time
Task C - Belt Conveyor
User gojib2002
Language C++ (GCC 9.2.1)
Score 300
Code Size 871 Byte
Status AC
Exec Time 18 ms
Memory 4076 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:20:9: warning: unused variable ‘j’ [-Wunused-variable]
   20 |  int i, j;
      |         ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 14
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_1_00.txt, 01_random_1_01.txt, 01_random_1_02.txt, 02_random_2_00.txt, 02_random_2_01.txt, 02_random_2_02.txt, 03_max_00.txt, 03_max_01.txt, 03_max_02.txt, 03_max_03.txt, 03_max_04.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 8 ms 3576 KiB
00_sample_01.txt AC 2 ms 3540 KiB
00_sample_02.txt AC 3 ms 3456 KiB
01_random_1_00.txt AC 9 ms 3852 KiB
01_random_1_01.txt AC 12 ms 3820 KiB
01_random_1_02.txt AC 9 ms 3752 KiB
02_random_2_00.txt AC 10 ms 3856 KiB
02_random_2_01.txt AC 9 ms 3796 KiB
02_random_2_02.txt AC 12 ms 3852 KiB
03_max_00.txt AC 12 ms 4004 KiB
03_max_01.txt AC 18 ms 4076 KiB
03_max_02.txt AC 10 ms 4076 KiB
03_max_03.txt AC 14 ms 4036 KiB
03_max_04.txt AC 9 ms 3696 KiB