# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
958906 | Maaxle | Dango Maker (JOI18_dango_maker) | C++17 | 13 ms | 37720 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
int grade(ll i) {
if (i == -1)
return -1;
return (0+(adj[i][0] != -1)+(adj[i][1] != -1)+(adj[i][2] != -1));
}
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-2) {
range(j, 0, m) {
if (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 (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 = cnt;
for (ll k = 3; k > 0; k--) {
for (ll l = 1; l <= 3; l++) {
range(i, 0, adj.size()) {
if (grade(i) == k && min({grade(adj[i][0]), grade(adj[i][1]), grade(adj[i][2])}) == l) {
ans--;
if (adj[i][0] != -1)
adj[adj[i][0]][0] = -1;
if (adj[i][1] != -1)
adj[adj[i][1]][1] = -1;
if (adj[i][2] != -1)
adj[adj[i][2]][2] = -1;
cout << "";
}
}
}
}
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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |