#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 1e8;
const int S = 1e7;
bool ready[S] = {false};
int value[S];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int h, w; cin >> h >> w;
vector<vector<char>> meadow (h, vector<char> (w));
int ans = 0;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
char x; cin >> x;
meadow[i][j] = x;
if(ans == 2) continue;
if(x == 'R') ans++;
if(x == 'F') ans++;
}
}
cout << ans << "\n";
}
/*
*
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
856 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
604 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
600 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
604 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
12 |
Incorrect |
2 ms |
476 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
604 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
856 KB |
Output isn't correct |
15 |
Incorrect |
3 ms |
860 KB |
Output isn't correct |
16 |
Incorrect |
3 ms |
828 KB |
Output isn't correct |
17 |
Incorrect |
3 ms |
860 KB |
Output isn't correct |
18 |
Incorrect |
2 ms |
604 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
604 KB |
Output isn't correct |
2 |
Incorrect |
15 ms |
3552 KB |
Output isn't correct |
3 |
Incorrect |
169 ms |
31740 KB |
Output isn't correct |
4 |
Incorrect |
42 ms |
7636 KB |
Output isn't correct |
5 |
Incorrect |
92 ms |
18048 KB |
Output isn't correct |
6 |
Incorrect |
157 ms |
31756 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
600 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
604 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
528 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
600 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
13 |
Incorrect |
15 ms |
3420 KB |
Output isn't correct |
14 |
Incorrect |
9 ms |
2268 KB |
Output isn't correct |
15 |
Incorrect |
11 ms |
2228 KB |
Output isn't correct |
16 |
Incorrect |
8 ms |
1744 KB |
Output isn't correct |
17 |
Incorrect |
39 ms |
8452 KB |
Output isn't correct |
18 |
Incorrect |
46 ms |
8144 KB |
Output isn't correct |
19 |
Incorrect |
42 ms |
7748 KB |
Output isn't correct |
20 |
Incorrect |
44 ms |
7004 KB |
Output isn't correct |
21 |
Incorrect |
119 ms |
18768 KB |
Output isn't correct |
22 |
Incorrect |
124 ms |
18068 KB |
Output isn't correct |
23 |
Incorrect |
86 ms |
15688 KB |
Output isn't correct |
24 |
Incorrect |
98 ms |
18276 KB |
Output isn't correct |
25 |
Incorrect |
185 ms |
31760 KB |
Output isn't correct |
26 |
Incorrect |
116 ms |
24480 KB |
Output isn't correct |
27 |
Incorrect |
189 ms |
31760 KB |
Output isn't correct |
28 |
Incorrect |
179 ms |
31828 KB |
Output isn't correct |
29 |
Incorrect |
160 ms |
31876 KB |
Output isn't correct |
30 |
Incorrect |
164 ms |
31028 KB |
Output isn't correct |
31 |
Incorrect |
96 ms |
20448 KB |
Output isn't correct |
32 |
Incorrect |
172 ms |
31824 KB |
Output isn't correct |