百度之星 2022初赛第一场 problem D【二维前缀和】【二维差分】【二维RMQ】

willem248

已于 2022-08-28 08:31:56 修改

阅读量220

点赞数

分类专栏：百度之星文章标签：算法 c++ 图论

于 2022-08-28 08:29:51 首次发布

转载请注明出处，谢谢。

本文链接：https://blog.csdn.net/lxylluvio/article/details/126565935

版权

百度之星专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#include <bits/stdc++.h>

using namespace std;

int f[510][510][10][10];
int a[510][510], b[510][510], c[510][510], tt[510][510];

int rmq(int x1, int y1, int x2, int y2) {
  int kx = 0, ky = 0;
  while ((1 << (1 + kx)) <= x2 - x1 + 1)
    kx ++;
  while ((1 << (1 + ky)) <= y2 - y1 + 1)
    ky ++;
  int m1 = f[x1][y1][kx][ky];
  int m2 = f[x2 - (1 << kx) + 1][y1][kx][ky];
  int m3 = f[x1][y2 - (1 << ky) + 1][kx][ky];
  int m4 = f[x2 - (1 << kx) + 1][y2 - (1 << ky) + 1][kx][ky];
  int m5 = max(max(m1, m2), max(m3, m4));
  return m5;
}

signed main() {
  int n, m, k, q;
  cin >> n >> m >> k >> q;
  set <pair <int, int> > se;
  while (q --) {
    int x, y, t;
    scanf ("%d%d", &x, &y);
    if (se.count(make_pair(x, y)) == 1)
      continue ;
    se.insert(make_pair(x, y));
    scanf ("%d", &t);
    tt[x][y] = t;
    a[x][y] ++;
    a[x + 1][y] --;
    a[x][y + 1] --;
    a[x + 1][y + 1] ++;
  }
  for (int i = 1; i <= n; i ++)
    for (int j = 1; j <= m; j ++)
      b[i][j] = b[i - 1][j] + b[i][j - 1] - b[i - 1][j - 1] + a[i][j];
  for (int i = 1; i <= n; i ++)
    for (int j = 1; j <= m; j ++)
      c[i][j] = c[i - 1][j] + c[i][j - 1] - c[i - 1][j - 1] + b[i][j];
  for (int i = 1; i <= n; i ++)
    for (int j = 1; j <= m; j ++)
      f[i][j][0][0] = tt[i][j];
  for (int i = 0; (1 << i) <= n; i ++)
    for (int j = 0; (1 << j) <= m; j ++)
      if (i || j)
        for (int row = 1; row + (1 << i) - 1 <= n; row ++)
          for (int col = 1; col + (1 << j) - 1 <= m; col ++)
            if (!j)
              f[row][col][i][j] = max(f[row][col][i - 1][j], f[row + (1 << (i - 1))][col][i - 1][j]);
            else
              f[row][col][i][j] = max(f[row][col][i][j - 1], f[row][col + (1 << (j - 1))][i][j - 1]);
  int ans = 0x3f3f3f3f;
  for (int i = 1; i <= n - k + 1; i ++)
    for (int j = 1; j <= m - k + 1; j ++)
      if (c[i + k - 1][j + k - 1] - c[i - 1][j + k - 1] - c[i + k - 1][j - 1] + c[i - 1][j - 1] == k * k) {
        int mx = rmq(i, j, i + k - 1, j + k - 1);
        ans = min(ans, mx);
      }
  if (ans == 0x3f3f3f3f)
    ans = -1;
  cout << ans << '\n';
  return 0;
}