Repository navigation
Expand file tree
/
Copy path1504.cpp
More file actions
91 lines (87 loc) · 2.3 KB
/
Copy path1504.cpp
File metadata and controls
91 lines (87 loc) · 2.3 KB
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
81
82
83
84
85
86
87
88
89
90
91
#include "Jutil.h"
using namespace std;
#define KNRM "\x1B[0m"
#define KRED "\x1B[31m"
#define KGRN "\x1B[32m"
struct Data {
int j;
int h;
int total;
};
const int N = 150;
const Data NIL = {-1, 0, 0};
Data st[N];
class Solution {
public:
int numSubmat(vector<vector<int>>& mat) {
int m = mat.size();
int n = mat[0].size();
int res = 0;
int c = 0;
for (int j = 0; j < n; j++) {
if (mat[0][j] == 0) {
c = 0;
} else {
c++;
res += c;
}
}
for (int i = 1; i < m; i++) {
int top = -1;
for (int j = 0; j < n; j++) {
if (mat[i][j] == 1) {
mat[i][j] += mat[i - 1][j];
}
while (top >= 0 && st[top].h > mat[i][j]) {
top--;
}
Data left = NIL;
if (top >= 0) {
left = st[top];
}
int total = (j - left.j) * mat[i][j] + left.total;
res += total;
st[++top] = {j, mat[i][j], total};
}
}
return res;
}
};
int main() {
string problemName = "1504";
auto begin = jtimer();
Solution sol;
ifstream file_in("testcases/" + problemName + "_in.txt");
ifstream file_out("testcases/" + problemName + "_out.txt");
bool allPass = true;
int caseCount = 0;
int passCount = 0;
string line_in;
string line_out;
while (getline(file_in, line_in)) {
auto mat = jread_vector2d(line_in);
auto res = sol.numSubmat(mat);
getline(file_out, line_out);
auto ans = jread_int(line_out);
printf("Case %d", ++caseCount);
if (res == ans) {
passCount++;
printf(" %s(PASS)", KGRN);
} else {
printf(" %s(WRONG)", KRED);
allPass = false;
}
printf("\n%s", KNRM);
jprint(res, "res");
jprint(ans, "ans");
printf("\n");
}
if (allPass) {
printf("%sALL CORRECT [%d/%d]\n%s", KGRN, passCount, caseCount, KNRM);
} else {
printf("%sWRONG ANSWER [%d/%d]\n%s", KRED, passCount, caseCount, KNRM);
}
auto end = jtimer();
jprint_time(begin, end);
return 0;
}