oj.uz

Submission #330151

# Submission time Handle Problem Language Result Execution time Memory
330151 2020-11-24T04:10:40 Z casperwang Dango Maker (JOI18_dango_maker) C++14
13 / 100
 1 ms 500 KB 
#include <bits/stdc++.h>
#define pb push_back
using namespace std;

const int MAXN = 3000;
int n, m;
string mp[MAXN+1], ss;
int p[MAXN+1][MAXN+1];
int cnt, tmp, sze;
int ans;
vector <vector<int>> path;
vector <bool> vis;

int dfs(int now, bool flg) {
  int s = 1;
  vis[now] = 1;
  if (flg) tmp++;
  for (int i : path[now]) {
    if (vis[i]) continue;
    s += dfs(i, !flg);
  }
  return s;
}

signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> ss;
    mp[i] = ' ' + ss;
  }
  path.pb(vector<int>());
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (i >= 3 && mp[i][j] == 'W' && mp[i-1][j] == 'G' && mp[i-2][j] == 'R') {
        cnt++;
        path.pb(vector<int>());
        if (p[i][j]) {
          path[p[i][j]].pb(cnt);
          path[cnt].pb(p[i][j]);
        } else p[i][j] = cnt;
        if (p[i-1][j]) {
          path[p[i-1][j]].pb(cnt);
          path[cnt].pb(p[i-1][j]);
        } else p[i-1][j] = cnt;
        if (p[i-2][j]) {
          path[p[i-2][j]].pb(cnt);
          path[cnt].pb(p[i-2][j]);
        } else p[i-2][j] = cnt;
      }
      if (j >= 3 && mp[i][j] == 'W' && mp[i][j-1] == 'G' && mp[i][j-2] == 'R') {
        cnt++;
        path.pb(vector<int>());
        if (p[i][j]) {
          path[p[i][j]].pb(cnt);
          path[cnt].pb(p[i][j]);
        } else p[i][j] = cnt;
        if (p[i][j-1]) {
          path[p[i][j-1]].pb(cnt);
          path[cnt].pb(p[i][j-1]);
        } else p[i][j-1] = cnt;
        if (p[i][j-2]) {
          path[p[i][j-2]].pb(cnt);
          path[cnt].pb(p[i][j-2]);
        } else p[i][j-2] = cnt;
      }
    }
  }
  vis.resize(cnt+1);
  for (int i = 1; i <= cnt; i++) {
    if (vis[i]) continue;
    tmp = 0;
    sze = dfs(i, 0);
    ans += max(tmp, sze - tmp);
  }
  cout << ans << "\n";
  return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 500 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Incorrect 1 ms 492 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 500 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Incorrect 1 ms 492 KB Output isn't correct
35 Halted 0 ms 0 KB -