#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
const int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
const ll oo = 2e18;
int n, m;
ll **a;
bool ok(int i, int j) {
return i >= 0 && i < n && j >= 0 && j < m;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
a = new ll*[n];
for (int i = 0; i < n; ++i) {
a[i] = new ll[m];
for (int j = 0; j < m; ++j) cin >> a[i][j];
}
ll ans = 0;
int k;
cin >> k;
while (k--) {
int r, c;
cin >> r >> c;
ll mx = -oo;
for (int i = 0; i < 4; ++i) {
bool OK = 1;
for (int j = 0; j < 4; ++j) {
if (j != i) OK &= ok(r + dx[j], c + dy[j]);
}
if (OK) {
ll q = a[r][c];
for (int j = 0; j < 4; ++j) {
if (j != i) q += a[r + dx[j]][c + dy[j]];
}
mx = max(mx, q);
}
}
ans += mx;
}
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
512 KB |
Output is correct |
2 |
Correct |
7 ms |
640 KB |
Output is correct |
3 |
Correct |
12 ms |
1536 KB |
Output is correct |
4 |
Correct |
26 ms |
3840 KB |
Output is correct |
5 |
Correct |
78 ms |
12024 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
512 KB |
Output is correct |
2 |
Incorrect |
7 ms |
640 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
512 KB |
Output is correct |
2 |
Incorrect |
7 ms |
668 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
512 KB |
Output is correct |
2 |
Correct |
7 ms |
640 KB |
Output is correct |
3 |
Correct |
12 ms |
1536 KB |
Output is correct |
4 |
Correct |
26 ms |
3840 KB |
Output is correct |
5 |
Correct |
78 ms |
12024 KB |
Output is correct |
6 |
Correct |
5 ms |
512 KB |
Output is correct |
7 |
Incorrect |
7 ms |
640 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
512 KB |
Output is correct |
2 |
Correct |
7 ms |
640 KB |
Output is correct |
3 |
Correct |
12 ms |
1536 KB |
Output is correct |
4 |
Correct |
26 ms |
3840 KB |
Output is correct |
5 |
Correct |
78 ms |
12024 KB |
Output is correct |
6 |
Correct |
5 ms |
512 KB |
Output is correct |
7 |
Incorrect |
7 ms |
640 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |