Submission #562941

#	Time	Username	Problem	Language	Result	Execution time	Memory
562941		dattranxxx	Dango Maker (JOI18_dango_maker)	C++11	0 / 100	14 ms	24168 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.

dango_maker

#include<bits/stdc++.h> using namespace std; using ll = long long; const int N = 1000 + 5; string s[N]; int n, m, d = 0; int pos[N][N][4]; // left down right up #define LEFT 0 #define DOWN 1 #define RIGHT 2 #define UP 3 int tag(int i, int j, int dir) { if (i < 0 || j < 0 || i >= n || j >= m) return 0; return pos[i][j][dir]; } vector<int> G[N * N]; bitset<N * N> vis; int c[2]; void dfs(int u, int col = 0) { vis[u] = 1, c[col]++; for (int v : G[u]) if (!vis[v]) dfs(v, col ^ 1); } int main() { cin.tie(0)->sync_with_stdio(0); cout.tie(0); cin >> n >> m; for (int i = 0; i < n; ++i) cin >> s[i]; for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) { if (j <= m-3 && s[i][j] == 'R' && s[i][j+1] == 'G' && s[i][j+2] == 'W') pos[i][j][LEFT] = ++d; if (i <= n-3 && s[i][j] == 'R' && s[i+1][j] == 'G' && s[i+2][j] == 'W') pos[i][j][DOWN] = ++d; if (j >= 2 && s[i][j] == 'R' && s[i][j-1] == 'G' && s[i][j-2] == 'W') pos[i][j][RIGHT] = ++d; if (i >= 2 && s[i][j] == 'R' && s[i-1][j] == 'G' && s[i-2][j] == 'W') pos[i][j][UP] = ++d; } for (int i = 0, u, v; i < n; ++i) for (int j = 0; j < m; ++j) { if (u = pos[i][j][LEFT]) { if (v = pos[i][j][DOWN]) G[u].emplace_back(v); if (v = pos[i][j][RIGHT]) G[u].emplace_back(v); if (v = pos[i][j][UP]) G[u].emplace_back(v); if (v = tag(i-1, j+1, DOWN)) G[u].emplace_back(v); if (v = tag(i+1, j+1, UP)) G[u].emplace_back(v); if (v = tag(i-2, j+2, DOWN)) G[u].emplace_back(v); if (v = tag(i+2, j+2, UP)) G[u].emplace_back(v); if (v = tag(i, j+4, RIGHT)) G[u].emplace_back(v); } if (u = pos[i][j][DOWN]) { if (v = pos[i][j][LEFT]) G[u].emplace_back(v); if (v = pos[i][j][RIGHT]) G[u].emplace_back(v); if (v = pos[i][j][UP]) G[u].emplace_back(v); if (v = tag(i+1, j-1, RIGHT)) G[u].emplace_back(v); if (v = tag(i+1, j+1, LEFT)) G[u].emplace_back(v); if (v = tag(i+2, j-2, RIGHT)) G[u].emplace_back(v); if (v = tag(i+2, j+2, LEFT)) G[u].emplace_back(v); if (v = tag(i+4, j, UP)) G[u].emplace_back(v); } if (u = pos[i][j][RIGHT]) { if (v = pos[i][j][DOWN]) G[u].emplace_back(v); if (v = pos[i][j][LEFT]) G[u].emplace_back(v); if (v = pos[i][j][UP]) G[u].emplace_back(v); if (v = tag(i-1, j-1, DOWN)) G[u].emplace_back(v); if (v = tag(i+1, j-1, UP)) G[u].emplace_back(v); if (v = tag(i-2, j-2, DOWN)) G[u].emplace_back(v); if (v = tag(i+2, j-2, UP)) G[u].emplace_back(v); if (v = tag(i, j-4, LEFT)) G[u].emplace_back(v); } if (u = pos[i][j][UP]) { if (v = pos[i][j][LEFT]) G[u].emplace_back(v); if (v = pos[i][j][RIGHT]) G[u].emplace_back(v); if (v = pos[i][j][DOWN]) G[u].emplace_back(v); if (v = tag(i-1, j-1, RIGHT)) G[u].emplace_back(v); if (v = tag(i-1, j+1, LEFT)) G[u].emplace_back(v); if (v = tag(i-2, j-2, RIGHT)) G[u].emplace_back(v); if (v = tag(i-2, j+2, LEFT)) G[u].emplace_back(v); if (v = tag(i-4, j, DOWN)) G[u].emplace_back(v); } } int res = 0; for (int i = 1; i <= d; ++i) if (!vis[i]) { c[0] = 0, c[1] = 0, dfs(i); res += max(c[0], c[1]); } cout << res; return 0; }

Compilation message (stderr)

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:36:9: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   36 |   if (u = pos[i][j][LEFT]) {
      |       ~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:37:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   37 |    if (v = pos[i][j][DOWN]) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:38:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   38 |    if (v = pos[i][j][RIGHT]) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~
dango_maker.cpp:39:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   39 |    if (v = pos[i][j][UP]) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~
dango_maker.cpp:41:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   41 |    if (v = tag(i-1, j+1, DOWN)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:42:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   42 |    if (v = tag(i+1, j+1, UP)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~
dango_maker.cpp:43:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   43 |    if (v = tag(i-2, j+2, DOWN)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:44:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   44 |    if (v = tag(i+2, j+2, UP)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~
dango_maker.cpp:45:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   45 |    if (v = tag(i, j+4, RIGHT)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:47:9: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   47 |   if (u = pos[i][j][DOWN]) {
      |       ~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:48:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   48 |    if (v = pos[i][j][LEFT]) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:49:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   49 |    if (v = pos[i][j][RIGHT]) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~
dango_maker.cpp:50:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   50 |    if (v = pos[i][j][UP]) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~
dango_maker.cpp:52:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   52 |    if (v = tag(i+1, j-1, RIGHT)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:53:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   53 |    if (v = tag(i+1, j+1, LEFT)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:54:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   54 |    if (v = tag(i+2, j-2, RIGHT)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:55:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   55 |    if (v = tag(i+2, j+2, LEFT)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:56:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   56 |    if (v = tag(i+4, j, UP)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:58:9: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   58 |   if (u = pos[i][j][RIGHT]) {
      |       ~~^~~~~~~~~~~~~~~~~~
dango_maker.cpp:59:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   59 |    if (v = pos[i][j][DOWN]) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:60:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   60 |    if (v = pos[i][j][LEFT]) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:61:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   61 |    if (v = pos[i][j][UP]) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~
dango_maker.cpp:63:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   63 |    if (v = tag(i-1, j-1, DOWN)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:64:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   64 |    if (v = tag(i+1, j-1, UP)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~
dango_maker.cpp:65:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   65 |    if (v = tag(i-2, j-2, DOWN)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:66:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   66 |    if (v = tag(i+2, j-2, UP)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~
dango_maker.cpp:67:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   67 |    if (v = tag(i, j-4, LEFT)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~
dango_maker.cpp:69:9: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   69 |   if (u = pos[i][j][UP]) {
      |       ~~^~~~~~~~~~~~~~~
dango_maker.cpp:70:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   70 |    if (v = pos[i][j][LEFT]) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:71:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   71 |    if (v = pos[i][j][RIGHT]) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~
dango_maker.cpp:72:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   72 |    if (v = pos[i][j][DOWN]) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:74:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   74 |    if (v = tag(i-1, j-1, RIGHT)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:75:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   75 |    if (v = tag(i-1, j+1, LEFT)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:76:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   76 |    if (v = tag(i-2, j-2, RIGHT)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:77:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   77 |    if (v = tag(i-2, j+2, LEFT)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:78:10: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   78 |    if (v = tag(i-4, j, DOWN)) G[u].emplace_back(v);
      |        ~~^~~~~~~~~~~~~~~~~~~

Subtask 10 / 13

#	Verdict	Execution time	Memory	Grader output
Fetching results...

Subtask 20 / 20

#	Verdict	Execution time	Memory	Grader output
Fetching results...

Subtask 30 / 67

#	Verdict	Execution time	Memory	Grader output
Fetching results...