传送门
题目描述
给你一个 n ∗ n n * n n∗n的矩形,拆成若干个 k ∗ k k * k k∗k的小矩形,问你最小的那个中位数是多少
分析
应该比较容易想到二分的思路,关键就是这个check函数怎么去设计
我们把这个矩阵转化成01矩阵,大于等于mid的设为1,小于mid的设为0,然后构造前缀和矩阵,如果一个矩阵内大于等于mid的个数小于要求的数量,则说明不符合要求
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 1e3 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int a[N][N];
int sum[N][N];
int n,k;
bool check(int mid){
for(int i = 1;i <= n;i++)
for(int j = 1;j <= n;j++)
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + (a[i][j] >= mid);
for(int i = k;i <= n;i++)
for(int j = k;j <= n;j++){
if(sum[i][j] - sum[i - k][j] - sum[i][j - k] + sum[i - k][j - k] < (k * k / 2) + 1) return false;
}
return true;
}
int main() {
read(n),read(k);
for(int i = 1;i <= n;i++)
for(int j = 1;j <= n;j++)
read(a[i][j]);
int l = 0,r = INF;
while(l < r){
int mid = (l + r + 1) >> 1;
if(check(mid)) l = mid;
else r = mid - 1;
}
di(l);
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/