oj.uz

Submission #925506

# Submission time Handle Problem Language Result Execution time Memory
925506 2024-02-11T20:35:47 Z VMaksimoski008 Quality Of Living (IOI10_quality) C++14
100 / 100
 1086 ms 71108 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=n*m, 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;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 37724 KB Output is correct
2 Correct 16 ms 37724 KB Output is correct
3 Correct 17 ms 37724 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 37724 KB Output is correct
2 Correct 16 ms 37724 KB Output is correct
3 Correct 17 ms 37724 KB Output is correct
4 Correct 18 ms 37724 KB Output is correct
5 Correct 19 ms 37604 KB Output is correct
6 Correct 17 ms 37724 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 37724 KB Output is correct
2 Correct 16 ms 37724 KB Output is correct
3 Correct 17 ms 37724 KB Output is correct
4 Correct 18 ms 37724 KB Output is correct
5 Correct 19 ms 37604 KB Output is correct
6 Correct 17 ms 37724 KB Output is correct
7 Correct 26 ms 39772 KB Output is correct
8 Correct 25 ms 39788 KB Output is correct
9 Correct 25 ms 39856 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 37724 KB Output is correct
2 Correct 16 ms 37724 KB Output is correct
3 Correct 17 ms 37724 KB Output is correct
4 Correct 18 ms 37724 KB Output is correct
5 Correct 19 ms 37604 KB Output is correct
6 Correct 17 ms 37724 KB Output is correct
7 Correct 26 ms 39772 KB Output is correct
8 Correct 25 ms 39788 KB Output is correct
9 Correct 25 ms 39856 KB Output is correct
10 Correct 126 ms 48096 KB Output is correct
11 Correct 120 ms 47956 KB Output is correct
12 Correct 73 ms 47952 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 37724 KB Output is correct
2 Correct 16 ms 37724 KB Output is correct
3 Correct 17 ms 37724 KB Output is correct
4 Correct 18 ms 37724 KB Output is correct
5 Correct 19 ms 37604 KB Output is correct
6 Correct 17 ms 37724 KB Output is correct
7 Correct 26 ms 39772 KB Output is correct
8 Correct 25 ms 39788 KB Output is correct
9 Correct 25 ms 39856 KB Output is correct
10 Correct 126 ms 48096 KB Output is correct
11 Correct 120 ms 47956 KB Output is correct
12 Correct 73 ms 47952 KB Output is correct
13 Correct 1086 ms 70760 KB Output is correct
14 Correct 1031 ms 70896 KB Output is correct
15 Correct 1008 ms 71108 KB Output is correct