oj.uz

Submission #925497

# Submission time Handle Problem Language Result Execution time Memory
925497 2024-02-11T20:12:46 Z VMaksimoski008 Quality Of Living (IOI10_quality) C++14
0 / 100
 1 ms 2392 KB 
#include <bits/stdc++.h>
#include "quality.h"
using namespace std;
using ll = long long;

int pref[3005][3005];

int rectangle(int n, int m, int r, int c, int q[3001][3001]) {
    int lp=0, rp=1e9;
    int ans = 0;

    int mat[n+1][m+1];
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++) mat[i][j] = q[i-1][j-1];

    while(lp <= rp) {
        int mid = (lp + rp) / 2;
        bool ok = 0;

        for(int i=1; i<=n; i++)
            for(int j=1; j<=m; j++)
                pref[i][j] = (mat[i][j] >= mid) + pref[i][j-1] + pref[i-1][j] - pref[i-1][j-1];

        for(int i=1; i+r-1<=n; i++) {
            if(ok) break;
            for(int j=1; j+c-1<=m; j++) {
                if(ok) break;
                ll res = pref[i+r-1][j+c-1] - pref[i-1][j+c-1] - pref[i+r-1][j-1] + pref[i-1][j-1];
                if(2 * res >= r * c) ok = 1;
            }
        }

        if(ok) ans = mid, lp = mid + 1;
        else rp = mid - 1;
    }

    return ans;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Halted 0 ms 0 KB -