-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathspiral_message.cpp
127 lines (103 loc) · 2.33 KB
/
spiral_message.cpp
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
/*
author: Taj Maun Kamal
Hackerrank : _maun
*/
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int vis[100][100];
int R,C;
int spiralPrint(int m, int n, vector<string>a)
{
int i, k = 0, l = 0;
int d=0,f=0;
while (k < m && l < n)
{
if (l < n)
{
for (i = m-1; i >= k; --i)
{
// printf("%c ", a[i][l]);
if((isupper(a[i][l]) || islower(a[i][l])) && !vis[i][l])
{
f++;
}
else if(a[i][l]=='#' && !vis[i][l])
{
if(f)
d++;
f=0;
}
vis[i][l]++;
}
l++;
}
for (i = l; i < n; ++i)
{
if((isupper(a[k][i]) || islower(a[k][i])) && !vis[k][i])
{
f++;
}
else if(a[k][i]=='#' && !vis[k][i])
{
if(f)
d++;
f=0;
}
vis[k][i]++;
}
k++;
for (i = k; i < m; ++i)
{
if((isupper(a[i][n-1]) || islower(a[i][n-1])) && !vis[i][n-1])
{
f++;
}
else if(a[i][n-1]=='#' && !vis[i][n-1])
{
if(f)
d++;
f=0;
}
vis[i][n-1]++;
}
n--;
if ( k < m)
{
for (i = n-1; i >= l; --i)
{
if((isupper(a[m-1][i]) || islower(a[m-1][i])) && !vis[m-1][i])
{
f++;
}
else if(a[m-1][i]=='#' && !vis[m-1][i])
{
if(f)
d++;
f=0;
}
vis[m-1][i]++;
}
m--;
}
}
if(f)
d++;
return d;
}
int main()
{
int x,y;
cin>>x>>y;
vector<string>v;
for(int j=0; j<x; j++)
{
string s;
cin>>s;
v.push_back(s);
}
cout<< spiralPrint(x,y,v)<<endl;
}