제출 #256380

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
256380		jdh	T-Covering (eJOI19_covering)	C++17	100 / 100	604 ms	28200 KiB

covering

#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 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 15 / 15
• Subtask 6: 20 / 20
• Subtask 7: 30 / 30