Submission #1017980

#	Time	Username	Problem	Language	Result	Execution time	Memory
1017980		c2zi6	Rectangles (IOI19_rect)	C++14	37 / 100	5087 ms	521920 KiB

rect

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "rect.h"

int lg[3001];
struct SPARSETABLE {
    VVI table;
    SPARSETABLE(){};
    SPARSETABLE(VI a) {
        int n = a.size();
        table = VVI(n, VI(14));
        reprl(i, n-1, 0) {
            table[i][0] = a[i];
            for (int j = 1; i+(1<<(j-1)) < n; j++) {
                table[i][j] = max(table[i][j-1], table[i + (1<<(j-1))][j-1]);
            }
        }
    }
    int get(int l, int r) {
        int s = lg[r - l + 1];
        return max(table[l][s], table[r-(1<<s)+1][s]);
    }
};

ll count_rectangles(VVI a) {
    lg[1] = 0; replr(i, 2, 3000) lg[i] = lg[i/2]+1;
    int n = a.size();
    int m = a[0].size();
    vector<SPARSETABLE> rows(n);
    vector<SPARSETABLE> cols(m);
    rep(i, n) {
        rows[i] = SPARSETABLE(a[i]);
    }
    rep(j, m) {
        VI b;
        rep(i, n) b.pb(a[i][j]);
        cols[j] = SPARSETABLE(b);
    }
    ll ans = 0;
    replr(r1, 1, n-2) replr(r2, r1, n-2) {
        replr(c1, 1, m-2) replr(c2, c1, m-2) {
            bool good = true;
            replr(i, r1, r2) {
                if (rows[i].get(c1, c2) >= min(a[i][c1-1], a[i][c2+1])) {
                    good = false;
                    break;
                }
            }
            if (!good) continue;
            replr(j, c1, c2) {
                if (cols[j].get(r1, r2) >= min(a[r1-1][j], a[r2+1][j])) {
                    good = false;
                    break;
                }
            }
            if (!good) continue;
            /*cout << r1 << " " << r2 << " " << c1 << " " << c2 << endl;*/
            ans++;
        }
    }
	return ans;
}

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