Submission #724383

#	Time	Username	Problem	Language	Result	Execution time	Memory
724383		PixelCat	Rectangles (IOI19_rect)	C++14	0 / 100	6 ms	468 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 v[MAXN];
int fail[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 <= 3);
    For(j, 0, m - 1) {
        v[j] = a[1][j];
    }
    For(i, 0, m - 1) {
        if(a[1][i] >= a[0][i] || a[1][i] >= a[2][i]) {
            fail[i] = 1;
        }
    }
    int ans = 0;
    For(l, 1, m - 2) {
        int mn = v[l];
        For(r, l, m - 2) {
            if(fail[r]) break;
            mn = min(mn, v[r]);
            if(mn < min(v[l - 1], v[r + 1])) ans++;
        }
    }
    return ans;
}

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