oj.uz

Submission #770258

# Submission time Handle Problem Language Result Execution time Memory
770258 2023-07-01T03:59:26 Z gun_gan Dango Maker (JOI18_dango_maker) C++17
13 / 100
 117 ms 247856 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX = 3005;

int N, M;
char c[MX][MX];
int h[MX][MX], v[MX][MX];

vector<int> g[MX * MX];
int col[MX * MX];
int w = 0, b = 0;

void dfs(int v) {
      if(col[v]) b++;
      else w++;

      for(auto u : g[v]) {
            if(col[u] == 2) {
                  col[u] = col[v] ^ 1;
                  dfs(u);
            } else {
                  assert(col[u] == (col[v] ^ 1));
            }
      } 
}

int main() {
      cin.tie(0); ios_base::sync_with_stdio(0);

      for(int i = 0; i < MX * MX; i++) col[i] = 2;

      cin >> N >> M;
      for(int i = 0; i < N; i++) {
            for(int j = 0; j < M; j++) {
                  cin >> c[i][j];
            }
      }
      
      // build hori
      int cnt = 0;
      for(int i = 0; i < N; i++) {
            for(int j = 0; j + 2 < M; j++) {
                  if(c[i][j] == 'R' && c[i][j + 1] == 'G' && c[i][j + 2] == 'W') {
                        cnt++;
                        h[i][j] = h[i][j + 1] = h[i][j + 2] = cnt;

                        j += 2;
                  }
            }
      }

      // build vert 
      for(int j = 0; j < M; j++) {
            for(int i = 0; i + 2 < N; i++) {
                  if(c[i][j] == 'R' && c[i + 1][j] == 'G' && c[i + 2][j] == 'W') {
                        cnt++;
                        v[i][j] = v[i + 1][j] = v[i + 2][j] = cnt;

                        i += 2;
                  }
            }
      }

      for(int i = 0; i < N; i++) {
            for(int j = 0; j < M; j++) {
                  if(h[i][j] && v[i][j]) {
                        g[h[i][j]].push_back(v[i][j]);
                        g[v[i][j]].push_back(h[i][j]);
                  }
            }
      }

      assert(cnt <= N * M);

      // traverse graph
      int ans = 0;
      for(int i = 1; i <= cnt; i++) {
            if(col[i] == 2) {
                  col[i] = 0;
                  w = 0, b = 0;
                  dfs(i);
                  ans += max(w, b);
            }
      }

      cout << ans << '\n';
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 247700 KB Output is correct
2 Correct 101 ms 247720 KB Output is correct
3 Correct 101 ms 247704 KB Output is correct
4 Correct 104 ms 247672 KB Output is correct
5 Correct 99 ms 247672 KB Output is correct
6 Correct 101 ms 247724 KB Output is correct
7 Correct 99 ms 247752 KB Output is correct
8 Correct 103 ms 247700 KB Output is correct
9 Correct 100 ms 247752 KB Output is correct
10 Correct 102 ms 247740 KB Output is correct
11 Correct 99 ms 247680 KB Output is correct
12 Correct 101 ms 247744 KB Output is correct
13 Correct 101 ms 247696 KB Output is correct
14 Correct 103 ms 247788 KB Output is correct
15 Correct 101 ms 247664 KB Output is correct
16 Correct 101 ms 247616 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 247700 KB Output is correct
2 Correct 101 ms 247720 KB Output is correct
3 Correct 101 ms 247704 KB Output is correct
4 Correct 104 ms 247672 KB Output is correct
5 Correct 99 ms 247672 KB Output is correct
6 Correct 101 ms 247724 KB Output is correct
7 Correct 99 ms 247752 KB Output is correct
8 Correct 103 ms 247700 KB Output is correct
9 Correct 100 ms 247752 KB Output is correct
10 Correct 102 ms 247740 KB Output is correct
11 Correct 99 ms 247680 KB Output is correct
12 Correct 101 ms 247744 KB Output is correct
13 Correct 101 ms 247696 KB Output is correct
14 Correct 103 ms 247788 KB Output is correct
15 Correct 101 ms 247664 KB Output is correct
16 Correct 101 ms 247616 KB Output is correct
17 Correct 101 ms 247664 KB Output is correct
18 Correct 115 ms 247656 KB Output is correct
19 Correct 99 ms 247744 KB Output is correct
20 Correct 100 ms 247744 KB Output is correct
21 Correct 99 ms 247796 KB Output is correct
22 Correct 100 ms 247804 KB Output is correct
23 Correct 110 ms 247752 KB Output is correct
24 Correct 103 ms 247856 KB Output is correct
25 Correct 101 ms 247632 KB Output is correct
26 Correct 100 ms 247704 KB Output is correct
27 Correct 100 ms 247764 KB Output is correct
28 Correct 102 ms 247756 KB Output is correct
29 Correct 99 ms 247772 KB Output is correct
30 Correct 100 ms 247752 KB Output is correct
31 Correct 107 ms 247756 KB Output is correct
32 Correct 117 ms 247676 KB Output is correct
33 Correct 101 ms 247744 KB Output is correct
34 Incorrect 101 ms 247756 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 247700 KB Output is correct
2 Correct 101 ms 247720 KB Output is correct
3 Correct 101 ms 247704 KB Output is correct
4 Correct 104 ms 247672 KB Output is correct
5 Correct 99 ms 247672 KB Output is correct
6 Correct 101 ms 247724 KB Output is correct
7 Correct 99 ms 247752 KB Output is correct
8 Correct 103 ms 247700 KB Output is correct
9 Correct 100 ms 247752 KB Output is correct
10 Correct 102 ms 247740 KB Output is correct
11 Correct 99 ms 247680 KB Output is correct
12 Correct 101 ms 247744 KB Output is correct
13 Correct 101 ms 247696 KB Output is correct
14 Correct 103 ms 247788 KB Output is correct
15 Correct 101 ms 247664 KB Output is correct
16 Correct 101 ms 247616 KB Output is correct
17 Correct 101 ms 247664 KB Output is correct
18 Correct 115 ms 247656 KB Output is correct
19 Correct 99 ms 247744 KB Output is correct
20 Correct 100 ms 247744 KB Output is correct
21 Correct 99 ms 247796 KB Output is correct
22 Correct 100 ms 247804 KB Output is correct
23 Correct 110 ms 247752 KB Output is correct
24 Correct 103 ms 247856 KB Output is correct
25 Correct 101 ms 247632 KB Output is correct
26 Correct 100 ms 247704 KB Output is correct
27 Correct 100 ms 247764 KB Output is correct
28 Correct 102 ms 247756 KB Output is correct
29 Correct 99 ms 247772 KB Output is correct
30 Correct 100 ms 247752 KB Output is correct
31 Correct 107 ms 247756 KB Output is correct
32 Correct 117 ms 247676 KB Output is correct
33 Correct 101 ms 247744 KB Output is correct
34 Incorrect 101 ms 247756 KB Output isn't correct
35 Halted 0 ms 0 KB -