#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define pb push_back
#define F first
#define S second
#define pii pair<int ,int>
#define all(a) a.begin(),a.end()
#define loop(i,s,e) for(int i=s;i<e;i++)
using namespace std;
const int N = (int)1e6 + 6;
int n, m, k, g[N], okt = 0;
vector<int> vc, adj[N];
int hx[] = {-1, 1, 0, 0};
int hy[] = {0, 0, 1, -1};
bool vis[N], ok[N];
bool valid(int i,int j){return (i >= 0 && i < n && j >= 0 && j < m);}
void dfs(int v){
vis[v] = 1;
if(!ok[v])vc.pb(g[v]);
else okt ++;
for(auto u : adj[v])
{
if(vis[u])continue;
dfs(u);
}
}
inline bool in_limits(int i, int j){
return (i>=0 && i<n && j>=0 && j<m);
}
int32_t main(){
// ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
for(int i = 0; i < n; i ++)
for(int j = 0; j < m;j ++){
int v = i*m +j;
cin >> g[v];
ok[v] = vis[v] = 0;
}
cin >> k;
int ans = 0;
for(int i = 0; i < k; i ++){
int r, c;cin >> r >> c;
int v = r*m+c;
// cout << "V : " << v << endl;
ok[v] = 1, ans += g[v];
vector<pii> d = {{-1,0}, {1,0}, {0,1}, {0,-1}};
for(auto it:d) {
int di = it.F, dj = it.S;
int ni = r + di, nj = c + dj;
int u = ni*m+nj;
if (!in_limits(ni, nj)) continue;
adj[v].pb(u);
adj[u].pb(v);
}
}
for(int r = 0; r < n; r ++){
for(int c = 0; c < m; c ++){
int v = r*m + c;
int v = r*m+c;
if(!vis[v] && ok[v]){
okt=0;
vc.clear();
dfs(v);
if(vc.size() < 3*okt){
cout << "No";
return 0;
}
sort(all(vc));
loop(i,1,3*okt+1) ans+=vc[vc.size()-i];
}
}
}
cout << ans << "\n";
return 0;
}
Compilation message
covering.cpp: In function 'int32_t main()':
covering.cpp:62:8: error: redeclaration of 'int64_t v'
62 | int v = r*m+c;
| ^
covering.cpp:61:8: note: 'int64_t v' previously declared here
61 | int v = r*m + c;
| ^
covering.cpp:67:30: warning: comparison of integer expressions of different signedness: 'std::vector<long int>::size_type' {aka 'long unsigned int'} and 'int64_t' {aka 'long int'} [-Wsign-compare]
67 | if(vc.size() < 3*okt){
| ~~~~~~~~~~^~~~~~~
