Submission #1032313

#TimeUsernameProblemLanguageResultExecution timeMemory
1032313shmaxRectangles (IOI19_rect)C++17
10 / 100
2508 ms28500 KiB
#include "rect.h" #include <bits/stdc++.h> using namespace std; using i32 = int; #define int long long #define len(x) (int)(x.size()) #define inf 1000'000'000'000'000'000LL #define all(x) x.begin(), x.end() #define low_bit(x) (x & (-x)) template<typename T> using vec = vector<T>; long long count_rectangles(std::vector<std::vector<i32>> a) { int n = len(a); int m = len(a[0]); int ans = 0; for (int i = 1; i < n - 1; i++) { for (int j = 1; j < m - 1; j++) { if (a[i][j] >= a[i - 1][j]) continue; for (int k = j; k < m - 1; k++) { if (a[i][k] >= a[i - 1][k]) break; for (int l = i; l < n - 1; l++) { int mx = 0; bool good = true; bool good1 = true; for (int h = j; h <= k; h++) { mx = max(mx, (int) a[l][h]); if (a[l][h] >= min(a[i - 1][h], a[l + 1][h])) { good = false; break; } if (a[l][h] >= a[i - 1][h]) { good1 = false; } } if (!good1) break; if (mx >= min(a[l][j - 1], a[l][k + 1])) { good = false; break; } if (!good) continue; ans++; } } } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...