-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathC.cpp
More file actions
75 lines (74 loc) · 2.01 KB
/
C.cpp
File metadata and controls
75 lines (74 loc) · 2.01 KB
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
/*
© 2021-02-06 05:57:57 Franco1010 All Rights Reserved
*/
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
using namespace std;
typedef long double ld;
typedef long long lli;
typedef pair<lli,lli> ii;
typedef vector<lli> vi;
#define deb(x) cout << #x": " << (x) << endl;
vector<ii> dir = {{-1, 0}, {0, +1}, {+1, 0}, {0, -1}};
lli n, m;
vector<string> mat;
bool val(lli x, lli y){
return 0 <= x and x < n and 0 <= y and y <= m and mat[x][y] != '#';
}
lli dfs(ii u, int d = 1, bool ini = false){
// cout << u.f << ' ' << u.s << ": " << d << ENDL;
// for(auto i : mat) cout << i << ENDL;
// cout << ENDL;
if(!ini and mat[u.f][u.s] == '*') return 0;
{//right
ii ndir = {dir[(d + 1 + 4)%4].f + u.f, dir[(d + 1 + 4)%4].s + u.s};
if(val(ndir.f, ndir.s)){
return dfs(ndir, (d + 1 + 4)%4) + 1;
}
}
{
ii ndir = {dir[d].f + u.f, dir[d].s + u.s};
if(val(ndir.f, ndir.s)){
return dfs(ndir, d);
}
}
{//left
ii ndir = {dir[(d - 1 + 4)%4].f + u.f, dir[(d - 1 + 4)%4].s + u.s};
if(val(ndir.f, ndir.s)){
return dfs(ndir, (d - 1 + 4)%4) + 1;
}
}
{//back
ii ndir = {dir[(d + 2 + 4)%4].f + u.f, dir[(d + 2 + 4)%4].s + u.s};
if(val(ndir.f, ndir.s)){
return dfs(ndir, (d + 2 + 4)%4) + 2;
}
}
return 0;
}
int main(){ _
// freopen("file.in","r",stdin);
// freopen("file.out","w",stdout);
cin >> n >> m;
mat.resize(n);
fore(i, 0, n) cin >> mat[i];
fore(i, 0, n){
fore(j, 0, m){
if(mat[i][j] == '#'){
mat[i - 1][j] = '*';
cout << dfs({i - 1, j}, 1, true) << ENDL;
return 0;
}
}
}
return 0;
}