#include<bits/stdc++.h>
using namespace std;
const int MAXN = 4010;
int n, m;
bool M[MAXN][MAXN];
bool on[MAXN][MAXN];
bool ok(int i, int j){
if(i < 0 || j < 0 || i >= n || j >= m) return false;
return on[i][j];
}
int DI[] = {0, 0, -1, 1};
int DJ[] = {-1, 1, 0, 0};
int32_t main(){
cin.tie(NULL)->sync_with_stdio(false);
cin >> n >> m;
for(int i = 0; i < n; ++i){
string s; cin >> s;
for(int j = 0; j < m; ++j){
if(s[j] == '.') on[i][j] = false;
else{
on[i][j] = true;
M[i][j] = (s[j] == 'F');
}
}
}
int ans = 0;
struct Node{
int i, j, d;
};
deque<Node> q;
q.push_front({0, 0, 1});
on[0][0] = false;
while(q.size()){
auto [i, j, d] = q.front();
q.pop_front();
ans = max(ans, d);
for(int k = 0; k < 4; ++k){
int ni = i + DI[k];
int nj = j + DJ[k];
if(ok(ni, nj)){
on[ni][nj] = false;
if(M[ni][nj] != M[i][j]){
q.push_back({ni, nj, d + 1});
}else{
q.push_front({ni, nj, d});
}
}
}
}
cout << ans << "\n";
}
Compilation message
tracks.cpp: In function 'int32_t main()':
tracks.cpp:42:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
42 | auto [i, j, d] = q.front();
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
4180 KB |
Output is correct |
| 2 |
Correct |
0 ms |
468 KB |
Output is correct |
| 3 |
Correct |
0 ms |
724 KB |
Output is correct |
| 4 |
Correct |
6 ms |
4436 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2516 KB |
Output is correct |
| 6 |
Correct |
1 ms |
468 KB |
Output is correct |
| 7 |
Correct |
1 ms |
724 KB |
Output is correct |
| 8 |
Correct |
1 ms |
724 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1108 KB |
Output is correct |
| 10 |
Correct |
2 ms |
2256 KB |
Output is correct |
| 11 |
Correct |
2 ms |
1876 KB |
Output is correct |
| 12 |
Correct |
6 ms |
2664 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2516 KB |
Output is correct |
| 14 |
Correct |
3 ms |
2516 KB |
Output is correct |
| 15 |
Correct |
9 ms |
4308 KB |
Output is correct |
| 16 |
Correct |
10 ms |
4280 KB |
Output is correct |
| 17 |
Correct |
6 ms |
4096 KB |
Output is correct |
| 18 |
Correct |
6 ms |
4436 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
30252 KB |
Output is correct |
| 2 |
Correct |
29 ms |
10068 KB |
Output is correct |
| 3 |
Correct |
143 ms |
31744 KB |
Output is correct |
| 4 |
Correct |
50 ms |
15060 KB |
Output is correct |
| 5 |
Correct |
112 ms |
23912 KB |
Output is correct |
| 6 |
Correct |
508 ms |
50776 KB |
Output is correct |
| 7 |
Correct |
14 ms |
31700 KB |
Output is correct |
| 8 |
Correct |
14 ms |
30196 KB |
Output is correct |
| 9 |
Correct |
2 ms |
468 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
16 ms |
31060 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1492 KB |
Output is correct |
| 13 |
Correct |
30 ms |
10124 KB |
Output is correct |
| 14 |
Correct |
18 ms |
7508 KB |
Output is correct |
| 15 |
Correct |
16 ms |
8136 KB |
Output is correct |
| 16 |
Correct |
13 ms |
3524 KB |
Output is correct |
| 17 |
Correct |
71 ms |
16180 KB |
Output is correct |
| 18 |
Correct |
53 ms |
15992 KB |
Output is correct |
| 19 |
Correct |
51 ms |
15144 KB |
Output is correct |
| 20 |
Correct |
46 ms |
14108 KB |
Output is correct |
| 21 |
Correct |
89 ms |
24620 KB |
Output is correct |
| 22 |
Correct |
107 ms |
23872 KB |
Output is correct |
| 23 |
Correct |
142 ms |
20108 KB |
Output is correct |
| 24 |
Correct |
99 ms |
24808 KB |
Output is correct |
| 25 |
Correct |
282 ms |
31776 KB |
Output is correct |
| 26 |
Correct |
536 ms |
101976 KB |
Output is correct |
| 27 |
Correct |
506 ms |
61144 KB |
Output is correct |
| 28 |
Correct |
535 ms |
50832 KB |
Output is correct |
| 29 |
Correct |
519 ms |
49104 KB |
Output is correct |
| 30 |
Correct |
517 ms |
50776 KB |
Output is correct |
| 31 |
Correct |
386 ms |
26096 KB |
Output is correct |
| 32 |
Correct |
472 ms |
50796 KB |
Output is correct |
