#include <iostream>
#include <string>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb push_back
#define mpr make_pair
#define lb lower_bound
#define ld long double
#define ub upper_bound
const int N = 1000005;
vector<int> a[N];
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int x;
cin >> x;
a[i].push_back(x);
}
}
int k;
cin >> k;
bool flag = true;
ll ans = 0;
while (k--) {
int x, y;
cin >> x >> y;
vector<pair<int, int> > v;
for (int i = -1; i <= 1; i += 2) {
if (x + i < n && x + i >= 0) {
v.push_back(mpr(x + i, y));
}
if (y + i < n && y + i >= 0) {
v.push_back(mpr(x, y + i));
}
}
if (v.size() < 3) {
flag = false;
}
else {
int mn = 1005, sum = a[x][y];
for (auto i : v) {
mn = min(mn, a[i.first][i.second]);
sum += a[i.first][i.second];
}
ans = ans + sum - mn;
}
}
if (!flag) {
cout << "NO" << endl;
}
else {
cout << ans << endl;
}
}
int main() {
/*cout.setf(ios::fixed | ios::showpoint);
cout.precision(6);*/
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
23756 KB |
Output is correct |
2 |
Incorrect |
16 ms |
24060 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
23796 KB |
Output is correct |
2 |
Incorrect |
15 ms |
24068 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
14 ms |
23848 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
14 ms |
23696 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
13 ms |
23716 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
23756 KB |
Output is correct |
2 |
Incorrect |
16 ms |
24060 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
23756 KB |
Output is correct |
2 |
Incorrect |
16 ms |
24060 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |