#include <bits/stdc++.h>
#define range(it, a, b) for (ll it = a; it < b; it++)
#define all(x) begin(x), end(x)
#define ll long long
#define ull unsigned long long
#define INF64 ((ll) 1 << 62)
#define INF32 (1 << 30)
#define mset multiset
#define uset unordered_set
#define umap unordered_map
#define pqueue priority_queue
#define ptr(A) shared_ptr<A>
using namespace std;
void setio (string name) {
ios_base::sync_with_stdio(0);
cin.tie(0);
if (name.size()) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}
ll n, m;
char mat[(ll)3e3][(ll)3e3];
int memo[(ll)3e3][(ll)3e3];
vector<vector<ll>> adj;
vector<bool> vis;
pair<ll, ll> dfs(ll i, bool col) {
pair<ll, ll> ans = {!col, col};
vis[i] = 1;
for (ll& k : adj[i]) {
if (k != -1 && !vis[k]) {
pair<ll, ll> aux = dfs(k, !col);
ans.first += aux.first;
ans.second += aux.second;
}
}
return ans;
}
void solve() {
cin >> n >> m;
memset(memo, -1, sizeof(memo));
range(i, 0, n) {
range(j, 0, m)
cin >> mat[i][j];
}
ll cnt = 0;
range(i, 0, n) {
range(j, 0, m) {
if (i+2 < n && mat[i][j] == 'R' && mat[i+1][j] == 'G' && mat[i+2][j] == 'W') {
adj.push_back({-1, -1, -1});
memo[i][j] = memo[i+1][j] = memo[i+2][j] = cnt;
cnt++;
}
}
}
range(i, 0, n) {
range(j, 0, m) {
if (j+2 < m && mat[i][j] == 'R' && mat[i][j+1] == 'G' && mat[i][j+2] == 'W') {
adj.push_back({memo[i][j], memo[i][j+1], memo[i][j+2]});
if (memo[i][j] != -1) {
adj[memo[i][j]][0] = cnt;
}
if (memo[i][j+1] != -1) {
adj[memo[i][j+1]][1] = cnt;
}
if (memo[i][j+2] != -1) {
adj[memo[i][j+2]][2] = cnt;
}
cnt++;
}
}
}
ll ans = 0;
vis.resize(adj.size(), 0);
range(i, 0, adj.size()) {
if (!vis[i]) {
pair<ll, ll> sub = dfs(i, 0);
ans += max(sub.first, sub.second);
}
}
cout << ans;
}
int main () {
setio("");
ll t = 1;
// cin >> t;
while (t--) solve();
}
// IT'S TOUGH, I KNOW
// BUT YOU'D RATHER DIE FIGHTING THAN LIVE ON YOUR KNEES
// THOUG H YOU WON'T DO NEITHER OF THOSE
// IMPOSSIBLE, AS IT'S AGAINST YOUR NATURE
// AS YOU ALREADY WON
// I SEE YOUR MEDAL HANGING FROM YOUR NECK
// SHINING AS NOTHING YOU'VE EVER HAD
// THOUSANDS AND THOUSANDS OF LINES
// YOU AREADY MADE IT THIS FAR
// AND WHO COULD TELL HOW FAR YOU WILL GET...
// BUT YOU?
// THEN COME ON, YOU BASTARD!
// GO CLEAR YOUR MIND AND STAND
// AS EACH OF THOSE LINES IS A STEP CLOSER
// CLOSER TO THE GREATNESS YOU PURSUE
// CLOSER TO THE GREATNESS YOU ALREADY HAVE
Compilation message
dango_maker.cpp: In function 'void solve()':
dango_maker.cpp:3:44: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
3 | #define range(it, a, b) for (ll it = a; it < b; it++)
......
86 | range(i, 0, adj.size()) {
| ~~~~~~~~~~~~~~~~
dango_maker.cpp:86:5: note: in expansion of macro 'range'
86 | range(i, 0, adj.size()) {
| ^~~~~
dango_maker.cpp: In function 'void setio(std::string)':
dango_maker.cpp:21:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
21 | freopen((name + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:22:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
22 | freopen((name + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
37468 KB |
Output is correct |
2 |
Correct |
6 ms |
37468 KB |
Output is correct |
3 |
Correct |
5 ms |
37468 KB |
Output is correct |
4 |
Correct |
8 ms |
37468 KB |
Output is correct |
5 |
Correct |
5 ms |
37468 KB |
Output is correct |
6 |
Correct |
5 ms |
37468 KB |
Output is correct |
7 |
Correct |
5 ms |
37468 KB |
Output is correct |
8 |
Correct |
7 ms |
37468 KB |
Output is correct |
9 |
Correct |
5 ms |
37468 KB |
Output is correct |
10 |
Correct |
5 ms |
37468 KB |
Output is correct |
11 |
Correct |
6 ms |
37468 KB |
Output is correct |
12 |
Correct |
5 ms |
37468 KB |
Output is correct |
13 |
Correct |
5 ms |
37468 KB |
Output is correct |
14 |
Correct |
6 ms |
37468 KB |
Output is correct |
15 |
Correct |
5 ms |
37468 KB |
Output is correct |
16 |
Correct |
5 ms |
37468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
37468 KB |
Output is correct |
2 |
Correct |
6 ms |
37468 KB |
Output is correct |
3 |
Correct |
5 ms |
37468 KB |
Output is correct |
4 |
Correct |
8 ms |
37468 KB |
Output is correct |
5 |
Correct |
5 ms |
37468 KB |
Output is correct |
6 |
Correct |
5 ms |
37468 KB |
Output is correct |
7 |
Correct |
5 ms |
37468 KB |
Output is correct |
8 |
Correct |
7 ms |
37468 KB |
Output is correct |
9 |
Correct |
5 ms |
37468 KB |
Output is correct |
10 |
Correct |
5 ms |
37468 KB |
Output is correct |
11 |
Correct |
6 ms |
37468 KB |
Output is correct |
12 |
Correct |
5 ms |
37468 KB |
Output is correct |
13 |
Correct |
5 ms |
37468 KB |
Output is correct |
14 |
Correct |
6 ms |
37468 KB |
Output is correct |
15 |
Correct |
5 ms |
37468 KB |
Output is correct |
16 |
Correct |
5 ms |
37468 KB |
Output is correct |
17 |
Correct |
5 ms |
37464 KB |
Output is correct |
18 |
Correct |
6 ms |
37464 KB |
Output is correct |
19 |
Correct |
5 ms |
37568 KB |
Output is correct |
20 |
Correct |
5 ms |
37464 KB |
Output is correct |
21 |
Correct |
7 ms |
37468 KB |
Output is correct |
22 |
Correct |
5 ms |
37464 KB |
Output is correct |
23 |
Correct |
5 ms |
37468 KB |
Output is correct |
24 |
Correct |
6 ms |
37468 KB |
Output is correct |
25 |
Correct |
5 ms |
37532 KB |
Output is correct |
26 |
Correct |
5 ms |
37524 KB |
Output is correct |
27 |
Correct |
6 ms |
37468 KB |
Output is correct |
28 |
Correct |
6 ms |
37468 KB |
Output is correct |
29 |
Correct |
5 ms |
37468 KB |
Output is correct |
30 |
Correct |
6 ms |
37468 KB |
Output is correct |
31 |
Correct |
5 ms |
37468 KB |
Output is correct |
32 |
Correct |
5 ms |
37468 KB |
Output is correct |
33 |
Correct |
5 ms |
37468 KB |
Output is correct |
34 |
Incorrect |
6 ms |
37468 KB |
Output isn't correct |
35 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
37468 KB |
Output is correct |
2 |
Correct |
6 ms |
37468 KB |
Output is correct |
3 |
Correct |
5 ms |
37468 KB |
Output is correct |
4 |
Correct |
8 ms |
37468 KB |
Output is correct |
5 |
Correct |
5 ms |
37468 KB |
Output is correct |
6 |
Correct |
5 ms |
37468 KB |
Output is correct |
7 |
Correct |
5 ms |
37468 KB |
Output is correct |
8 |
Correct |
7 ms |
37468 KB |
Output is correct |
9 |
Correct |
5 ms |
37468 KB |
Output is correct |
10 |
Correct |
5 ms |
37468 KB |
Output is correct |
11 |
Correct |
6 ms |
37468 KB |
Output is correct |
12 |
Correct |
5 ms |
37468 KB |
Output is correct |
13 |
Correct |
5 ms |
37468 KB |
Output is correct |
14 |
Correct |
6 ms |
37468 KB |
Output is correct |
15 |
Correct |
5 ms |
37468 KB |
Output is correct |
16 |
Correct |
5 ms |
37468 KB |
Output is correct |
17 |
Correct |
5 ms |
37464 KB |
Output is correct |
18 |
Correct |
6 ms |
37464 KB |
Output is correct |
19 |
Correct |
5 ms |
37568 KB |
Output is correct |
20 |
Correct |
5 ms |
37464 KB |
Output is correct |
21 |
Correct |
7 ms |
37468 KB |
Output is correct |
22 |
Correct |
5 ms |
37464 KB |
Output is correct |
23 |
Correct |
5 ms |
37468 KB |
Output is correct |
24 |
Correct |
6 ms |
37468 KB |
Output is correct |
25 |
Correct |
5 ms |
37532 KB |
Output is correct |
26 |
Correct |
5 ms |
37524 KB |
Output is correct |
27 |
Correct |
6 ms |
37468 KB |
Output is correct |
28 |
Correct |
6 ms |
37468 KB |
Output is correct |
29 |
Correct |
5 ms |
37468 KB |
Output is correct |
30 |
Correct |
6 ms |
37468 KB |
Output is correct |
31 |
Correct |
5 ms |
37468 KB |
Output is correct |
32 |
Correct |
5 ms |
37468 KB |
Output is correct |
33 |
Correct |
5 ms |
37468 KB |
Output is correct |
34 |
Incorrect |
6 ms |
37468 KB |
Output isn't correct |
35 |
Halted |
0 ms |
0 KB |
- |