oj.uz

Submission #256380

# Submission time Handle Problem Language Result Execution time Memory
256380 2020-08-02T15:49:56 Z jdh T-Covering (eJOI19_covering) C++17
100 / 100
 604 ms 28200 KB 
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> dirs = {{2,0},{1,-1},{1,0},{1,1},{0,2},{0,1},{0,-1},{0,-2},{-1,-1},{-1,0},{-1,1},{-2,0}};
vector<pair<int,int>> dirs2 = {{1,0},{0,1},{0,-1},{-1,0}};
int main(){
  ios::sync_with_stdio(0);
  cin.tie(0);
  int row,col;
  cin >> row >> col;
  vector<vector<int>> a(row,vector<int>(col));
  for(int i = 0; i < row; ++i){
    for(int j = 0; j < col; ++j) cin >> a[i][j];
  }
  int k,u,v;
  cin >> k;
  map<pair<int,int>,int> mp;
  vector<pair<int,int>> centers;
  for(int i = 0; i < k; ++i){
    cin >> u >> v;
    mp[make_pair(u,v)] = centers.size();
    centers.emplace_back(u,v);
  }
  int nb = centers.size();
  vector<vector<int>> adj(nb);
  for(int i = 0; i < nb; ++i){
    tie(u,v) = centers[i];
    for(auto& dir : dirs){
      int x = u+dir.first,y = v+dir.second;
      if(mp.count(make_pair(x,y))){
        int j = mp[make_pair(x,y)];
        adj[i].push_back(j);
      }
    }
  }
  int ans = 0;
  vector<bool> vu(nb);
  for(int i = 0; i < nb; ++i){
    if(!vu[i]){
      vector<int> cands;
      deque<int> q;
      q.emplace_back(i);
      vu[i] = true;
      while(!q.empty()){
        int node = q.front();
        q.pop_front();
        cands.push_back(node);
        for(int j : adj[node]){
          if(!vu[j]){
            vu[j] = true;
            q.emplace_back(j);
          }
        }
      }
      int tot = cands.size(),around = 0;
      int low = 1e9;
      for(int j : cands){
        tie(u,v) = centers[j];
        ans += a[u][v];
        for(auto dir : dirs2){
          int x = u+dir.first,y = v+dir.second;
          if(0 <= x and x < row and 0 <= y and y < col){
            if(!mp.count(make_pair(x,y))){
              if(a[x][y] >= 0){
                low = min(low,a[x][y]);
                ++around;
                ans += a[x][y];
                a[x][y] = -1;
              }
            }
          }
        }
      }
      if(around < 3*tot){
        cout << "No";
        return 0;
      }
      if(around > 3*tot) ans -= low;
    }
  }
  cout << ans;
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 360 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 8 ms 1152 KB Output is correct
4 Correct 22 ms 2688 KB Output is correct
5 Correct 112 ms 8184 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 12 ms 1152 KB Output is correct
4 Correct 29 ms 2748 KB Output is correct
5 Correct 74 ms 8180 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 10 ms 1128 KB Output is correct
4 Correct 26 ms 2740 KB Output is correct
5 Correct 74 ms 8184 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 9 ms 768 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 16 ms 1280 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 1 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 360 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 8 ms 1152 KB Output is correct
4 Correct 22 ms 2688 KB Output is correct
5 Correct 112 ms 8184 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 12 ms 1152 KB Output is correct
9 Correct 29 ms 2748 KB Output is correct
10 Correct 74 ms 8180 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 10 ms 1128 KB Output is correct
14 Correct 26 ms 2740 KB Output is correct
15 Correct 74 ms 8184 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 9 ms 768 KB Output is correct
19 Correct 3 ms 640 KB Output is correct
20 Correct 16 ms 1280 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 3 ms 640 KB Output is correct
23 Correct 9 ms 1152 KB Output is correct
24 Correct 27 ms 2688 KB Output is correct
25 Correct 73 ms 8184 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 360 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 8 ms 1152 KB Output is correct
4 Correct 22 ms 2688 KB Output is correct
5 Correct 112 ms 8184 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 12 ms 1152 KB Output is correct
9 Correct 29 ms 2748 KB Output is correct
10 Correct 74 ms 8180 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 10 ms 1128 KB Output is correct
14 Correct 26 ms 2740 KB Output is correct
15 Correct 74 ms 8184 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 9 ms 768 KB Output is correct
19 Correct 3 ms 640 KB Output is correct
20 Correct 16 ms 1280 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 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 2 ms 384 KB Output is correct
27 Correct 3 ms 640 KB Output is correct
28 Correct 9 ms 1152 KB Output is correct
29 Correct 27 ms 2688 KB Output is correct
30 Correct 73 ms 8184 KB Output is correct
31 Correct 604 ms 28200 KB Output is correct
32 Correct 100 ms 8824 KB Output is correct
33 Correct 99 ms 10104 KB Output is correct
34 Correct 78 ms 8784 KB Output is correct
35 Correct 267 ms 15216 KB Output is correct