Submission #624812

#TimeUsernameProblemLanguageResultExecution timeMemory
624812QwertyPiSandcastle 2 (JOI22_ho_t5)C++14
10 / 100
5038 ms7568 KiB
#include <bits/stdc++.h> #define int long long using namespace std; int a[200013]; int b[200013]; int h, w; int id(int i, int j){ return i * (w + 1) + j; } int id2(int i, int j){ return j * (h + 1) + i; } bool f[200013]; int s[200013]; int dp[50][50][50][50]; int qry(int x1, int x2, int y1, int y2){ return s[id(x2 + 1, y2 + 1)] + s[id(x1, y1)] - s[id(x2 + 1, y1)] - s[id(x1, y2 + 1)]; } int32_t main(){ cin >> h >> w; for(int i = 0; i < h; i++){ for(int j = 0; j < w; j++){ cin >> a[id(i, j)]; } } if(h > w){ for(int i = 0; i < h; i++){ for(int j = 0; j < w; j++){ b[id2(i, j)] = a[id(i, j)]; } } for(int i = 0; i < h; i++){ for(int j = 0; j < w; j++){ a[id2(i, j)] = b[id2(i, j)]; } } swap(w, h); } { set<int> S; map<int, int> M; for(int i = 0; i < h; i++){ for(int j = 0; j < w; j++){ S.insert(a[id(i, j)]); } } int idx = 0; for(auto j : S){ M[j] = idx++; } for(int i = 0; i < h; i++){ for(int j = 0; j < w; j++){ a[id(i, j)] = M[a[id(i, j)]]; } } } int ans = 0; for(int i = 0; i < h; i++){ for(int j = 0; j < w - 1; j++){ int v1 = a[id(i, j)], v2 = a[id(i, j + 1)]; if(v1 > v2) swap(v1, v2); for(int x = 0; x < h; x++){ for(int y = 0; y < w; y++){ f[id(x, y)] = a[id(x, y)] > v1 && a[id(x, y)] < v2; } } for(int x = 0; x < h; x++){ for(int y = 0; y < w; y++){ s[id(x + 1, y + 1)] = s[id(x + 1, y)] + s[id(x, y + 1)] - s[id(x, y)] + f[id(x, y)]; } } int x1 = i, x2 = i, y1 = j, y2 = j + 1; for(int x3 = 0; x3 <= x1; x3++){ for(int x4 = x2; x4 < h; x4++){ if(qry(x3, x4, y1, y2)) continue; int y3 = INT32_MAX, y4 = INT32_MIN; { int l = 0, r = y1; while(l != r){ int mid = (l + r) / 2; if(qry(x3, x4, mid, y1)){ l = mid + 1; }else{ r = mid; } } y3 = l; } { int l = y2, r = w - 1; while(l != r){ int mid = (l + r + 1) / 2; if(qry(x3, x4, y2, mid)){ r = mid - 1; }else{ l = mid; } } y4 = l; } for(int a = y3; a <= y1; a++){ for(int b = y2; b <= y4; b++){ dp[x3][x4][a][b]++; } } } } } } for(int i = 0; i < h - 1; i++){ for(int j = 0; j < w; j++){ int v1 = a[id(i, j)], v2 = a[id(i + 1, j)]; if(v1 > v2) swap(v1, v2); for(int x = 0; x < h; x++){ for(int y = 0; y < w; y++){ f[id(x, y)] = a[id(x, y)] > v1 && a[id(x, y)] < v2; } } for(int x = 0; x < h; x++){ for(int y = 0; y < w; y++){ s[id(x + 1, y + 1)] = s[id(x + 1, y)] + s[id(x, y + 1)] - s[id(x, y)] + f[id(x, y)]; } } int x1 = i, x2 = i + 1, y1 = j, y2 = j; for(int x3 = 0; x3 <= x1; x3++){ for(int x4 = x2; x4 < h; x4++){ if(qry(x3, x4, y1, y2)) continue; int y3 = INT32_MAX, y4 = INT32_MIN; { int l = 0, r = y1; while(l != r){ int mid = (l + r) / 2; if(qry(x3, x4, mid, y1)){ l = mid + 1; }else{ r = mid; } } y3 = l; } { int l = y2, r = w - 1; while(l != r){ int mid = (l + r + 1) / 2; if(qry(x3, x4, y2, mid)){ r = mid - 1; }else{ l = mid; } } y4 = l; } for(int a = y3; a <= y1; a++){ for(int b = y2; b <= y4; b++){ dp[x3][x4][a][b]++; } } } } } } for(int x1 = 0; x1 < h; x1++){ for(int x2 = x1; x2 < h; x2++){ for(int y1 = 0; y1 < w; y1++){ for(int y2 = y1; y2 < w; y2++){ if(dp[x1][x2][y1][y2] == (x2 - x1 + 1) * (y2 - y1 + 1) - 1) ans++; } } } } cout << ans << endl; }
#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...