oj.uz

Submission #464522

# Submission time Handle Problem Language Result Execution time Memory
464522 2021-08-13T10:52:49 Z kilikuma T-Covering (eJOI19_covering) C++14
5 / 100
 247 ms 8184 KB 
#include <bits/stdc++.h> 
using namespace std;
long long m,n,k,x,y;
int main(){
cin>>n>>m;
long long grille[n+5][m+5];
for(int i=0;i<n;i++)
{
    for(int j=0;j<m;j++)
    {
        cin>>grille[i][j];
    }
}
long long res=0;
cin>>k;
while(k--){
        cin>>x>>y;
res=res+grille[x][y];
long long maxiCur=-1;
if(x-1>=0&&y+1<m&&y-1>=0){
    maxiCur=max(maxiCur,grille[x-1][y]+grille[x][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;
}
res=res+maxiCur;
}
cout<<res<<endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 8 ms 460 KB Output is correct
3 Correct 25 ms 1088 KB Output is correct
4 Correct 75 ms 2636 KB Output is correct
5 Correct 247 ms 8184 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Incorrect 10 ms 536 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Incorrect 8 ms 460 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 8 ms 460 KB Output is correct
3 Correct 25 ms 1088 KB Output is correct
4 Correct 75 ms 2636 KB Output is correct
5 Correct 247 ms 8184 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Incorrect 10 ms 536 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 8 ms 460 KB Output is correct
3 Correct 25 ms 1088 KB Output is correct
4 Correct 75 ms 2636 KB Output is correct
5 Correct 247 ms 8184 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Incorrect 10 ms 536 KB Output isn't correct
8 Halted 0 ms 0 KB -