oj.uz

Submission #770276

# Submission time Handle Problem Language Result Execution time Memory
770276 2023-07-01T04:21:56 Z gun_gan Dango Maker (JOI18_dango_maker) C++17
13 / 100
 135 ms 248040 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX = 3005;

int N, M;
string c[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++;

      assert(col[v] != 2);

      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++) {
            cin >> c[i];
      }
      
      // 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++;
                        assert(h[i][j] == 0 && h[i][j + 1] == 0 && h[i][j + 2] == 0);
                        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++;
                        assert(v[i][j] == 0 && v[i + 1][j] == 0 && v[i + 2][j] == 0);
                        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 <= 2 * N * M / 3);

      // 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 247776 KB Output is correct
2 Correct 103 ms 247720 KB Output is correct
3 Correct 101 ms 247744 KB Output is correct
4 Correct 108 ms 247788 KB Output is correct
5 Correct 101 ms 247688 KB Output is correct
6 Correct 118 ms 247764 KB Output is correct
7 Correct 135 ms 247824 KB Output is correct
8 Correct 116 ms 247808 KB Output is correct
9 Correct 101 ms 247740 KB Output is correct
10 Correct 127 ms 247808 KB Output is correct
11 Correct 125 ms 247724 KB Output is correct
12 Correct 104 ms 247816 KB Output is correct
13 Correct 102 ms 247820 KB Output is correct
14 Correct 103 ms 247816 KB Output is correct
15 Correct 113 ms 247772 KB Output is correct
16 Correct 104 ms 247756 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 247776 KB Output is correct
2 Correct 103 ms 247720 KB Output is correct
3 Correct 101 ms 247744 KB Output is correct
4 Correct 108 ms 247788 KB Output is correct
5 Correct 101 ms 247688 KB Output is correct
6 Correct 118 ms 247764 KB Output is correct
7 Correct 135 ms 247824 KB Output is correct
8 Correct 116 ms 247808 KB Output is correct
9 Correct 101 ms 247740 KB Output is correct
10 Correct 127 ms 247808 KB Output is correct
11 Correct 125 ms 247724 KB Output is correct
12 Correct 104 ms 247816 KB Output is correct
13 Correct 102 ms 247820 KB Output is correct
14 Correct 103 ms 247816 KB Output is correct
15 Correct 113 ms 247772 KB Output is correct
16 Correct 104 ms 247756 KB Output is correct
17 Correct 109 ms 247712 KB Output is correct
18 Correct 105 ms 247832 KB Output is correct
19 Correct 106 ms 247792 KB Output is correct
20 Correct 103 ms 247864 KB Output is correct
21 Correct 119 ms 247880 KB Output is correct
22 Correct 106 ms 247856 KB Output is correct
23 Correct 113 ms 247844 KB Output is correct
24 Correct 109 ms 248040 KB Output is correct
25 Correct 105 ms 247748 KB Output is correct
26 Correct 105 ms 247752 KB Output is correct
27 Correct 108 ms 247884 KB Output is correct
28 Correct 110 ms 247872 KB Output is correct
29 Correct 109 ms 247880 KB Output is correct
30 Correct 105 ms 247788 KB Output is correct
31 Correct 104 ms 247716 KB Output is correct
32 Correct 111 ms 247824 KB Output is correct
33 Correct 104 ms 247784 KB Output is correct
34 Incorrect 104 ms 247780 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 247776 KB Output is correct
2 Correct 103 ms 247720 KB Output is correct
3 Correct 101 ms 247744 KB Output is correct
4 Correct 108 ms 247788 KB Output is correct
5 Correct 101 ms 247688 KB Output is correct
6 Correct 118 ms 247764 KB Output is correct
7 Correct 135 ms 247824 KB Output is correct
8 Correct 116 ms 247808 KB Output is correct
9 Correct 101 ms 247740 KB Output is correct
10 Correct 127 ms 247808 KB Output is correct
11 Correct 125 ms 247724 KB Output is correct
12 Correct 104 ms 247816 KB Output is correct
13 Correct 102 ms 247820 KB Output is correct
14 Correct 103 ms 247816 KB Output is correct
15 Correct 113 ms 247772 KB Output is correct
16 Correct 104 ms 247756 KB Output is correct
17 Correct 109 ms 247712 KB Output is correct
18 Correct 105 ms 247832 KB Output is correct
19 Correct 106 ms 247792 KB Output is correct
20 Correct 103 ms 247864 KB Output is correct
21 Correct 119 ms 247880 KB Output is correct
22 Correct 106 ms 247856 KB Output is correct
23 Correct 113 ms 247844 KB Output is correct
24 Correct 109 ms 248040 KB Output is correct
25 Correct 105 ms 247748 KB Output is correct
26 Correct 105 ms 247752 KB Output is correct
27 Correct 108 ms 247884 KB Output is correct
28 Correct 110 ms 247872 KB Output is correct
29 Correct 109 ms 247880 KB Output is correct
30 Correct 105 ms 247788 KB Output is correct
31 Correct 104 ms 247716 KB Output is correct
32 Correct 111 ms 247824 KB Output is correct
33 Correct 104 ms 247784 KB Output is correct
34 Incorrect 104 ms 247780 KB Output isn't correct
35 Halted 0 ms 0 KB -