제출 #280565

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
280565		peti1234	Rectangles (IOI19_rect)	C++17	23 / 100	545 ms	499104 KiB

rect

#include <bits/stdc++.h>

using namespace std;
const int c=2502;
bool v[c][c], t[c][c];
int n, m, ans, ks, ko, ns, no, db;
void dfs(int a, int b) {
    v[a][b]=true, db++;
    ks=min(ks, a), ko=min(ko, b), ns=max(ns, a), no=max(no, b);
    if (a>0 && !v[a-1][b] && !t[a-1][b]) dfs(a-1, b);
    if (b>0 && !v[a][b-1] && !t[a][b-1]) dfs(a, b-1);
    if (a+1<n && !v[a+1][b] && !t[a+1][b]) dfs(a+1, b);
    if (b+1<m && !v[a][b+1] && !t[a][b+1]) dfs(a, b+1);
}
long long count_rectangles(vector<vector<int>> sz) {
    n=sz.size(), m=sz[0].size();
    if (n<=3) {
        if (n<3) return 0;
        for (int i=0; i<m; i++) {
            int kezd=sz[1][i], maxi=sz[1][i+1];
            for (int j=i+1; j<m-1; j++) {
                int ert=sz[1][j];
                maxi=max(maxi, ert);
                if (maxi>=kezd || ert>=min(sz[0][j], sz[2][j])) break;
                ans+=(maxi<sz[1][j+1]);
            }
        }
        return ans;
    }
    for (int i=0; i<n; i++) for (int j=0; j<m; j++) t[i][j]=sz[i][j];
    for (int i=0; i<n; i++) for (int j=0; j<m; j++) {
        if (!v[i][j] && !sz[i][j]) {
            ns=0, no=0, ks=c, ko=c, db=0;
            dfs(i, j);
            if (ks>0 && ko>0 && ns<n-1 && no<m-1 && (ns-ks+1)*(no-ko+1)==db) ans++;
        }
    }
    return ans;
}




/*
int b1, b2;
vector<vector<int>> b3;
int main()
{
    cin >> b1 >> b2;
    b3.resize(b1);
    for (int i=0; i<b1; i++) for (int j=0; j<b2; j++) {
        int x; cin >> x;
        b3[i].push_back(x);
    }
    cout << count_rectangles(b3);
    return 0;
}
*/

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