Submission #1088880

#TimeUsernameProblemLanguageResultExecution timeMemory
1088880VMaksimoski008Rectangles (IOI19_rect)C++17
37 / 100
5050 ms28300 KiB
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll count_rectangles(vector<vector<int> > mat) {
    int n = mat.size(), m = mat[0].size();
    if(n < 3 || m < 3) return 0;

    if(n == 3) {
        ll ans = 0;

        for(int i=1; i+1<m; i++) {
            int mx = 0;
            for(int j=i; j+1<m; j++) {
                if(mat[0][j] <= mat[1][j] || mat[2][j] <= mat[1][j]) break;
                mx = max(mx, mat[1][j]);
                if(min(mat[1][i-1], mat[1][j+1]) > mx) ans++;
            }
        }

        return ans;
    }

    ll ans = 0;
    for(int i=1; i+1<n; i++) {
        for(int j=1; j+1<m; j++) {
            for(int k=i; k+1<n; k++) {
                for(int l=j; l+1<m; l++) {
                    bool ok = 1;
                    for(int x=i; x<=k&&ok; x++) {
                        for(int y=j; y<=l&&ok; y++) {
                            if(mat[i-1][y] <= mat[x][y]) ok = 0;
                            if(mat[k+1][y] <= mat[x][y]) ok = 0;
                            if(mat[x][j-1] <= mat[x][y]) ok = 0;
                            if(mat[x][l+1] <= mat[x][y]) ok = 0;
                        }
                    }
                    ans += ok;
                }
            }
        }
    }

	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...