oj.uz

Submission #919672

# Submission time Handle Problem Language Result Execution time Memory
919672 2024-02-01T11:28:45 Z boris_mihov Quality Of Living (IOI10_quality) C++17
100 / 100
 1403 ms 176036 KB 
#include "quality.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 3000 + 10;
const int INF  = 1e9;

int n, m;
int r, c;
int a[MAXN][MAXN];
int p[MAXN][MAXN];

bool check(int to)
{
    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = 1 ; j <= m ; ++j)
        {
            p[i][j] = p[i - 1][j] + p[i][j - 1] - p[i - 1][j - 1] + (a[i][j] <= to);
        }
    }

    for (int i = r ; i <= n ; ++i)
    {
        for (int j = c ; j <= m ; ++j)
        {
            int res = p[i][j];
            res -= p[i - r][j];
            res -= p[i][j - c];
            res += p[i - r][j - c];
            if (res > r * c / 2) return true;
        }
    }

    return false;
}

int rectangle(int R, int C, int H, int W, int Q[3001][3001]) 
{
    n = R; m = C; r = H; c = W;
    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = 1 ; j <= m ; ++j)
        {
            a[i][j] = Q[i - 1][j - 1];
        }
    }

	int l = 0, r = n * m + 1, mid;
    while (l < r - 1)
    {
        mid = (l + r) / 2;
        if (!check(mid)) l = mid;
        else r = mid;
    }

    return r;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 3 ms 7000 KB Output is correct
5 Correct 3 ms 7004 KB Output is correct
6 Correct 2 ms 7256 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 3 ms 7000 KB Output is correct
5 Correct 3 ms 7004 KB Output is correct
6 Correct 2 ms 7256 KB Output is correct
7 Correct 13 ms 12632 KB Output is correct
8 Correct 13 ms 12632 KB Output is correct
9 Correct 12 ms 12632 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 3 ms 7000 KB Output is correct
5 Correct 3 ms 7004 KB Output is correct
6 Correct 2 ms 7256 KB Output is correct
7 Correct 13 ms 12632 KB Output is correct
8 Correct 13 ms 12632 KB Output is correct
9 Correct 12 ms 12632 KB Output is correct
10 Correct 147 ms 43576 KB Output is correct
11 Correct 143 ms 43344 KB Output is correct
12 Correct 82 ms 37688 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 3 ms 7000 KB Output is correct
5 Correct 3 ms 7004 KB Output is correct
6 Correct 2 ms 7256 KB Output is correct
7 Correct 13 ms 12632 KB Output is correct
8 Correct 13 ms 12632 KB Output is correct
9 Correct 12 ms 12632 KB Output is correct
10 Correct 147 ms 43576 KB Output is correct
11 Correct 143 ms 43344 KB Output is correct
12 Correct 82 ms 37688 KB Output is correct
13 Correct 1403 ms 175976 KB Output is correct
14 Correct 1349 ms 176036 KB Output is correct
15 Correct 1277 ms 168980 KB Output is correct