Submission #925505

# Submission time Handle Problem Language Result Execution time Memory
925505 2024-02-11T20:34:51 Z VMaksimoski008 Quality Of Living (IOI10_quality) C++14
100 / 100
1237 ms 71148 KB
#include <iostream>
#include "quality.h"
using namespace std;

int rectangle(int n, int m, int h, int w, int q[3001][3001]) {
    int l=0, r=1e9, ans=0, pref[3001][3001];

    while(l <= r) {
        int M = (l + r) / 2;
        bool ok = 0;

        for(int i=1; i<=n; i++)
            for(int j=1; j<=m; j++)
                pref[i][j] = (q[i-1][j-1] <= M) + pref[i-1][j] + pref[i][j-1] - pref[i-1][j-1];
                
        for(int i=1; i+h-1<=n; i++)
            for(int j=1; j+w-1<=m; j++)
                if(2 * (pref[i+h-1][j+w-1] - pref[i-1][j+w-1] - pref[i+h-1][j-1] + pref[i-1][j-1]) >= h * w) ok = 1;

        if(ok) ans = M, r = M - 1;
        else l = M + 1;
    }

    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 17 ms 37724 KB Output is correct
2 Correct 16 ms 37720 KB Output is correct
3 Correct 17 ms 37724 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 17 ms 37724 KB Output is correct
2 Correct 16 ms 37720 KB Output is correct
3 Correct 17 ms 37724 KB Output is correct
4 Correct 18 ms 37724 KB Output is correct
5 Correct 20 ms 37724 KB Output is correct
6 Correct 18 ms 37724 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 17 ms 37724 KB Output is correct
2 Correct 16 ms 37720 KB Output is correct
3 Correct 17 ms 37724 KB Output is correct
4 Correct 18 ms 37724 KB Output is correct
5 Correct 20 ms 37724 KB Output is correct
6 Correct 18 ms 37724 KB Output is correct
7 Correct 29 ms 39772 KB Output is correct
8 Correct 28 ms 39772 KB Output is correct
9 Correct 30 ms 39764 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 17 ms 37724 KB Output is correct
2 Correct 16 ms 37720 KB Output is correct
3 Correct 17 ms 37724 KB Output is correct
4 Correct 18 ms 37724 KB Output is correct
5 Correct 20 ms 37724 KB Output is correct
6 Correct 18 ms 37724 KB Output is correct
7 Correct 29 ms 39772 KB Output is correct
8 Correct 28 ms 39772 KB Output is correct
9 Correct 30 ms 39764 KB Output is correct
10 Correct 153 ms 47908 KB Output is correct
11 Correct 145 ms 47956 KB Output is correct
12 Correct 88 ms 47928 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 17 ms 37724 KB Output is correct
2 Correct 16 ms 37720 KB Output is correct
3 Correct 17 ms 37724 KB Output is correct
4 Correct 18 ms 37724 KB Output is correct
5 Correct 20 ms 37724 KB Output is correct
6 Correct 18 ms 37724 KB Output is correct
7 Correct 29 ms 39772 KB Output is correct
8 Correct 28 ms 39772 KB Output is correct
9 Correct 30 ms 39764 KB Output is correct
10 Correct 153 ms 47908 KB Output is correct
11 Correct 145 ms 47956 KB Output is correct
12 Correct 88 ms 47928 KB Output is correct
13 Correct 1237 ms 71148 KB Output is correct
14 Correct 1167 ms 70768 KB Output is correct
15 Correct 1168 ms 70780 KB Output is correct