oj.uz

Submission #311613

# Submission time Handle Problem Language Result Execution time Memory
311613 2020-10-10T18:57:51 Z ipaljak Quality Of Living (IOI10_quality) C++14
100 / 100
 2684 ms 140408 KB 
#include "quality.h"

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 3005;

int r, c;
int mat[MAXN][MAXN];

int sum(int r1, int c1, int r2, int c2) {
  return mat[r2][c2] - mat[r1 - 1][c2] - mat[r2][c1 - 1] + mat[r1 - 1][c1 - 1];
}

bool check(int h, int w) {
  for (int i = 1; i <= r; ++i)
    for (int j = 1; j <= c; ++j)
      mat[i][j] += mat[i - 1][j] + mat[i][j - 1] - mat[i - 1][j - 1];

  for (int i = 1; i <= r; ++i) {
    for (int j = 1; j <= c; ++j) {
      if (i + h - 1 > r || j + w - 1 > c) continue;
      if (sum(i, j, i + h - 1, j + w - 1) > h * w / 2) return true;
    }
  }

  return false;
}

int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
  r = R; c = C;
  int lo = 1, hi = R * C;
  while (lo < hi) {
    int mid = (lo + hi) / 2;
    for (int i = 0; i < r; ++i)
      for (int j = 0; j < c; ++j)
        mat[i + 1][j + 1] = Q[i][j] <= mid;
    if (check(H, W)) hi = mid; else lo = mid + 1;
  }

  return lo;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 3 ms 1204 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct
6 Correct 3 ms 1280 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 3 ms 1204 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct
6 Correct 3 ms 1280 KB Output is correct
7 Correct 23 ms 3968 KB Output is correct
8 Correct 23 ms 3968 KB Output is correct
9 Correct 22 ms 3840 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 3 ms 1204 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct
6 Correct 3 ms 1280 KB Output is correct
7 Correct 23 ms 3968 KB Output is correct
8 Correct 23 ms 3968 KB Output is correct
9 Correct 22 ms 3840 KB Output is correct
10 Correct 288 ms 22904 KB Output is correct
11 Correct 285 ms 22904 KB Output is correct
12 Correct 139 ms 15736 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 3 ms 1204 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct
6 Correct 3 ms 1280 KB Output is correct
7 Correct 23 ms 3968 KB Output is correct
8 Correct 23 ms 3968 KB Output is correct
9 Correct 22 ms 3840 KB Output is correct
10 Correct 288 ms 22904 KB Output is correct
11 Correct 285 ms 22904 KB Output is correct
12 Correct 139 ms 15736 KB Output is correct
13 Correct 2684 ms 75100 KB Output is correct
14 Correct 2682 ms 140408 KB Output is correct
15 Correct 2454 ms 133368 KB Output is correct