oj.uz

Submission #804952

# Submission time Handle Problem Language Result Execution time Memory
804952 2023-08-03T12:07:49 Z Tunglam07 Patkice (COCI20_patkice) C++17
0 / 50
 1 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;

long long dx[]={0,-1,1,0};
long long dy[]={1,0,0,-1};
char a[101][101];

long long dfs(long long x,long long y)
{
    if (a[x][y]=='x') 
	{
		return 1;
	}
    if (a[x][y]=='.' || a[x][y]=='o') 
	{
		return INT_MIN;
	}
    if (a[x][y]=='^') 
	{
		return dfs(x-1,y)+1;
	}
    if (a[x][y]=='v') 
	{
		return dfs(x+1,y)+1;
	}
    if (a[x][y]=='>') 
	{
		return dfs(x,y+1)+1;
	}
    if (a[x][y]=='<') 
	{
		return dfs(x,y-1)+1;
	}
}

int main()
{
    ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	long long n,m, x=0, y=0;
    char c = '#';
    cin >> n >> m;
    for (int i=1;i<=n;i++)
	{
        for (int j=1;j<=m;j++)
		{
            cin>>a[i][j];
            if (a[i][j]=='o')
			{
                x=i;
                y=j;
            }
        }
    }
    long long maxi=INT_MAX;
    bool ck;
    for (int i=0;i<4;i++)
	{
        long long d = dfs(x+dx[i],y+dy[i]);
        if (d<0) 
		{
			continue;
		}
        ck=true;
        if (d<maxi)
		{
            maxi=d;
            if (i==0) 
			{
				c='E';
			}
            else if (i==1) 
			{
				c='N';
			}
            else if (i==2) 
			{
				c='S';
			}
            else if (i==3) 
			{
				c='W';
			}
        }
    }
    if (ck) 
	{
		cout << ":)" << endl << c << endl;
	}
    else 
	{
		cout<<":("<<endl;
	}
}

Compilation message

patkice.cpp: In function 'long long int dfs(long long int, long long int)':
patkice.cpp:34:1: warning: control reaches end of non-void function [-Wreturn-type]
   34 | }
      | ^

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -