oj.uz

Submission #481671

# Submission time Handle Problem Language Result Execution time Memory
481671 2021-10-21T10:12:10 Z SlavicG Quality Of Living (IOI10_quality) C++17
0 / 100
 0 ms 588 KB 
#include"quality.h"
#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()
 
const int N = 3001;
int p1[N][N];
int p2[N][N];
int smaller(int x1, int y1, int x2, int y2){
    return p1[x2][y2] - p1[x1][y2 - 1] - p1[x2 - 1][y1] + p1[x1 - 1][y1 - 1];
}

int fuck(int x1, int y1, int x2, int y2){
    return p2[x2][y2] - p2[x1][y2 - 1] - p2[x2 - 1][y1] + p2[x1 - 1][y1 - 1];
}
int rectangle(int n, int m, int a, int b, int c[3001][3001]){
    int ans = INT_MAX;

    int l = 1,r = n * m;
    while(l <= r)
    {
        int mid = (l + r) / 2;

        for(int i = 0;i < n;++i){
            for(int j = 0;j < m;++j){
                if(c[i][j] < mid)p1[i + 1][j + 1] = 1;
                if(c[i][j] > mid)p2[i + 1][j + 1] = 1;
            }
        }

        for(int i = 1;i <= n;++i){
            for(int j = 1;j <= m;++j){
                p1[i][j] += p1[i - 1][j] + p1[i][j - 1] - p1[i - 1][j - 1];
                p2[i][j] += p2[i - 1][j] + p2[i][j - 1] - p2[i - 1][j - 1];
            }
        }

        bool ok = false;
        for(int i = 0;i + a - 1 < n;++i){
            for(int j = 0;j + b - 1 < m;++j){
                int sm = smaller(i + 1, j + 1, i + a, j + b);
                int gr = fuck(i + 1, j + 1, i + a, j + b);

                if(sm == gr){
                    ans = min(ans, mid);
                    ok = true;
                }else if(sm > gr)ok = true;
            }
        }

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

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 588 KB Output isn't correct
2 Halted 0 ms 0 KB -