| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1338394 | m0use | Tracks in the Snow (BOI13_tracks) | C++20 | 170 ms | 16088 KiB |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAX_W = 4e3+1;
char grid[MAX_W][MAX_W]{}, r_cnt = 0, f_cnt = 0;
int w, h;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> h >> w;
for(int i = 1; i <= h; i++) for(int j = 1; j <= w; j++) {
cin >> grid[i][j];
if(grid[i][j]=='R') r_cnt++;
else if(grid[i][j]=='F') f_cnt++;
}
int ans = (r_cnt>0)+(f_cnt>0);
cout << ans << '\n';
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
