제출 #1021471

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1021471		vjudge1	Rectangles (IOI19_rect)	C++17	13 / 100	368 ms	67844 KiB

rect

#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using vi = vector <int>;

const ll MAXN = 2.5E3+16;
bool vis[MAXN][MAXN];

ll count_rectangles (vector <vi> a) {
    ll n = a.size(), m = a[0].size();
    ll ans = 0;
    for (ll i = 1; i < n-1; i++) {
        for (ll j = 1; j < m-1; j++) {
            if (vis[i][j] || a[i][j] == 1) continue;
            ll minI = i, maxI = i;
            ll minJ = j, maxJ = j;
            queue <ll> q;
            ll cou = 0;
            q.push(i);
            q.push(j);
            while (q.size()) {
                ll i = q.front(); q.pop();
                ll j = q.front(); q.pop();
                if (a[i][j] == 1) continue;
                if (vis[i][j]) continue;
                vis[i][j] = true; cou++;
                minI = min(minI, i); maxI = max(maxI, i); minJ = min(minJ, j); maxJ = max(maxJ, j);
                if (i-1 >= 0) { q.push(i-1); q.push(j); }
                if (j-1 >= 0) { q.push(i); q.push(j-1); }
                if (i+1 < n) { q.push(i+1); q.push(j); }
                if (j+1 < m) { q.push(i); q.push(j+1); }
            }
            if (0 < minI && maxI < n-1 && 0 < minJ && maxJ < m-1)
                ans += (cou == (maxI-minI+1)*(maxJ-minJ+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: 13 / 13
• Subtask 7: 0 / 28