Submission #1203224

#	Time	Username	Problem	Language	Result	Execution time	Memory
1203224		SpyrosAliv	Rectangles (IOI19_rect)	C++20	0 / 100	0 ms	328 KiB

rect

#include <bits/stdc++.h>
using namespace std;
#define ll long long

vector<pair<int, int>> delta = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

vector<vector<int>> g;
int n, m;
vector<vector<bool>> vis;
int u, d, l, r, sz;

bool inside(int i, int j) {
    return i >= 0 && i < n && j >= 0 && j < m;
}

void dfs(int i, int j) {
    if (!inside(i, j) || g[i][j] || vis[i][j]) return;
    vis[i][j] = true;
    sz++;
    u = min(u, i);
    d = max(d, i);
    l = min(l, j);
    r = max(r, j);
    for (auto [di, dj]: delta) {
        dfs(i + di, j + dj);
    }
}

ll count_rectangles(vector<vector<int>> G) {
    g = G;
    n = g.size();
    m = g[0].size();
    if (n <= 2 || m <= 2) return 0;
    vector<int> bad(m, 0), good(m, 0);
    for (int i = 1; i < m-1; i++) {
        if (g[1][i] >= g[0][i] || g[1][i] >= g[2][i]) bad[i] = 1;
        if (g[1][i] < g[1][i+1]) good[i] = 1;
        good[i] += good[i-1];
    }
    bad[m-1] = true;
    ll ans = 0;
    ll furth = 0;
    for (int i = 1; i < m-1; i++) {
        if (bad[i] || g[1][i-1] <= g[1][i]) continue;
        while (furth < i) furth++;
        while (!bad[furth]) furth++;
        furth--;
        ans += good[furth] - good[i-1];
    }
    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