oj.uz

Submission #331628

# Submission time Handle Problem Language Result Execution time Memory
331628 2020-11-29T09:24:54 Z Aldas25 Quality Of Living (IOI10_quality) C++14
0 / 100
 2 ms 748 KB 
#include "quality.h"

//#pragma GCC optimize ("O3")
//#pragma GCC optimize ("unroll-loops")

#include <bits/stdc++.h>
//#include <ctime>

using namespace std;

#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<piii> viii;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 500100, MAXK = 20;
const ll MOD = 1e9+7;
const ll INF = 1e18;
const ld PI = asin(1) * 2;

int r, c, h, w;
int grid[3100][3100];
int pref[3100][3100];

int sum (int x2, int y2) {
    int x1 = x2-h+1, y11 = y2-w+1;
    return (pref[x2][y2] - pref[x2][y11-1] - pref[x1-1][y2] + pref[x1-1][y11-1]);
}

bool check (int x) {
    FOR(i, 1, r) {
        int tmp = 0;
        FOR(j, 1, c) {
            if (grid[i][j] <= x) tmp++;
            pref[i][j] = pref[i-1][j] + tmp;
        }
    }

    int mn = (h*w+1)/2;
    FOR(i, h, r) FOR(j, w, c) {
        if (sum(i,j) >= mn) return true;
    }
    return false;
}


int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
	r = R, c = C, h = H, w = W;
    FOR(i, 1, r) FOR(j, 1, c) grid[i][j] = Q[i][j];

    int le = 1, ri = r*c;
    while (le < ri) {
        int mid = (le+ri)/2;
        if (check (mid)) ri = mid;
        else le = mid+1;
    }

    return le;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 20.0

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