제출 #985249

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
985249		LOLOLO	삶의 질 (IOI10_quality)	C++14	0 / 100	1 ms	2396 KiB

quality

#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 3e3 + 10;
int mat[N][N];
int n, m, x, y;
int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
    n = R, m = C, x = H, y = W;
    int l = 0, r = R * C, ans = 0;

    while (l <= r) {
        int mid = (l + r) / 2;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                if (Q[i - 1][j - 1] <= mid) {
                    mat[i][j] = 1;
                } else {
                    mat[i][j] = -1;
                }

                mat[i][j] += (mat[i - 1][j] + mat[i][j - 1] - mat[i - 1][j - 1]);
                if (i >= x && j >= y) {
                    int cnt = mat[i][j] - mat[i - x][j] - mat[i][j - y] + mat[i - x][j - y];
                    if (cnt <= 0) {
                        ans = mid;
                        l = mid + 1;
                    } else {
                        r = mid - 1;
                    }
                }
            }
        }
    }

    return ans;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20