#include <bits/stdc++.h>
using namespace std;
// #undef _GLIBCXX_DEBUG // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("bmi,bmi2,lzcnt,popcnt") // bit manipulation
// #pragma GCC target("movbe") // byte swap
// #pragma GCC target("aes,pclmul,rdrnd") // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<(int)n;i++)
#define Fo(i, k, n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define sp(x, y) fixed<<setprecision(y)<<x
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define clr(x) memset(x, 0, sizeof(x))
#define tr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define trr(it, x) for(auto it = x.rbegin(); it != x.rend(); it+)
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;
int main() {
// cout << fixed << setprecision(20);
// auto start = std::chrono::steady_clock::now(); // since(start).count()
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit); // remove if to endof file
int n, m, x, y, type;
char val;
cin >> n >> m;
vvi grid(n, vi(m, 0));
fo(i, n){
fo(j, m){
cin >> val;
if(val == 'F') grid[i][j] = 1;
else if(val == 'R') grid[i][j] = 2;
}
}
queue<tuple<int, int, int>> q;
queue<tuple<int, int, int>> q2;
q.push({0, 0, grid[0][0]});
vpii dirs = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int ans = 0;
while(!q.empty()){
ans++;
tie(x, y, type) = q.front();
int base = type;
while(!q.empty()){
tie(x, y, type) = q.front();
q.pop();
if(x<0 || x>=n || y<0 || y>=m) continue;
type = grid[x][y];
if(!type) continue;
if(type != base){
q2.push({x, y, type});
continue;
}
grid[x][y] = 0;
fo(i, 4) q.push({x+dirs[i].F, y+dirs[i].S, type});
}
swap(q, q2);
}
cout << ans;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
30 ms |
1868 KB |
Output is correct |
| 2 |
Correct |
1 ms |
216 KB |
Output is correct |
| 3 |
Correct |
1 ms |
316 KB |
Output is correct |
| 4 |
Correct |
13 ms |
1864 KB |
Output is correct |
| 5 |
Correct |
4 ms |
720 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
316 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
340 KB |
Output is correct |
| 10 |
Correct |
4 ms |
648 KB |
Output is correct |
| 11 |
Correct |
4 ms |
716 KB |
Output is correct |
| 12 |
Correct |
9 ms |
852 KB |
Output is correct |
| 13 |
Correct |
5 ms |
716 KB |
Output is correct |
| 14 |
Correct |
4 ms |
724 KB |
Output is correct |
| 15 |
Correct |
21 ms |
1620 KB |
Output is correct |
| 16 |
Correct |
27 ms |
1864 KB |
Output is correct |
| 17 |
Correct |
17 ms |
1492 KB |
Output is correct |
| 18 |
Correct |
14 ms |
1876 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
596 KB |
Output is correct |
| 2 |
Correct |
81 ms |
8092 KB |
Output is correct |
| 3 |
Correct |
523 ms |
78756 KB |
Output is correct |
| 4 |
Correct |
112 ms |
18764 KB |
Output is correct |
| 5 |
Correct |
389 ms |
44492 KB |
Output is correct |
| 6 |
Correct |
1828 ms |
139200 KB |
Output is correct |
| 7 |
Correct |
3 ms |
724 KB |
Output is correct |
| 8 |
Correct |
3 ms |
596 KB |
Output is correct |
| 9 |
Correct |
4 ms |
724 KB |
Output is correct |
| 10 |
Correct |
2 ms |
468 KB |
Output is correct |
| 11 |
Correct |
2 ms |
596 KB |
Output is correct |
| 12 |
Correct |
2 ms |
340 KB |
Output is correct |
| 13 |
Correct |
101 ms |
8012 KB |
Output is correct |
| 14 |
Correct |
44 ms |
4812 KB |
Output is correct |
| 15 |
Correct |
43 ms |
5144 KB |
Output is correct |
| 16 |
Correct |
43 ms |
3560 KB |
Output is correct |
| 17 |
Correct |
219 ms |
20332 KB |
Output is correct |
| 18 |
Correct |
144 ms |
19988 KB |
Output is correct |
| 19 |
Correct |
122 ms |
18776 KB |
Output is correct |
| 20 |
Correct |
114 ms |
17208 KB |
Output is correct |
| 21 |
Correct |
300 ms |
45984 KB |
Output is correct |
| 22 |
Correct |
377 ms |
44448 KB |
Output is correct |
| 23 |
Correct |
447 ms |
38504 KB |
Output is correct |
| 24 |
Correct |
312 ms |
44944 KB |
Output is correct |
| 25 |
Correct |
675 ms |
78732 KB |
Output is correct |
| 26 |
Correct |
863 ms |
60528 KB |
Output is correct |
| 27 |
Correct |
1274 ms |
88480 KB |
Output is correct |
| 28 |
Correct |
1907 ms |
139300 KB |
Output is correct |
| 29 |
Correct |
1826 ms |
129776 KB |
Output is correct |
| 30 |
Correct |
1550 ms |
122856 KB |
Output is correct |
| 31 |
Correct |
1446 ms |
53188 KB |
Output is correct |
| 32 |
Correct |
1233 ms |
83288 KB |
Output is correct |
