oj.uz

Submission #1050196

# Submission time Handle Problem Language Result Execution time Memory
1050196 2024-08-09T07:55:59 Z vjudge1 Dango Maker (JOI18_dango_maker) C++17
33 / 100
 419 ms 38448 KB 
#include <bits/stdc++.h>

#ifdef ONLINE_JUDGE
#undef ONLINE_JUDGE
#else
#define ONLINE_JUDGE
#endif

#ifndef ONLINE_JUDGE
#include "debug.cpp"
#else
#define debug(...)
#define debugArr(...)
#endif

#pragma region 
#define int long long

#define vec vector
#define vlong vec<long>
#define vint vec<int>
#define vchar vec<char>
#define vbool vec<bool>
#define vvint vec<vint>
#define vstr vec<string>
#define vstring vstr
#define vpint vec<pair<int, int> >

#define CININT(n) INTCIN(n);
#define INTCIN(n) int n; cin >> n;
#define INTCINVINTCIN(a, n) INTCIN(n); vint a(n); CINV(a, n);
#define TWOVECS(a, b, n) INTCIN(n); vint a(n), b(n); CINV(a, n) CINV (b, n);
#define TWOCOLS(a, b, n) INTCIN(n); vint a(n), b(n); CINVV(a, b, n);

#define ICVK(n, k, a) 			CININT(n); CININT(k); vint a(n); CINV(a, n);
#define ICVK1(n, k, a) 			ICVK(n, k, a)
#define ICVK2(n, k, h, a) 		CININT(n); CININT(k); CININT(h); vint a(n); CINV(a, n);
#define ICVK3(n, k, h, m, a)	CININT(n); CININT(k); CININT(h); CININT(m); vint a(n); CINV(a, n);

#define CIN(n) 			cin >> n;
#define COUT(n) 		cout << n;

#define CINV(a, n) 		for (int i = 0; i < n; i++) {cin >> a[i];}
#define CINVV(a, b, n) 	for (int i = 0; i < n; i++) {cin >> a[i] >> b[i];}

#define COUTV(a, n) 	for (int i = 0; i < n; i++) {cout << a[i] << " ";}
#define COUTVV(a, b, n) 	for (int i = 0; i < n; i++) {cout << a[i] << " " << b[i] << "\n";}

#define NOSPACE(a, n) 	for (int i = 0;i < n;i++) {cout << a[i];}
#define ENDL cout << "\n";

#define SORT(a) sort(a.begin(), a.end());
#define REVERSE(a) reverse(a.begin(), a.end());
#define HAS(theset, num) ((theset.find((num)) != (theset.end())))

#define FOR(i, n) for (int i = 0; i < n; i++)
#define FOR1(i, n) for (int i = 1; i < n; i++)
#define YES if (true) {cout << "YES"; return;}
#define NO if (true) {cout << "NO"; return;}
#define Yes if (true) {cout << "Yes"; return;}
#define No if (true) {cout << "No"; return;}
#define IMPOS if (true) {cout << "Impossible"; return;}
#define IMPOSS IMPOS

#define SP " "
#define NEWLINE "\n"

#define Q int q;cin>>q;while(q--)
#pragma endregion

using namespace std;

vec<vbool> ignore_me_left;
vec<vbool> ignore_me_up;

bool amleft(int x, int y, vec<vec<short> > & grid) {
    if (x < 2) return false;
    return !ignore_me_left[y][x] and
    (grid[y][x] == 3 && grid[y][x-1] == 2 && grid[y][x-2] == 1);
}
bool amup(int x, int y, vec<vec<short> > & grid) {
    if (y < 2) return false;
    return !ignore_me_up[y][x] and
    (grid[y][x] == 3 && grid[y-1][x] == 2 && grid[y-2][x] == 1);
}
int conflictsmeleft(int x, int y, vec<vec<short> > & grid) {
    return amup(x-1, y+1, grid) + amup(x-2, y+2, grid);
}
int conflictsmeup(int x, int y, vec<vec<short> > & grid) {
    return amleft(x+1, y-1, grid) + amleft(x+2, y-2, grid);
}

void pre() {}

// you can do this!
const bool DO_ENDL = true;
const bool MULTI_T = false; // :skull: dont forgorr me!!
void solve() {
    int n, m;
    cin >> n >> m;

    ignore_me_left = vec<vbool>(n+2, vbool(m+2, 0));
    ignore_me_up = vec<vbool>(n+2, vbool(m+2, 0));
    vec<vec<short> > grid(n+2, vec<short>(m+2, 0));
    vec<vec<short> > conflicts(n+2, vec<short>(m+2, 0));
    // vec<vbool> left(n+2, vbool(m+2, 0)); 
    // vec<vbool> up(n+2, vbool(m+2, 0)); 


    for (int y = 0; y < n; y++) {
        string s;
        cin >> s;
        for (int x = 0; x < m; x++) {
            char c = s[x];
            if (c == 'R') {
                grid[y][x] = 1;
            }
            if (c == 'G') {
                grid[y][x] = 2;
            }
            if (c == 'W') {
                grid[y][x] = 3;
            }
        }
    }

    debug(grid);

    int counter = 0;

    // conflictless
    for (int x = 0; x < m; x++) {
        for (int y = 0; y < n; y++) {
            if (amleft(x, y, grid)) {
                int conflicts = conflictsmeleft(x, y, grid);
                if (conflicts == 0) {
                    counter++;
                    // debug(x, y);
                    grid[y][x] = 0;
                }
            } 
            if (amup(x, y, grid)) {
                int conflicts = conflictsmeup(x, y, grid);
                if (conflicts == 0) {
                    counter++;
                    // debug(x, y);
                    grid[y][x] = 0;
                }
                // debug(conflicts, x, y);
            }

        }
    }
    for (int x = m-1; x != -1; x--) {
        for (int y = n-1; y != -1; y--) {
            if (amleft(x, y, grid)) {
                int conflicts = conflictsmeleft(x, y, grid);
                if (conflicts == 0) {
                    counter++;
                    // debug(x, y);
                    grid[y][x] = 0;
                }
            } 
            if (amup(x, y, grid)) {
                int conflicts = conflictsmeup(x, y, grid);
                if (conflicts == 0) {
                    counter++;
                    // debug(x, y);
                    grid[y][x] = 0;
                }
            }

        }
    }
    // above must be done iteratively multiple times from different dirs I tihnk

    // 1 conflict
    for (int x = m-1; x != -1; x--) {
        for (int y = n-1; y != -1; y--) {
            if (amup(x, y, grid)) {
                int conflicts = conflictsmeup(x, y, grid);
                if (conflicts == 0) {
                    counter++;
                    debug(x, y);
                    grid[y][x] = 0;
                    grid[y-1][x] = 0;
                    grid[y-2][x] = 0;
                }
            }
            if (amleft(x, y, grid)) {
                int conflicts = conflictsmeleft(x, y, grid);
                if (conflicts <= 1) {
                    counter++;
                    debug(x, y);
                    grid[y][x] = 0;
                    grid[y][x-1] = 0;
                    grid[y][x-2] = 0;
                }
            } 
            if (amup(x, y, grid)) {
                int conflicts = conflictsmeup(x, y, grid);
                if (conflicts <= 1) {
                    counter++;
                    debug(x, y);
                    grid[y][x] = 0;
                    grid[y-1][x] = 0;
                    grid[y-2][x] = 0;
                }
            }

        }
    }
    for (int x = 0; x < m; x++) {
        for (int y = 0; y < n; y++) {
            if (amup(x, y, grid)) {
                int conflicts = conflictsmeup(x, y, grid);
                if (conflicts == 0) {
                    counter++;
                    debug(x, y);
                    grid[y][x] = 0;
                    grid[y-1][x] = 0;
                    grid[y-2][x] = 0;
                }
            }
            if (amleft(x, y, grid)) {
                int conflicts = conflictsmeleft(x, y, grid);
                if (conflicts <= 1) {
                    counter++;
                    debug(x, y);
                    grid[y][x] = 0;
                    grid[y][x-1] = 0;
                    grid[y][x-2] = 0;
                }
            } 
            if (amup(x, y, grid)) {
                int conflicts = conflictsmeup(x, y, grid);
                if (conflicts <= 1) {
                    counter++;
                    debug(x, y);
                    grid[y][x] = 0;
                    grid[y-1][x] = 0;
                    grid[y-2][x] = 0;
                }
            }

        }
    }
    




    cout << counter;

}


signed main() {
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios::sync_with_stdio(false);
	pre();
	if (not MULTI_T)
		{solve();
		return 0;}
	
	CININT(t);
	while (t--) {
		solve();
		if (DO_ENDL)
			ENDL;
	}
}

Compilation message

dango_maker.cpp:16: warning: ignoring '#pragma region ' [-Wunknown-pragmas]
   16 | #pragma region
      | 
dango_maker.cpp:69: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
   69 | #pragma endregion
      |

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 600 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 456 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 600 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 456 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 344 KB Output is correct
55 Correct 1 ms 1112 KB Output is correct
56 Correct 1 ms 552 KB Output is correct
57 Correct 1 ms 860 KB Output is correct
58 Correct 44 ms 4836 KB Output is correct
59 Correct 408 ms 38448 KB Output is correct
60 Correct 411 ms 38448 KB Output is correct
61 Correct 419 ms 38232 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 409 ms 37308 KB Output is correct
64 Correct 339 ms 38232 KB Output is correct
65 Correct 323 ms 38232 KB Output is correct
66 Incorrect 364 ms 38448 KB Output isn't correct
67 Halted 0 ms 0 KB -