求助！孩子调了5个hour了，二分的5个点过了，主席树的5个点一个没过。

#include<iostream>
#define x first 
#define y second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
int read() {
	int x = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch>'9') {
		if (ch == '-')
			f = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		x = x * 10 + ch - '0';
		ch = getchar();
	}
	return x * f;
}
const int INF = 0x3f3f3f3f, N = 210, M = 5e5 + 10, K = 1010;
const double eps = 1e-6;
int n, m, q;
int sum[N][N][K], num[N][N][K], w[N][N];
int getnum(int a, int b, int c, int d, int k) {
	return num[c][d][k] - num[c][b - 1][k] - num[a - 1][d][k] + num[a - 1][b - 1][k];
}
int getsum(int a, int b, int c, int d, int k) {
	return sum[c][d][k] - sum[c][b - 1][k] - sum[a - 1][d][k] + sum[a - 1][b - 1][k];
}
bool check(int mid, int a, int b, int c, int d, int tar) {
	if (getsum(a, b, c, d, mid) >= tar) return true;
	return false;
}
void work() {
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			w[i][j] = read();
	for (int k = 0; k <= 1000; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= m; j++)
				num[i][j][k] = num[i - 1][j][k] + num[i][j - 1][k] - num[i - 1][j - 1][k] + (w[i][j] >= k),
				sum[i][j][k] = sum[i - 1][j][k] + sum[i][j - 1][k] - sum[i - 1][j - 1][k] + (w[i][j] >= k) * w[i][j];
	while (q--) {
		int x1 = read(), y1 = read(), x2 = read(), y2 = read(), tar = read();
		int l = 0, r = 1000;
		while (l < r) {
			int mid = l + r + 1 >> 1;
			if (check(mid, x1, y1, x2, y2, tar)) l = mid;
			else r = mid - 1;
		}
		if (check(l, x1, y1, x2, y2, tar)) printf("%d\n", getnum(x1, y1, x2, y2, l) - (getsum(x1, y1, x2, y2, l) - tar) / l);
		else puts("Poor QLW");
	}
}
int root[M], idx;//solve函数 
struct node {
	int l, r, val, cnt;
}tr[23 * M];
int build(int l, int r) {
	int q = ++idx;
	if (l == r) return q;
	int mid = l + r >> 1;
	tr[q].l = build(l, mid);
	tr[q].r = build(mid + 1, r);
	return q;
}
int update(int p, int l, int r, int pos) {
	int q = ++idx;
	tr[q] = tr[p];
	if (l == r) {
		tr[q].val += pos;
		tr[q].cnt++;
		return q;
	}
	int mid = l + r >> 1;
	if (pos <= mid) tr[q].l = update(tr[p].l, l, mid, pos);
	else tr[q].r = update(tr[p].r, mid + 1, r, pos);
	tr[q].val = tr[tr[q].l].val + tr[tr[q].r].val;
	tr[q].cnt = tr[tr[q].l].cnt + tr[tr[q].r].cnt;
	return q;
}
int query(int p, int q, int l, int r, int tar) {
	if (l == r) {
		if (tr[q].val - tr[p].val >= tar) return (tar + l - 1) / l;
		else return INF;
	}
	int tmp = tr[tr[q].r].val - tr[tr[p].r].val;
	int mid = l + r >> 1;
	if (tmp >= tar) return query(tr[p].r, tr[q].r, mid + 1, r, tar);
	else return tr[tr[q].r].cnt - tr[tr[p].r].cnt + query(tr[p].l, tr[q].l, l, mid, tar - tmp);
}
void solve() {
	root[0] = build(1, 1000);
	for (int i = 1; i <= m; i++)
		w[1][i] = read();
	for (int i = 1; i <= m; i++)
		root[i] = update(root[i - 1], 1, 1000, w[1][i]);
	while (q--) {
		int x1 = read(), y1 = read(), x2 = read(), y2 = read(), tar = read();
		if (tr[root[y2]].val - tr[root[y1 - 1]].val < tar)
			puts("Poor QLW");
		else printf("%d\n", query(root[y1 - 1], root[y2], 1, 1000, tar));
	}
}
int main() {
	n = read(), m = read(), q = read();
	if (n == 1) solve();
	else work();
	return 0;
}