oj.uz

Submission #925508

# Submission time Handle Problem Language Result Execution time Memory
925508 2024-02-11T20:37:43 Z VMaksimoski008 Quality Of Living (IOI10_quality) C++14
100 / 100
 1093 ms 71504 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=(h*w+1)/2, 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 17 ms 37720 KB Output is correct
2 Correct 17 ms 37720 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 17 ms 37720 KB Output is correct
2 Correct 17 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 17 ms 37752 KB Output is correct
6 Correct 18 ms 37724 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 37720 KB Output is correct
2 Correct 17 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 17 ms 37752 KB Output is correct
6 Correct 18 ms 37724 KB Output is correct
7 Correct 25 ms 39868 KB Output is correct
8 Correct 26 ms 39752 KB Output is correct
9 Correct 25 ms 39760 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 37720 KB Output is correct
2 Correct 17 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 17 ms 37752 KB Output is correct
6 Correct 18 ms 37724 KB Output is correct
7 Correct 25 ms 39868 KB Output is correct
8 Correct 26 ms 39752 KB Output is correct
9 Correct 25 ms 39760 KB Output is correct
10 Correct 134 ms 47916 KB Output is correct
11 Correct 123 ms 48212 KB Output is correct
12 Correct 72 ms 47952 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 37720 KB Output is correct
2 Correct 17 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 17 ms 37752 KB Output is correct
6 Correct 18 ms 37724 KB Output is correct
7 Correct 25 ms 39868 KB Output is correct
8 Correct 26 ms 39752 KB Output is correct
9 Correct 25 ms 39760 KB Output is correct
10 Correct 134 ms 47916 KB Output is correct
11 Correct 123 ms 48212 KB Output is correct
12 Correct 72 ms 47952 KB Output is correct
13 Correct 1093 ms 71504 KB Output is correct
14 Correct 1031 ms 71012 KB Output is correct
15 Correct 980 ms 70884 KB Output is correct