oj.uz

Submission #217950

# Submission time Handle Problem Language Result Execution time Memory
217950 2020-03-31T09:57:17 Z Sho10 T-Covering (eJOI19_covering) C++14
5 / 100
 87 ms 12024 KB 
/*
ID: Sho10
LANG: C++
*/
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll m,n,k,x,y;
int32_t main(){
CODE_START;
cin>>n>>m;
ll a[n+5][m+5];
for(ll i=0;i<n;i++)
{
    for(ll j=0;j<m;j++)
    {
        cin>>a[i][j];
    }
}
ll ans=0;
cin>>k;
while(k--){
        cin>>x>>y;
ans=ans+a[x][y];
ll s1=-1;
if(x-1>=0&&y+1<m&&y-1>=0){
    s1=max(s1,a[x-1][y]+a[x][y+1]+a[x][y-1]);
}
if(x-1>=0&&y-1>=0&&x+1<n){
    s1=max(s1,a[x-1][y]+a[x+1][y]+a[x][y-1]);
}
if(x-1>=0&&x+1<n&&y+1<m){
    s1=max(s1,a[x-1][y]+a[x+1][y]+a[x][y+1]);
}
if(y+1<m&&y-1>=0&&x+1<n){
    s1=max(s1,a[x][y+1]+a[x][y-1]+a[x+1][y]);
}
if(s1==-1){
    cout<<"No"<<endl;
    return 0;
}
ans=ans+s1;
}
cout<<ans<<endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 7 ms 640 KB Output is correct
3 Correct 12 ms 1536 KB Output is correct
4 Correct 29 ms 3940 KB Output is correct
5 Correct 87 ms 12024 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

# 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 -

Subtask #4
0 / 10.0

# 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 -

Subtask #5
0 / 15.0

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

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 7 ms 640 KB Output is correct
3 Correct 12 ms 1536 KB Output is correct
4 Correct 29 ms 3940 KB Output is correct
5 Correct 87 ms 12024 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Incorrect 8 ms 768 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 7 ms 640 KB Output is correct
3 Correct 12 ms 1536 KB Output is correct
4 Correct 29 ms 3940 KB Output is correct
5 Correct 87 ms 12024 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Incorrect 8 ms 768 KB Output isn't correct
8 Halted 0 ms 0 KB -