oj.uz

답안 #420218

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
420218 2021-06-08T07:50:09 Z Lam_lai_cuoc_doi 삶의 질 (IOI10_quality) C++17
100 / 100
 1960 ms 140136 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

constexpr bool typetest = 0;
constexpr int N = 4e5 + 2;
//#include "grader.h"
//#include "quality.h"

int b[3001][3001];

int rectangle(int m, int n, int h, int w, int a[3001][3001])
{
    auto Check = [&](int v)
    {
        for (int i = 1; i <= m; ++i)
            for (int j = 1; j <= n; ++j)
                b[i][j] = (a[i - 1][j - 1] >= v) + b[i - 1][j] + b[i][j - 1] - b[i - 1][j - 1];

        for (int i = h; i <= m; ++i)
            for (int j = w; j <= n; ++j)
                if ((b[i][j] - b[i - h][j] - b[i][j - w] + b[i - h][j - w]) < (h * w + 1) / 2)
                    return false;

        return true;
    };

    int l = 1, mid, r = m * n;

    while (l <= r)
    {
        mid = (l + r) / 2;

        if (Check(mid))
            l = mid + 1;
        else
            r = mid - 1;
    }

    return r;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 2 ms 1228 KB Output is correct
5 Correct 4 ms 1100 KB Output is correct
6 Correct 3 ms 1228 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 2 ms 1228 KB Output is correct
5 Correct 4 ms 1100 KB Output is correct
6 Correct 3 ms 1228 KB Output is correct
7 Correct 19 ms 3928 KB Output is correct
8 Correct 18 ms 3904 KB Output is correct
9 Correct 17 ms 3824 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 2 ms 1228 KB Output is correct
5 Correct 4 ms 1100 KB Output is correct
6 Correct 3 ms 1228 KB Output is correct
7 Correct 19 ms 3928 KB Output is correct
8 Correct 18 ms 3904 KB Output is correct
9 Correct 17 ms 3824 KB Output is correct
10 Correct 214 ms 22820 KB Output is correct
11 Correct 204 ms 22868 KB Output is correct
12 Correct 116 ms 15516 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 2 ms 1228 KB Output is correct
5 Correct 4 ms 1100 KB Output is correct
6 Correct 3 ms 1228 KB Output is correct
7 Correct 19 ms 3928 KB Output is correct
8 Correct 18 ms 3904 KB Output is correct
9 Correct 17 ms 3824 KB Output is correct
10 Correct 214 ms 22820 KB Output is correct
11 Correct 204 ms 22868 KB Output is correct
12 Correct 116 ms 15516 KB Output is correct
13 Correct 1960 ms 140136 KB Output is correct
14 Correct 1936 ms 140112 KB Output is correct
15 Correct 1931 ms 133064 KB Output is correct