Submission #404061

#TimeUsernameProblemLanguageResultExecution timeMemory
404061EveruleRectangles (IOI19_rect)C++14
0 / 100
5057 ms340 KiB
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll count_rectangles(vector<vector<int>> a){
    int n = a.size();
    int m = a[0].size();
    ll ans = 0;
    auto check = [&](int i1,int i2,int j1,int j2){
        for(int i=i1;i<=i2;i++){
            int mn = min(a[i][j1-1], a[i][j2+1]);
            for(int j=j1;j<=j2;j++){
                if(a[i][j] > mn) return 0;
            }
        }
        for(int j=j1;j<=j2;j++){
            int mn = min(a[i1-1][j], a[i2+1][j]);
            for(int i=i1;i<=i2;i++){
                if(a[i][j] > mn) return 0;
            }
        }
        return 1;
    };
    for(int i1=1;i1<n-1;i1++){
        for(int i2=i1;i2<n-1;i2++){
            for(int j1=1;j1<m-1;j1++){
                for(int j2=j1;j2<m-1;j2++){
                    ans += check(i1,i2,j1,j2);
                }
            }
        }
    }
    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...