This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "rect.h"
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
long long count_rectangles(vector<vector<int> > a){
    int m=a[0].size(), n=a[0].size();
    int coun=0;
    if(n<3){
        return 0;
    }
    for(int k=1; k<m-1; k++){
        for(int l=k; l<m-1; l++){
            bool is=true;
            for(int b=k; b<=l; b++){
                if(a[1][b]>=a[1][k-1] || a[1][b]>=a[1][l+1] || a[0][b]>=a[1][b] || a[2][b]>=a[1][b])
                    is=false;
            }
            if(is)
                coun++;
        }
    }
    return coun;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |