Submission #724397

#	Time	Username	Problem	Language	Result	Execution time	Memory
724397		PixelCat	Rectangles (IOI19_rect)	C++14	10 / 100	52 ms	46056 KiB

rect

#include "rect.h"
#ifdef NYAOWO
#include "grader.cpp"
#endif

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define eb emplace_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
// #define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 2510;

int n, m;
int mx[MAXN];
int mn[MAXN];
int fail[MAXN];
int ok[MAXN][MAXN];

long long count_rectangles(std::vector<std::vector<int> > a) {
    n = sz(a);
    m = sz(a[0]);
    if(min(n, m) <= 2) return 0;
    assert(n <= 200);

    int ans = 0;
    For(u, 1, n - 2) {
        For(i, 1, m - 2) For(j, i, m - 2) {
            ok[i][j] = 1;
        }
        For(i, 0, m - 1) {
            mx[i] = a[u][i];
        }
        For(d, u, n - 2) {
            For(i, 0, m - 1) {
                mx[i] = a[d][i];
                fail[i] = mx[i] >= min(a[u - 1][i], a[d + 1][i]);
            }
            For(l, 1, m - 2) {
                bool ac = true;
                int cur = a[d][l];
                For(r, l, m - 2) {
                    if(fail[r]) ac = false;
                    cur = max(cur, a[d][r]);
                    if(cur >= min(a[d][l - 1], a[d][r + 1])) ok[l][r] = 0;
                    if(ok[l][r] && ac) ans++;
                }
            }
        }
    }
    return ans;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 22
• Subtask 5: 10 / 10
• Subtask 6: 0 / 13
• Subtask 7: 0 / 28