矩阵（堆）

矩阵

题目大意

给你一个矩阵，要你找在所有满足长宽各自不小于一个值的矩阵中，权值和第 k 小的那个。
满足矩阵中数权值非负。

思路

由于权值非负，那一个矩阵范围扩大之后权值和一定不会变小。
那你可以一开始把所有的最小矩阵放进去一个堆，每次取出最小的那个，然后把往两边扩展得到的矩阵放进去。
然后不难看出会有重复，那你就让堆把所有东西都排个序（权值优先），然后如果有重复一定会在相邻的位置出现，然后你就可以判掉重复的了。

代码

#include<map>
#include<queue>
#include<cstdio>
#include<algorithm>
#define ll long long

using namespace std;

struct node {
	ll X;
	int x, y, xd, yd;
}t[1000001], lst;

bool operator <(node x, node y) {//排序以去重
	if (x.X != y.X) return x.X > y.X;
	if (x.x != y.x) return x.x > y.x;
	if (x.y != y.y) return x.y > y.y;
	if (x.xd != y.xd) return x.xd > y.xd;
	return x.yd > y.yd;
}

int n, m, mina, minb, k, tn, re;
ll a[1001][1001], tot;
priority_queue <node> q;
//map <pair<pair<int, int>, pair<int, int> >, bool> qc;
char c;

int read() {
	re = 0; c = getchar();
	while (c < '0' || c > '9') c = getchar();
	while (c >= '0' && c <= '9') {
		re = (re << 3) + (re << 1) + c - '0';
		c = getchar();
	}
	return re;
}

ll get_sum(int x, int y, int xx, int yy) {
	return a[xx][yy] - a[xx][y - 1] - a[x - 1][yy] + a[x - 1][y - 1];
}

int main() {
//	freopen("read.txt", "r", stdin);
	
	n = read(); m = read(); mina = read(); minb = read(); k = read();
//	scanf("%d %d %d %d %d", &n, &m, &mina, &minb, &k);
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++) {
			a[i][j] = read();
//			scanf("%lld", &a[i][j]);
			a[i][j] += a[i][j - 1] + a[i - 1][j] - a[i - 1][j - 1];
		}
	
	for (int i = mina; i <= n; i++)
		for (int j = minb; j <= m; j++) {
			t[++tn].X = get_sum(i - mina + 1, j - minb + 1, i, j);
			t[tn].x = i - mina + 1; t[tn].y = j - minb + 1;
			t[tn].xd = i; t[tn].yd = j;
			if (tot < k) tot += 1ll * (n - i + 1) * (m - j + 1);
		}
	
	if (tot < k) {
		printf("-1");
		return 0;
	}
	
	for (int i = 1; i <= tn; i++) {
		q.push(t[i]);
	}
	while (k > 1) {
		node now = q.top();
		q.pop();
//		if (qc[make_pair(make_pair(now.x, now.y), make_pair(now.xd, now.yd))]) continue;
//			else qc[make_pair(make_pair(now.x, now.y), make_pair(now.xd, now.yd))] = 1;
		if (now.x == lst.x && now.y == lst.y && now.xd == lst.xd && now.yd == lst.yd && now.X == lst.X) continue;
		if (now.xd + 1 <= n) {//往两边扩展
			q.push((node){get_sum(now.x, now.y, now.xd + 1, now.yd), now.x, now.y, now.xd + 1, now.yd});
		}
		if (now.yd + 1 <= m) {
			q.push((node){get_sum(now.x, now.y, now.xd, now.yd + 1), now.x, now.y, now.xd, now.yd + 1});
		}
		
		lst = now;
		k--;
	}
	
	node now = q.top(); q.pop();
	if (now.x == lst.x && now.y == lst.y && now.xd == lst.xd && now.yd == lst.yd && now.X == lst.X) {
		now = q.top(); q.pop();
	}
	printf("%lld", now.X);
	
	return 0;
}