제출 #362157

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
362157		vishesh312	Rectangles (IOI19_rect)	C++17	0 / 100	167 ms	123580 KiB

rect

#include "bits/stdc++.h"
using namespace std;

using ll = long long;

ll count_rectangles(vector<vector<int>> a) {
    ll ans = 0;
    int n = a.size();
    int m = a[0].size();
    if (n <= 2 or m <= 2) {
        return 0;
    }
    int mx[n][m][m], mx2[m][n][n];
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            mx[i][j][j] = a[i][j];
            for (int k = j+1; k < m; ++k) {
                mx[i][j][k] = max(mx[i][j][k-1], a[i][k]);
            }
        }
    }
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) {
            mx2[i][j][j] = a[j][i];
            for (int k = j+1; k < n; ++k) {
                mx2[i][j][k] = max(mx2[i][j][k-1], a[k-1][i]);
            }
        }
    }
    for (int i = 1; i < n-1; ++i) {
        for (int j = 1; j < m-1; ++j) {
            pair<int, int> top_right{i, j};
            for (int k = i; k < n-1; ++k) {
                for (int l = j; l < m-1; ++l) {
                    pair<int, int> bottom_left{k, l};
                    /*int mini = 1e9;
                    int maxi = 0;
                    for (int row = top_right.first; row <= bottom_left.first; ++row) {
                        maxi = max(maxi, mx[row][top_right.second][bottom_left.second]);
                    }
                    mini = min(mini, mn[top_right.first-1][top_right.second][bottom_left.second]);
                    mini = min(mini, mn[bottom_left.first+1][top_right.second][bottom_left.second]);
                    mini = min(mini, mn2[top_right.second-1][top_right.first][bottom_left.first]);
                    mini = min(mini, mn2[bottom_left.second+1][top_right.first][bottom_left.first]);
                    if (i == 4 and j == 2 and k == 4 and l == 3) {
                        cerr << "during 4 2 4 3 : \nmini = " << mini << " maxi = " << maxi << '\n';
                    }
                    if (maxi <= mini) {
                        vec.push_back({i, j, k, l, mini, maxi});
                    }*/
                    bool cont = false;
                    for (int row = top_right.first; row <= bottom_left.first; ++row) {
                        int maxi = mx2[row][top_right.second][bottom_left.second];
                        if (maxi > min(a[row][top_right.second-1], a[row][bottom_left.second+1])) {
                            cont = true;
                            break;
                        }
                    }
                    if (cont) continue;
                    for (int col = top_right.second; col <= bottom_left.second; ++col) {
                        int maxi = mx[col][top_right.first][bottom_left.first];
                        if (maxi > min(a[top_right.first-1][col], a[bottom_left.first+1][col])) {
                            cont = true;
                            break;
                        }
                    }
                    if (cont) continue;
                    ans++;
                }
            }
        }
    }
    /*for (auto x : vec) {
        for (auto y : x) cout << y << " " ;
        cout << '\n';
    }*/
    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