Submission #927317

# Submission time Handle Problem Language Result Execution time Memory
927317 2024-02-14T17:46:14 Z VMaksimoski008 Quality Of Living (IOI10_quality) C++14
100 / 100
1140 ms 140364 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-(h*w)/2, A=0, P[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++)
                P[i][j] = (q[i-1][j-1] <= M) + P[i-1][j] + P[i][j-1] - P[i-1][j-1];
 
        for(int i=1; i+h-1<=n; i++)
            for(int j=1; j+w-1<=m; j++)
                if(2 * (P[i+h-1][j+w-1] - P[i-1][j+w-1] - P[i+h-1][j-1] + P[i-1][j-1]) >= h * w) ok = 1;
 
        if(ok) A = M, r = M - 1;
        else l = M + 1;
    }
 
    return A;
}
# Verdict Execution time Memory Grader output
1 Correct 17 ms 37724 KB Output is correct
2 Correct 16 ms 37724 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 37724 KB Output is correct
3 Correct 17 ms 37724 KB Output is correct
4 Correct 18 ms 37720 KB Output is correct
5 Correct 17 ms 37672 KB Output is correct
6 Correct 20 ms 37716 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 17 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 37720 KB Output is correct
5 Correct 17 ms 37672 KB Output is correct
6 Correct 20 ms 37716 KB Output is correct
7 Correct 26 ms 40240 KB Output is correct
8 Correct 24 ms 40284 KB Output is correct
9 Correct 25 ms 40284 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 17 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 37720 KB Output is correct
5 Correct 17 ms 37672 KB Output is correct
6 Correct 20 ms 37716 KB Output is correct
7 Correct 26 ms 40240 KB Output is correct
8 Correct 24 ms 40284 KB Output is correct
9 Correct 25 ms 40284 KB Output is correct
10 Correct 131 ms 54808 KB Output is correct
11 Correct 149 ms 54612 KB Output is correct
12 Correct 77 ms 51620 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 17 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 37720 KB Output is correct
5 Correct 17 ms 37672 KB Output is correct
6 Correct 20 ms 37716 KB Output is correct
7 Correct 26 ms 40240 KB Output is correct
8 Correct 24 ms 40284 KB Output is correct
9 Correct 25 ms 40284 KB Output is correct
10 Correct 131 ms 54808 KB Output is correct
11 Correct 149 ms 54612 KB Output is correct
12 Correct 77 ms 51620 KB Output is correct
13 Correct 1140 ms 139976 KB Output is correct
14 Correct 1068 ms 140364 KB Output is correct
15 Correct 1086 ms 133060 KB Output is correct