#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define sz(x) (int)x.size()
#define ff first
#define ss second
const ll N = 4005;
const ll M = 1e9 + 7;
int T, n, m;
char c[N][N];
int main(){
cin >> n >> m;
bool tr1 = 0, tr2 = 0;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
cin >> c[i][j];
if(c[i][j] == 'R') tr1 = 1;
if(c[i][j] == 'F') tr2 = 1;
}
}
cout << tr1 + tr2;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
9 ms |
2392 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
604 KB |
Output isn't correct |
4 |
Incorrect |
5 ms |
2416 KB |
Output isn't correct |
5 |
Incorrect |
4 ms |
1628 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
604 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
604 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
604 KB |
Output isn't correct |
10 |
Incorrect |
3 ms |
1372 KB |
Output isn't correct |
11 |
Incorrect |
2 ms |
1100 KB |
Output isn't correct |
12 |
Incorrect |
4 ms |
1624 KB |
Output isn't correct |
13 |
Incorrect |
3 ms |
1628 KB |
Output isn't correct |
14 |
Incorrect |
3 ms |
1628 KB |
Output isn't correct |
15 |
Incorrect |
9 ms |
2512 KB |
Output isn't correct |
16 |
Incorrect |
9 ms |
2396 KB |
Output isn't correct |
17 |
Incorrect |
11 ms |
2516 KB |
Output isn't correct |
18 |
Incorrect |
5 ms |
2396 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
7 ms |
15448 KB |
Output isn't correct |
2 |
Incorrect |
48 ms |
6736 KB |
Output isn't correct |
3 |
Incorrect |
470 ms |
31736 KB |
Output isn't correct |
4 |
Incorrect |
106 ms |
11344 KB |
Output isn't correct |
5 |
Incorrect |
251 ms |
20788 KB |
Output isn't correct |
6 |
Incorrect |
481 ms |
31568 KB |
Output isn't correct |
7 |
Incorrect |
7 ms |
15960 KB |
Output isn't correct |
8 |
Incorrect |
7 ms |
15452 KB |
Output isn't correct |
9 |
Incorrect |
3 ms |
860 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
11 |
Incorrect |
7 ms |
15816 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
860 KB |
Output isn't correct |
13 |
Incorrect |
48 ms |
6712 KB |
Output isn't correct |
14 |
Incorrect |
29 ms |
4688 KB |
Output isn't correct |
15 |
Incorrect |
30 ms |
5088 KB |
Output isn't correct |
16 |
Incorrect |
20 ms |
2396 KB |
Output isn't correct |
17 |
Incorrect |
120 ms |
12216 KB |
Output isn't correct |
18 |
Incorrect |
122 ms |
12108 KB |
Output isn't correct |
19 |
Incorrect |
106 ms |
11288 KB |
Output isn't correct |
20 |
Incorrect |
119 ms |
10672 KB |
Output isn't correct |
21 |
Incorrect |
264 ms |
21584 KB |
Output isn't correct |
22 |
Incorrect |
280 ms |
20816 KB |
Output isn't correct |
23 |
Incorrect |
228 ms |
17780 KB |
Output isn't correct |
24 |
Incorrect |
276 ms |
21328 KB |
Output isn't correct |
25 |
Incorrect |
474 ms |
31692 KB |
Output isn't correct |
26 |
Correct |
356 ms |
25956 KB |
Output is correct |
27 |
Incorrect |
475 ms |
31568 KB |
Output isn't correct |
28 |
Incorrect |
494 ms |
31756 KB |
Output isn't correct |
29 |
Incorrect |
557 ms |
31540 KB |
Output isn't correct |
30 |
Incorrect |
466 ms |
30912 KB |
Output isn't correct |
31 |
Incorrect |
375 ms |
22868 KB |
Output isn't correct |
32 |
Incorrect |
467 ms |
31568 KB |
Output isn't correct |