#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define sz(v) (int)v.size()
#define ps(y) cout << fixed << setprecision(y)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define trav(x, v) for(auto &x: v)
#define w(t) int t; cin >> t; while(t--)
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = a; i >= b; i--)
#define rep0(i, n) rep(i, 0, n - 1)
#define rrep0(i, n) rrep(i, n - 1, 0)
#define rep1(i, n) rep(i, 1, n)
#define rrep1(i, n) rrep(i, n, 1)
#define inp(arr, n) rep0(i, n) cin >> arr[i];
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef map<ll, ll> mii;
typedef map<char, ll> mci;
typedef priority_queue<ll> pq_mx;
typedef priority_queue<ll, vi, greater<>> pq_mn;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> pbds;
/*
* find_by_order(i) -> returns an iterator to the element at ith position (0 based)
* order_of_key(i) -> returns the position of element i (0 based)
*/
const int N = 4e3 + 5;
const int mod = 1e9 + 7;
//const int mod = 998244353;
const ll inf = 1e18;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void fio() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
}
int n, m, dist[N][N];
string a[N];
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
bool valid(int x, int y) {
return x >= 0 and y >= 0 and x < n and y < m;
}
int main() {
fio();
cin >> n >> m;
rep0(x, n) cin >> a[x];
queue<pii> q;
int mx = 1;
q.emplace(0, 0), dist[0][0] = 1;
while (!q.empty()) {
auto[i, j] = q.front();
q.pop(), mx = max(mx, dist[i][j]);
rep0(d, 4) {
int x = i + dx[d], y = j + dy[d];
if (valid(x, y) and a[x][y] != '.' and dist[x][y] == 0) {
int l = (a[x][y] != a[i][j]);
dist[x][y] = l + dist[i][j], q.emplace(x, y);
}
}
}
cout << mx;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
11 ms |
3532 KB |
Output isn't correct |
| 2 |
Correct |
1 ms |
460 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
588 KB |
Output isn't correct |
| 4 |
Incorrect |
6 ms |
3148 KB |
Output isn't correct |
| 5 |
Incorrect |
3 ms |
1888 KB |
Output isn't correct |
| 6 |
Correct |
0 ms |
460 KB |
Output is correct |
| 7 |
Incorrect |
1 ms |
588 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
716 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
844 KB |
Output isn't correct |
| 10 |
Incorrect |
2 ms |
1612 KB |
Output isn't correct |
| 11 |
Incorrect |
2 ms |
1356 KB |
Output isn't correct |
| 12 |
Incorrect |
4 ms |
1996 KB |
Output isn't correct |
| 13 |
Incorrect |
2 ms |
1868 KB |
Output isn't correct |
| 14 |
Incorrect |
3 ms |
1868 KB |
Output isn't correct |
| 15 |
Incorrect |
7 ms |
3404 KB |
Output isn't correct |
| 16 |
Incorrect |
8 ms |
3532 KB |
Output isn't correct |
| 17 |
Incorrect |
7 ms |
3404 KB |
Output isn't correct |
| 18 |
Incorrect |
6 ms |
3148 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
15948 KB |
Output is correct |
| 2 |
Incorrect |
28 ms |
10436 KB |
Output isn't correct |
| 3 |
Incorrect |
125 ms |
59716 KB |
Output isn't correct |
| 4 |
Incorrect |
53 ms |
25640 KB |
Output isn't correct |
| 5 |
Correct |
113 ms |
42664 KB |
Output is correct |
| 6 |
Incorrect |
899 ms |
80708 KB |
Output isn't correct |
| 7 |
Correct |
11 ms |
16588 KB |
Output is correct |
| 8 |
Correct |
10 ms |
15948 KB |
Output is correct |
| 9 |
Incorrect |
1 ms |
716 KB |
Output isn't correct |
| 10 |
Correct |
1 ms |
460 KB |
Output is correct |
| 11 |
Correct |
10 ms |
16332 KB |
Output is correct |
| 12 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 13 |
Incorrect |
28 ms |
10360 KB |
Output isn't correct |
| 14 |
Incorrect |
17 ms |
7048 KB |
Output isn't correct |
| 15 |
Correct |
17 ms |
9348 KB |
Output is correct |
| 16 |
Incorrect |
13 ms |
4288 KB |
Output isn't correct |
| 17 |
Incorrect |
70 ms |
21196 KB |
Output isn't correct |
| 18 |
Correct |
69 ms |
28240 KB |
Output is correct |
| 19 |
Incorrect |
56 ms |
25664 KB |
Output isn't correct |
| 20 |
Incorrect |
33 ms |
19200 KB |
Output isn't correct |
| 21 |
Incorrect |
79 ms |
41392 KB |
Output isn't correct |
| 22 |
Correct |
113 ms |
42552 KB |
Output is correct |
| 23 |
Incorrect |
158 ms |
34612 KB |
Output isn't correct |
| 24 |
Correct |
89 ms |
38636 KB |
Output is correct |
| 25 |
Correct |
386 ms |
81056 KB |
Output is correct |
| 26 |
Correct |
687 ms |
68676 KB |
Output is correct |
| 27 |
Incorrect |
896 ms |
80908 KB |
Output isn't correct |
| 28 |
Incorrect |
893 ms |
80812 KB |
Output isn't correct |
| 29 |
Incorrect |
893 ms |
80824 KB |
Output isn't correct |
| 30 |
Incorrect |
893 ms |
79320 KB |
Output isn't correct |
| 31 |
Incorrect |
555 ms |
61668 KB |
Output isn't correct |
| 32 |
Incorrect |
760 ms |
80824 KB |
Output isn't correct |
