oj.uz

Submission #934854

# Submission time Handle Problem Language Result Execution time Memory
934854 2024-02-28T05:38:51 Z vjudge1 Quality Of Living (IOI10_quality) C++17
100 / 100
 1141 ms 140432 KB 
#include <bits/stdc++.h>
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fi first
#define se second
#define pb push_back
//#define task "hetcuu"
using namespace std;
using ll = long long;
using ld = long double;
const int maxN = 3e3 + 1;
int rectangle(int n ,int m,int h,int w,int a[maxN][maxN]){
    faster
    //freopen(task".inp","r",stdin);
    //freopen(task".out","w",stdout);
    //input(r,c,h,w);
    int pre[maxN][maxN];
    //cin >> n >> m >> h >> w;
    //for(int i = 1; i <= n;++i){
    //    for(int j = 1;j <= m;++j){
    //        cin >> a[i][j];
    //    }
    //}
    int l=(h*w+1)/2, r=n*m, ans=0;
    while(l <= r) {
        int mid = (l + r) / 2;
        bool ok = 0;

        for(int i=1; i<=n; i++)
            for(int j=1; j<=m; j++)
                pre[i][j] = (a[i - 1][j - 1] <= mid) + pre[i-1][j] + pre[i][j-1] - pre[i-1][j-1];

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

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

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 37724 KB Output is correct
2 Correct 18 ms 37724 KB Output is correct
3 Correct 18 ms 37724 KB Output is correct
4 Correct 20 ms 37800 KB Output is correct
5 Correct 20 ms 37724 KB Output is correct
6 Correct 20 ms 37664 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 37724 KB Output is correct
2 Correct 18 ms 37724 KB Output is correct
3 Correct 18 ms 37724 KB Output is correct
4 Correct 20 ms 37800 KB Output is correct
5 Correct 20 ms 37724 KB Output is correct
6 Correct 20 ms 37664 KB Output is correct
7 Correct 29 ms 40284 KB Output is correct
8 Correct 28 ms 40284 KB Output is correct
9 Correct 28 ms 40280 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 37724 KB Output is correct
2 Correct 18 ms 37724 KB Output is correct
3 Correct 18 ms 37724 KB Output is correct
4 Correct 20 ms 37800 KB Output is correct
5 Correct 20 ms 37724 KB Output is correct
6 Correct 20 ms 37664 KB Output is correct
7 Correct 29 ms 40284 KB Output is correct
8 Correct 28 ms 40284 KB Output is correct
9 Correct 28 ms 40280 KB Output is correct
10 Correct 148 ms 54820 KB Output is correct
11 Correct 133 ms 54860 KB Output is correct
12 Correct 77 ms 51208 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 37724 KB Output is correct
2 Correct 18 ms 37724 KB Output is correct
3 Correct 18 ms 37724 KB Output is correct
4 Correct 20 ms 37800 KB Output is correct
5 Correct 20 ms 37724 KB Output is correct
6 Correct 20 ms 37664 KB Output is correct
7 Correct 29 ms 40284 KB Output is correct
8 Correct 28 ms 40284 KB Output is correct
9 Correct 28 ms 40280 KB Output is correct
10 Correct 148 ms 54820 KB Output is correct
11 Correct 133 ms 54860 KB Output is correct
12 Correct 77 ms 51208 KB Output is correct
13 Correct 1141 ms 140316 KB Output is correct
14 Correct 1110 ms 140432 KB Output is correct
15 Correct 1061 ms 133300 KB Output is correct