C++14(g++5.4) 解法, 执行用时: 12ms, 内存消耗: 432K, 提交时间: 2020-06-14 16:45:20

#include<iostream>
#include<stdio.h>
using namespace std;

int max1=0,min1=0;
int n,m;
int map[105][105];

int find(int a,int b,int n,int m)
{
	int pow1=0,pow2=0;
	for(int i=0;i<m;i++)
	{
		if(i!=b){
		if(map[a][b]>map[a][i]) pow1++;
		else if(map[a][b]<map[a][i]) pow2++; 	
		}
	}
	for(int j=0;j<n;j++)
	{
		if(j!=a){
		if(map[a][b]>map[j][b]) pow1++;
		else if(map[a][b]<map[j][b]) pow2++;	
		} 
	}
	if(pow1==n+m-2) max1++;
	if(pow2==n+m-2) min1++;
}
int main()
{
	cin>>n>>m;
	
	for(int i=0;i<n;i++)
		for(int j=0;j<m;j++)
		{
			cin>>map[i][j];
		}
		
	for(int i=0;i<n;i++)
		for(int j=0;j<m;j++)
			find(i,j,n,m);
	 
	cout<<max1<<endl;
	cout<<min1<<endl;
	
	return 0;
 } 

C++11(clang++ 3.9) 解法, 执行用时: 13ms, 内存消耗: 500K, 提交时间: 2020-06-14 14:52:34

#include<bits/stdc++.h> 
using namespace std;
int a[101][105];
int main(){
	int n,m,ans1=0,ans2=0;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++)
		cin>>a[i][j];
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			int t1=0,t2=0,t3=0,t4=0;
			for(int k=1;k<=n;k++){
			if(a[i][j]>a[k][j])
			t1++; 
			if(a[i][j]<a[k][j])
			t3++; 
			}
			for(int k=1;k<=m;k++){
			if(a[i][j]>a[i][k])
			t2++; 
			if(a[i][j]<a[i][k])
			t4++; 
			}
			if(t1==n-1&&t2==m-1){
				ans1++;
			}
			if(t3==n-1&&t4==m-1){
				ans2++;
			}
		}		
	}
		
	cout<<ans1<<endl;
	cout<<ans2<<endl;
	return 0;
}

pypy3(pypy3.6.1) 解法, 执行用时: 173ms, 内存消耗: 26316K, 提交时间: 2020-06-14 16:02:31

n, m = map(int, input().split())
a = [[int(j) for j in input().split()] for i in range(n)]
x = 0
y = 0
for i in range(n):
    for j in range(m):
        if all(x < a[i][j] for x in (a[i][0:j] + a[i][j + 1:m])) and all(x  < a[i][j] for x in (b[j] for b in a[0:i])) and all(x  < a[i][j] for x in (b[j] for b in a[i + 1:n])):
            x += 1
        if all(x > a[i][j] for x in (a[i][0:j] + a[i][j + 1:m])) and all(x  > a[i][j] for x in (b[j] for b in a[0:i])) and all(x  > a[i][j] for x in (b[j] for b in a[i + 1:n])):
            y += 1
print(x)
print(y)