forked from mbobesic/algorithms-playground
-
Notifications
You must be signed in to change notification settings - Fork 0
/
lawn-mower.cpp
80 lines (60 loc) · 1.61 KB
/
lawn-mower.cpp
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
77
78
79
80
// link: https://code.google.com/codejam/contest/2270488/dashboard#s=p1
// name: Lawnmower
#include<cstdio>
#include<vector>
using namespace std;
int main(){
FILE * inFile, * outFile;
inFile = fopen ("B-large-practice.in","r");
outFile = fopen ("B-large-practice.out","w");
int T;
fscanf(inFile,"%d",&T);
for(int t=0;t<T;++t){
int n, m;
fscanf(inFile, "%d%d",&n,&m);
vector < vector <int> > lawn;
vector < vector <int> > solution;
vector <int> row;
lawn.insert(lawn.begin(),n, row);
solution.insert(solution.begin(), n, row);
for(int i=0;i<n;++i){
for(int j = 0;j<m;++j){
int height;
fscanf(inFile,"%d",&height);
lawn[i].push_back(height);
solution[i].push_back(100);
}
}
for(int i=0;i<n;++i){
int max = 1;
for(int j = 0;j<m;++j){
if(lawn[i][j] > max) max = lawn[i][j];
}
for(int j = 0;j<m;++j){
solution[i][j] = max;
}
}
for(int j=0;j<m;++j){
int max = 1;
for(int i = 0;i<n;++i){
if(lawn[i][j] > max) max = lawn[i][j];
}
for(int i = 0;i<n;++i){
solution[i][j] = min(solution[i][j], max);
}
}
bool solvable = true;
for(int i=0;i<n;++i){
for(int j = 0;j<m;++j){
if(solution[i][j] != lawn[i][j])
solvable = false;
}
}
if(solvable)
fprintf(outFile,"Case #%d: YES\n", (t+1));
else
fprintf(outFile,"Case #%d: NO\n", (t+1));
}
fclose(inFile);
fclose(outFile);
}