FilesExpand file tree

 master

/

B.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

77 lines (68 loc) · 1.37 KB

 master

/

B.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

77 lines (68 loc) · 1.37 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

#include <iostream>

using namespace std;

int T, M, N;

const int MAXN = 150;

int mydata[MAXN][MAXN];

bool checkRow(int i, int j){

bool left = true, right = true;

for(int k=0; k<j; k++){

if(mydata[i][k]>mydata[i][j]){

left = false;

}

}

for(int k=M-1; k>j; k--){

if(mydata[i][k]>mydata[i][j]){

right = false;

}

}

if(left && right){

return true;

}

return false;

}

bool checkCol(int i, int j){

bool up = true, down = true;

for(int k=0; k<i; k++){

if(mydata[k][j]>mydata[i][j]){

up = false;

}

}

for(int k=N-1; k>i; k--){

if(mydata[k][j]>mydata[i][j]){

down = false;

}

}

if(up&& down){

return true;

}

return false;

}

void work(){

bool ok = true;

for(int i=0; i<N; i++){

for(int j=0; j<M; j++){

if( checkRow(i,j)==false && checkCol(i,j)==false){

ok = false;

}

}

}

if(ok){

cout<<"Case #"<<T<<": YES"<<endl;

}else{

cout<<"Case #"<<T<<": NO"<<endl;

}

}

int main(){

int n_case;

cin>>n_case;

for(T=1; T<=n_case; T++){

cin>>N>>M;

for(int i=0; i<N; i++){

for(int j=0; j<M; j++){

cin>>mydata[i][j];

}

}

work();

}

return 0;

}