제출 #398020

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
398020		snasibov05	Rectangles (IOI19_rect)	C++14	37 / 100	2588 ms	1048580 KiB

rect

#include "rect.h"

using namespace std;


long long count_rectangles(std::vector<std::vector<int> > a) {
	short n = a.size();
	short m = a[0].size();

	vector<vector<vector<int>>> rmx(n, vector<vector<int>>(m, vector<int>(m)));

    for (short i = 1; i < n - 1; ++i) {
        for (short c1 = 1; c1 < m-1; ++c1) {
            rmx[i][c1][c1] = a[i][c1];
            for (short c2 = c1+1; c2 < m-1; ++c2) {
                rmx[i][c1][c2] = max(rmx[i][c1][c2-1], a[i][c2]);
            }
        }
    }

    vector<vector<vector<int>>> cmx(m, vector<vector<int>>(n, vector<int>(n)));

    for (short i = 1; i < m - 1; ++i) {
        for (short r1 = 1; r1 < n-1; ++r1) {
            cmx[i][r1][r1] = a[r1][i];
            for (short r2 = r1+1; r2 < n-1; ++r2) {
                cmx[i][r1][r2] = max(cmx[i][r1][r2-1], a[r2][i]);
            }
        }
    }

    long long ans = 0;
    for (short r1 = 1; r1 < n-1; ++r1) {
        for (short c1 = 1; c1 < m-1; ++c1) {

            for (short r2 = r1; r2 < n-1; ++r2) {
                
                for (short c2 = c1; c2 < m-1; ++c2) {

                    bool flag = true;
                    for (int i = r1; i <= r2 && flag; ++i) {
                        if (rmx[i][c1][c2] >= a[i][c1-1]) flag = false;
                        if (rmx[i][c1][c2] >= a[i][c2+1]) flag = false;
                    }

                    for (int i = c1; i <= c2 && flag; ++i) {
                        if (cmx[i][r1][r2] >= a[r1-1][i]) flag = false;
                        if (cmx[i][r1][r2] >= a[r2+1][i]) flag = false;
                    }

                    if (flag) 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