#include <bits/stdc++.h>
using namespace std;
const int maxn = 4009;
typedef long long ll;
int N , M;
string s[maxn];
int a , b , c;
vector <pair<int,int>> R;
bool vis[maxn][maxn];
int MAXI = 0;
void pr()
{
R.push_back({-1,0});
R.push_back({1,0});
R.push_back({0,1});
R.push_back({0,-1});
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N >> M;
for(int i = 0 ; i <= M+1 ; i++ )s[0] += '&';
for(int i = 0 ; i <= M+1 ; i++ )s[N+1] += '&';
pr();
for(int i = 1 ; i <= N ;i++)
{
cin >> s[i];
s[i] = '&'+s[i]+'&';
}
priority_queue <pair<int,int>> q;
pair<int,int> DS;
q.push({-1,1*maxn+1});
int i , j;
while(!q.empty())
{
DS = q.top();
c = -DS.first;
i = DS.second/maxn;
j = DS.second%maxn;
q.pop();
if(vis[i][j] == 1){continue;}
vis[i][j] = 1;
MAXI = max(MAXI , c);
for(int k = 0 ; k < R.size() ; k++)
{
a = i+R[k].first;
b = j+R[k].second;
if(s[a][b] == '&' || s[a][b] == '.' || vis[a][b] == 1)continue;
if(s[a][b] == s[i][j]){ q.push({-c,a*maxn+b});}
else {q.push({-(c+1),a*maxn+b});}
}
}
cout << MAXI << '\n';
return 0;
}
Compilation message
tracks.cpp: In function 'int main()':
tracks.cpp:51:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
51 | for(int k = 0 ; k < R.size() ; k++)
| ~~^~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
56 ms |
3420 KB |
Output is correct |
2 |
Correct |
0 ms |
604 KB |
Output is correct |
3 |
Correct |
1 ms |
604 KB |
Output is correct |
4 |
Correct |
30 ms |
3544 KB |
Output is correct |
5 |
Correct |
4 ms |
1880 KB |
Output is correct |
6 |
Correct |
0 ms |
604 KB |
Output is correct |
7 |
Correct |
1 ms |
604 KB |
Output is correct |
8 |
Correct |
2 ms |
860 KB |
Output is correct |
9 |
Correct |
1 ms |
860 KB |
Output is correct |
10 |
Correct |
5 ms |
1628 KB |
Output is correct |
11 |
Correct |
7 ms |
1624 KB |
Output is correct |
12 |
Correct |
18 ms |
1880 KB |
Output is correct |
13 |
Correct |
4 ms |
1880 KB |
Output is correct |
14 |
Correct |
4 ms |
1880 KB |
Output is correct |
15 |
Correct |
38 ms |
3420 KB |
Output is correct |
16 |
Correct |
51 ms |
3476 KB |
Output is correct |
17 |
Correct |
20 ms |
3040 KB |
Output is correct |
18 |
Correct |
28 ms |
3544 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
15448 KB |
Output is correct |
2 |
Correct |
118 ms |
9564 KB |
Output is correct |
3 |
Correct |
313 ms |
55812 KB |
Output is correct |
4 |
Correct |
88 ms |
17408 KB |
Output is correct |
5 |
Correct |
127 ms |
34812 KB |
Output is correct |
6 |
Execution timed out |
2092 ms |
72372 KB |
Time limit exceeded |
7 |
Correct |
7 ms |
16216 KB |
Output is correct |
8 |
Correct |
7 ms |
15452 KB |
Output is correct |
9 |
Correct |
5 ms |
940 KB |
Output is correct |
10 |
Correct |
1 ms |
604 KB |
Output is correct |
11 |
Correct |
6 ms |
15964 KB |
Output is correct |
12 |
Correct |
1 ms |
1116 KB |
Output is correct |
13 |
Correct |
116 ms |
9808 KB |
Output is correct |
14 |
Correct |
66 ms |
6748 KB |
Output is correct |
15 |
Correct |
15 ms |
7272 KB |
Output is correct |
16 |
Correct |
61 ms |
3928 KB |
Output is correct |
17 |
Correct |
299 ms |
18848 KB |
Output is correct |
18 |
Correct |
62 ms |
18524 KB |
Output is correct |
19 |
Correct |
93 ms |
17328 KB |
Output is correct |
20 |
Correct |
78 ms |
16116 KB |
Output is correct |
21 |
Correct |
189 ms |
38104 KB |
Output is correct |
22 |
Correct |
127 ms |
36948 KB |
Output is correct |
23 |
Correct |
565 ms |
31660 KB |
Output is correct |
24 |
Correct |
101 ms |
37460 KB |
Output is correct |
25 |
Correct |
260 ms |
59804 KB |
Output is correct |
26 |
Correct |
1418 ms |
47708 KB |
Output is correct |
27 |
Execution timed out |
2021 ms |
62164 KB |
Time limit exceeded |
28 |
Execution timed out |
2090 ms |
76568 KB |
Time limit exceeded |
29 |
Execution timed out |
2021 ms |
76420 KB |
Time limit exceeded |
30 |
Execution timed out |
2021 ms |
77080 KB |
Time limit exceeded |
31 |
Execution timed out |
2019 ms |
43464 KB |
Time limit exceeded |
32 |
Correct |
1838 ms |
64236 KB |
Output is correct |