# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
464517 | kilikuma | T-Covering (eJOI19_covering) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int maxi=0;
int m, n;
bool dans(int lig, int col) {
if (lig<0||col<0||lig>=m||col>=n) return false;
else return true;
}
int main() {
scanf("%d%d", &m,&n);
int grille[m+5][n+5];
for (int lig=0;lig<m;lig++) {
for (int col=0;col<n;col++) {
cin >> grille[lig][col];
}
}
int k; cin >> k ;
for (int i=0;i<k;i++) {
int x, y; cin >> x >> y;
int maxiCur = -1;
// premier cas
if(x-1>=0&&y+1<m&&y-1>=0){
maxiCur=max(maxiCur,grille[x-1][y]+grillex][y+1]+grille[x][y-1]);
}
if(x-1>=0&&y-1>=0&&x+1<n){
maxiCur=max(maxiCur,grille[x-1][y]+grille[x+1][y]+grille[x][y-1]);
}
if(x-1>=0&&x+1<n&&y+1<m){
maxiCur=max(maxiCur,grille[x-1][y]+grille[x+1][y]+grille[x][y+1]);
}
if(y+1<m&&y-1>=0&&x+1<n){
maxiCur=max(maxiCur,grille[x][y+1]+grille[x][y-1]+grille[x+1][y]);
}
if(maxiCur==-1){
cout<<"No"<<endl;
return 0;
}
// 2
// 3
// 4
maxi += maxiCur;
}
printf("%ld\n", maxi);
}