oj.uz

답안 #525037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525037 2022-02-10T14:36:45 Z MOUF_MAHMALAT Patkice (COCI20_patkice) C++14
50 / 50
 1 ms 384 KB 
#include<bits/stdc++.h>
#define all(s) s.begin(),s.end()
#define F first
#define S second
using namespace std;
typedef int ll;
ll n,m,x,y;
char c[109][109];
pair<ll,char>ans;
ll go(ll i,ll j)
{
    if(c[i][j]=='x')
        return 0;
    if(c[i][j]=='.'||c[i][j]=='o')
        return 1e9;
    if(c[i][j]=='>')
        return go(i,j+1)+1;
    if(c[i][j]=='<')
        return go(i,j-1)+1;
    if(c[i][j]=='^')
        return go(i-1,j)+1;
    return go(i+1,j)+1;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin>>n>>m;
    for(ll i=0; i<n; i++)
        for(ll j=0; j<m; j++)
        {
            cin>>c[i][j];
            if(c[i][j]=='o')
                x=i,y=j;
        }
    ans.F=1e9;
    ans=min({go(x-1,y),'N'},ans);
    ans=min({go(x+1,y),'S'},ans);
    ans=min({go(x,y+1),'E'},ans);
    ans=min({go(x,y-1),'W'},ans);
    if(ans.F>=1e9)
        cout<<":(";
    else
        cout<<":)\n"<<ans.S;
    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 312 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct