oj.uz

답안 #770250

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770250 2023-07-01T03:31:09 Z gun_gan Dango Maker (JOI18_dango_maker) C++17
13 / 100
 122 ms 247880 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX = 3005;

int N, M;
char c[MX][MX];
int e[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++;
                        e[i][j] = e[i][j + 1] = e[i][j + 2] = cnt;
                  }
            }
      }

      // build vert and add edge
      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++;
                        if(e[i][j]) {
                              g[cnt].push_back(e[i][j]);
                              g[e[i][j]].push_back(cnt);
                        }
                        if(e[i + 1][j]) {
                              g[cnt].push_back(e[i + 1][j]);
                              g[e[i + 1][j]].push_back(cnt);
                        }
                        if(e[i + 2][j]) {
                              g[cnt].push_back(e[i + 2][j]);
                              g[e[i + 2][j]].push_back(cnt);
                        }
                  }
            }
      }

      // 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';
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from dango_maker.cpp:1:
dango_maker.cpp: In function 'void dfs(int)':
dango_maker.cpp:24:33: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses]
   24 |                   assert(col[u] == col[v] ^ 1);
      |                          ~~~~~~~^~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 247664 KB Output is correct
2 Correct 109 ms 247724 KB Output is correct
3 Correct 108 ms 247720 KB Output is correct
4 Correct 112 ms 247688 KB Output is correct
5 Correct 112 ms 247728 KB Output is correct
6 Correct 106 ms 247712 KB Output is correct
7 Correct 108 ms 247692 KB Output is correct
8 Correct 104 ms 247724 KB Output is correct
9 Correct 115 ms 247692 KB Output is correct
10 Correct 113 ms 247720 KB Output is correct
11 Correct 111 ms 247692 KB Output is correct
12 Correct 105 ms 247688 KB Output is correct
13 Correct 110 ms 247672 KB Output is correct
14 Correct 120 ms 247724 KB Output is correct
15 Correct 108 ms 247632 KB Output is correct
16 Correct 108 ms 247644 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 247664 KB Output is correct
2 Correct 109 ms 247724 KB Output is correct
3 Correct 108 ms 247720 KB Output is correct
4 Correct 112 ms 247688 KB Output is correct
5 Correct 112 ms 247728 KB Output is correct
6 Correct 106 ms 247712 KB Output is correct
7 Correct 108 ms 247692 KB Output is correct
8 Correct 104 ms 247724 KB Output is correct
9 Correct 115 ms 247692 KB Output is correct
10 Correct 113 ms 247720 KB Output is correct
11 Correct 111 ms 247692 KB Output is correct
12 Correct 105 ms 247688 KB Output is correct
13 Correct 110 ms 247672 KB Output is correct
14 Correct 120 ms 247724 KB Output is correct
15 Correct 108 ms 247632 KB Output is correct
16 Correct 108 ms 247644 KB Output is correct
17 Correct 112 ms 247736 KB Output is correct
18 Correct 108 ms 247712 KB Output is correct
19 Correct 107 ms 247728 KB Output is correct
20 Correct 107 ms 247776 KB Output is correct
21 Correct 109 ms 247696 KB Output is correct
22 Correct 109 ms 247712 KB Output is correct
23 Correct 119 ms 247848 KB Output is correct
24 Correct 122 ms 247744 KB Output is correct
25 Correct 118 ms 247812 KB Output is correct
26 Correct 116 ms 247616 KB Output is correct
27 Correct 109 ms 247880 KB Output is correct
28 Correct 105 ms 247712 KB Output is correct
29 Correct 108 ms 247780 KB Output is correct
30 Correct 104 ms 247712 KB Output is correct
31 Correct 103 ms 247744 KB Output is correct
32 Correct 106 ms 247668 KB Output is correct
33 Correct 109 ms 247756 KB Output is correct
34 Incorrect 104 ms 247760 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 247664 KB Output is correct
2 Correct 109 ms 247724 KB Output is correct
3 Correct 108 ms 247720 KB Output is correct
4 Correct 112 ms 247688 KB Output is correct
5 Correct 112 ms 247728 KB Output is correct
6 Correct 106 ms 247712 KB Output is correct
7 Correct 108 ms 247692 KB Output is correct
8 Correct 104 ms 247724 KB Output is correct
9 Correct 115 ms 247692 KB Output is correct
10 Correct 113 ms 247720 KB Output is correct
11 Correct 111 ms 247692 KB Output is correct
12 Correct 105 ms 247688 KB Output is correct
13 Correct 110 ms 247672 KB Output is correct
14 Correct 120 ms 247724 KB Output is correct
15 Correct 108 ms 247632 KB Output is correct
16 Correct 108 ms 247644 KB Output is correct
17 Correct 112 ms 247736 KB Output is correct
18 Correct 108 ms 247712 KB Output is correct
19 Correct 107 ms 247728 KB Output is correct
20 Correct 107 ms 247776 KB Output is correct
21 Correct 109 ms 247696 KB Output is correct
22 Correct 109 ms 247712 KB Output is correct
23 Correct 119 ms 247848 KB Output is correct
24 Correct 122 ms 247744 KB Output is correct
25 Correct 118 ms 247812 KB Output is correct
26 Correct 116 ms 247616 KB Output is correct
27 Correct 109 ms 247880 KB Output is correct
28 Correct 105 ms 247712 KB Output is correct
29 Correct 108 ms 247780 KB Output is correct
30 Correct 104 ms 247712 KB Output is correct
31 Correct 103 ms 247744 KB Output is correct
32 Correct 106 ms 247668 KB Output is correct
33 Correct 109 ms 247756 KB Output is correct
34 Incorrect 104 ms 247760 KB Output isn't correct
35 Halted 0 ms 0 KB -