제출 #315734

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
315734	2020-10-23 20:24:21	DanerZein	Patkice (COCI20_patkice)	C++14	50 / 50	1 ms	384 KiB

patkice

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,char> ci;
vector<string> vs;
const ll MAX=1e9;
ll n,m;
ll voyage(ll a,ll b){
  if(a<0 or b<0 or a>=n or b>=m) return MAX;
  ll ans=0;
  if(vs[a][b]=='.' or vs[a][b]=='o') return MAX;
  if(vs[a][b]=='x') return 0;
  if(vs[a][b]=='>')
    ans+=(voyage(a,b+1)+1);
  if(vs[a][b]=='<')
    ans+=(voyage(a,b-1)+1);
  if(vs[a][b]=='^')
    ans+=(voyage(a-1,b)+1);
  if(vs[a][b]=='v')
    ans+=(voyage(a+1,b)+1);
  return ans;
}
int main(){
  cin>>n>>m;
  ll a,b;
  a=-1; b=-1;
  for(ll i=0;i<n;i++){
    string x;
    cin>>x;
    vs.push_back(x);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 30 / 30
• Subtask 2: 20 / 20