Submission #1065090

#	Time	Username	Problem	Language	Result	Execution time	Memory
1065090		aaaaaarroz	Rectangles (IOI19_rect)	C++17	25 / 100	5076 ms	765432 KiB

rect

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll count_rectangles(vector<vector<int>> a) {
    int n=a.size(),m=a[0].size();
    map<tuple<int,int,int>,int>maximo_fila;
    for(int k=1;k<m-1;k++){
        for(int i=1;i<n-1;i++){
            for(int j=i;j<n-1;j++){
                if(j==i){
                    maximo_fila[{k,i,j}]=a[j][k];
                }
                else{
                    maximo_fila[{k,i,j}]=max(a[j][k],maximo_fila[{k,i,j-1}]);
                }
            }
        }
    }
    map<tuple<int,int,int>,int>maximo_columna;
    for(int k=1;k<n-1;k++){
        for(int i=1;i<m-1;i++){
            for(int j=i;j<m-1;j++){
                if(j==i){
                    maximo_columna[{k,i,j}]=a[k][j];
                }
                else{
                    maximo_columna[{k,i,j}]=max(a[k][j],maximo_columna[{k,i,j-1}]);
                }
            }
        }
    }
    ll rec=0;
    for(int i=1;i<n-1;i++){
        for(int j=i;j<n-1;j++){
            for(int k=1;k<m-1;k++){
                for(int l=k;l<m-1;l++){
                    bool posible=true;
                    for(int fila=i;fila<=j;fila++){
                        if(maximo_columna[{fila,k,l}]<a[fila][k-1]&&maximo_columna[{fila,k,l}]<a[fila][l+1]){
                            continue;
                        }
                        else{
                            posible=false;
                            break;
                        }
                    }
                    if(!posible){
                        continue;
                    }
                    for(int columna=k;columna<=l;columna++){
                        if(maximo_fila[{columna,i,j}]<a[i-1][columna]&&maximo_fila[{columna,i,j}]<a[j+1][columna]){
                            continue;
                        }
                        else{
                            posible=false;
                            break;
                        }
                    }
                    rec+=(posible);
                }
            }
        }
    }
    return rec;
}

• Subtask 1: 8 / 8
• Subtask 2: 7 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 22
• Subtask 5: 10 / 10
• Subtask 6: 0 / 13
• Subtask 7: 0 / 28