제출 #1035446

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1035446		Abito	Rectangles (IOI19_rect)	C++17	27 / 100	527 ms	65684 KiB

rect

#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
const int N=205;
int n,m,a[N][N],pr[N][N][N],pc[N][N][N];
long long count_rectangles(vector<vector<int>> v){
    n=v.size();
    m=v[0].size();
    if (n<=2 || m<=2) return 0LL;
    for (int i=0;i<n;i++) for (int j=0;j<m;j++) a[i+1][j+1]=v[i][j];
    for (int i=2;i<n;i++){
        for (int j=2;j<m;j++){
            int mx=a[i][j];
            for (int k=j;k<m;k++){
                mx=max(mx,a[i][k]);
                pr[i][j][k]=pr[i-1][j][k]+bool(mx<a[i][j-1] && mx<a[i][k+1]);
                //if (mx<a[i][j-1] && mx<a[i][k+1]) cout<<i<<' '<<j<<' '<<k<<endl;
            }
        }
    }
    for (int i=2;i<m;i++){
        for (int j=2;j<n;j++){
            int mx=a[j][i];
            for (int k=j;k<n;k++){
                mx=max(mx,a[k][i]);
                pc[i][j][k]=pc[i-1][j][k]+bool(mx<a[j-1][i] && mx<a[k+1][i]);
                //if (mx<a[j-1][i] && mx<a[k+1][i]) cout<<i<<' '<<j<<' '<<k<<endl;
            }
        }
    }
    long long ans=0;
    for (int i=2;i<n;i++){
        for (int j=2;j<m;j++){
            for (int k=i;k<n;k++){
                for (int l=j;l<m;l++){
                    ans+=bool(pr[k][j][l]-pr[i-1][j][l]==k-i+1 && pc[l][i][k]-pc[j-1][i][k]==l-j+1);
                }
            }
        }
    }
    return ans;
}

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