oj.uz

Submission #285013

# Submission time Handle Problem Language Result Execution time Memory
285013 2020-08-28T08:56:13 Z WLZ T-Covering (eJOI19_covering) C++14
100 / 100
 470 ms 32180 KB 
#include <bits/stdc++.h>
using namespace std;

const int INF = 0x3f3f3f3f;
const vector<int> dx = {0, 0, 1, -1};
const vector<int> dy = {1, -1, 0, 0};

int m, n;
vector< vector<int> > grid, special, g;
vector<int> r, c;
vector<bool> was;
set< pair<int, int> > st;
int sum, mn;

int dfs(int u) {
  was[u] = true;
  int ans = 1;
  sum += grid[r[u]][c[u]];
  for (int t = 0; t < 4; t++) {
    int nr = r[u] + dx[t];
    int nc = c[u] + dy[t];
    if (nr < 0 || nc < 0 || nr >= m || nc >= n) {
      continue;
    }
    if (!st.count({nr, nc}) && special[nr][nc] == -1) {
      st.insert({nr, nc});
      sum += grid[nr][nc];
      mn = min(mn, grid[nr][nc]);
    }
  }
  for (auto& v : g[u]) {
    if (!was[v]) {
      ans += dfs(v);
    }
  }
  return ans;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> m >> n;
  grid.assign(m, vector<int>(n));
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < n; j++) {
      cin >> grid[i][j];
    }
  }
  int k;
  cin >> k;
  special.assign(m, vector<int>(n, -1));
  r.resize(k);
  c.resize(k);
  for (int i = 0; i < k; i++) {
    cin >> r[i] >> c[i];
    special[r[i]][c[i]] = i;
  }
  g.resize(k);
  for (int i = 0; i < k; i++) {
    set<int> st;
    for (int t1 = 0; t1 < 4; t1++) {
      for (int t2 = 0; t2 < 4; t2++) {
        int nr = r[i] + dx[t1] + dx[t2];
        int nc = c[i] + dy[t1] + dy[t2];
        if (nr < 0 || nc < 0 || nr >= m || nc >= n) {
          continue;
        }
        st.insert(special[nr][nc]);
      }
      int nr = r[i] + dx[t1];
      int nc = c[i] + dy[t1];
      if (nr < 0 || nc < 0 || nr >= m || nc >= n) {
        continue;
      }
      st.insert(special[nr][nc]);
    }
    st.erase(i);
    st.erase(-1);
    for (auto& x : st) {
      g[i].push_back(x);
    }
  }
  was.assign(k, false);
  int ans = 0;
  for (int i = 0; i < k; i++) {
    if (!was[i]) {
      sum = 0; mn = INF;
      st.clear();
      int sz = dfs(i);
      if ((int) st.size() < 3 * sz) {
        cout << "No\n";
        return 0;
      } else if ((int) st.size() == 3 * sz) {
        ans += sum;
      } else {
        ans += sum - mn;
      }
    }
  }
  cout << ans << '\n';
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 17 ms 1536 KB Output is correct
4 Correct 25 ms 3832 KB Output is correct
5 Correct 81 ms 9460 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 4 ms 760 KB Output is correct
3 Correct 11 ms 1568 KB Output is correct
4 Correct 33 ms 3872 KB Output is correct
5 Correct 83 ms 12024 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 9 ms 1536 KB Output is correct
4 Correct 32 ms 3832 KB Output is correct
5 Correct 81 ms 12024 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 5 ms 928 KB Output is correct
4 Correct 4 ms 672 KB Output is correct
5 Correct 11 ms 1536 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 17 ms 1536 KB Output is correct
4 Correct 25 ms 3832 KB Output is correct
5 Correct 81 ms 9460 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 760 KB Output is correct
8 Correct 11 ms 1568 KB Output is correct
9 Correct 33 ms 3872 KB Output is correct
10 Correct 83 ms 12024 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 9 ms 1536 KB Output is correct
14 Correct 32 ms 3832 KB Output is correct
15 Correct 81 ms 12024 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 5 ms 928 KB Output is correct
19 Correct 4 ms 672 KB Output is correct
20 Correct 11 ms 1536 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 3 ms 640 KB Output is correct
23 Correct 10 ms 1536 KB Output is correct
24 Correct 26 ms 3960 KB Output is correct
25 Correct 80 ms 12024 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 17 ms 1536 KB Output is correct
4 Correct 25 ms 3832 KB Output is correct
5 Correct 81 ms 9460 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 760 KB Output is correct
8 Correct 11 ms 1568 KB Output is correct
9 Correct 33 ms 3872 KB Output is correct
10 Correct 83 ms 12024 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 9 ms 1536 KB Output is correct
14 Correct 32 ms 3832 KB Output is correct
15 Correct 81 ms 12024 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 5 ms 928 KB Output is correct
19 Correct 4 ms 672 KB Output is correct
20 Correct 11 ms 1536 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 3 ms 640 KB Output is correct
28 Correct 10 ms 1536 KB Output is correct
29 Correct 26 ms 3960 KB Output is correct
30 Correct 80 ms 12024 KB Output is correct
31 Correct 470 ms 32180 KB Output is correct
32 Correct 87 ms 13304 KB Output is correct
33 Correct 106 ms 15864 KB Output is correct
34 Correct 88 ms 13176 KB Output is correct
35 Correct 208 ms 25080 KB Output is correct