제출 #256380

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

covering

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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)];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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