Submission #397991

#TimeUsernameProblemLanguageResultExecution timeMemory
397991snasibov05Rectangles (IOI19_rect)C++14
10 / 100
5041 ms22676 KiB
#include "rect.h"

using namespace std;

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

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

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

            bool possible = true;

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

                    bool flag = true;

                    for (int i = r1; i <= r2 && flag; ++i) {
                        rmx[i] = max(rmx[i], a[i][c2]);

                        if (rmx[i] >= a[i][c1-1]) possible = false, flag = false;
                        if (rmx[i] >= a[i][c2+1]) flag = false;

                    }

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

                    if (flag) ans++;

                }
            }
        }
    }

    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...