#include <iostream>
using namespace std;
/*
void kiirmat(int s, int o, int *m)
{
for(int i=0;i<s;i++)
{
for(int j=0;j<o;j++)
cout<<m[i*s+j]<<"\t";
cout<<endl;
}
return;
}
*/
/*
4 5
3 2 8 4
8 5 6 1 3
*/
int main()
{
int n, m;
cin>>n>>m;
int a[n],b[m];
long long int mat[n+2][m+2];
for(int i=0;i<n+2;i++)
for(int j=0;j<m+2;j++)
mat[i][j]=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<m;i++)
{
cin>>b[i];
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
mat[i][j]=a[i-1]*b[j-1];
}
//kiirmat(n+2,m+2,*mat);
/*
for(int i=0;i<n+2;i++)
{
for(int j=0;j<m+2;j++)
cout<<mat[i][j]<<"\t";
cout<<endl;
}
*/
int csucssz=0;
for(int i=1;i<n+1;i++)
for(int j=1;j<m+1;j++)
{
if (mat[i][j]>mat[i-1][j] && mat[i][j]>mat[i+1][j] && mat[i][j]>mat[i][j-1] && mat[i][j]>mat[i][j+1])
csucssz++;
}
cout << csucssz << endl;
return 0;
}
Subtask | Sum | Test | Verdict | Time | Memory | ||
---|---|---|---|---|---|---|---|
subtask1 | 0/0 | ||||||
1 | Accepted | 3ms | 1876 KiB | ||||
2 | Accepted | 3ms | 2120 KiB | ||||
subtask2 | 16/16 | ||||||
3 | Accepted | 34ms | 7912 KiB | ||||
4 | Accepted | 28ms | 7992 KiB | ||||
5 | Accepted | 23ms | 8508 KiB | ||||
6 | Accepted | 34ms | 8472 KiB | ||||
7 | Accepted | 34ms | 8604 KiB | ||||
8 | Accepted | 32ms | 8652 KiB | ||||
subtask3 | 33/33 | ||||||
9 | Accepted | 10ms | 19176 KiB | ||||
10 | Accepted | 12ms | 19188 KiB | ||||
11 | Accepted | 12ms | 17916 KiB | ||||
12 | Accepted | 3ms | 3700 KiB | ||||
13 | Accepted | 3ms | 3780 KiB | ||||
14 | Accepted | 3ms | 3996 KiB | ||||
15 | Accepted | 13ms | 19608 KiB | ||||
subtask4 | 0/51 | ||||||
16 | Runtime error | 208ms | 523076 KiB | ||||
17 | Runtime error | 209ms | 523052 KiB | ||||
18 | Runtime error | 208ms | 523032 KiB | ||||
19 | Accepted | 35ms | 10880 KiB | ||||
20 | Accepted | 35ms | 11052 KiB | ||||
21 | Runtime error | 207ms | 522900 KiB | ||||
22 | Runtime error | 204ms | 522880 KiB | ||||
23 | Runtime error | 203ms | 522868 KiB | ||||
24 | Runtime error | 204ms | 522864 KiB |