Submission #1110809

#	Time	Username	Problem	Language	Result	Execution time	Memory
1110809		epicci23	Rectangles (IOI19_rect)	C++17	37 / 100	5081 ms	50972 KiB

rect

#include "bits/stdc++.h"
//#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;


long long count_rectangles(vector<vector<int>> ar){
  int n=sz(ar),m=sz(ar[0]);
  int64_t ans=0,a[n+5][m+5];
  for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) a[i][j]=ar[i-1][j-1];
  
  for(int i=2;i<n;i++){
    for(int j=2;j<m;j++){
      if(a[i][j]>=a[i-1][j] || a[i][j]>=a[i][j-1]) continue;
      
      for(int alt=i;alt<n;alt++){
       vector<int64_t> mr(n+5,0);

       for(int z=j;z<m;z++){
         int64_t cl=0;
         bool ok=1;
         for(int k=i;k<=alt;k++){
          mr[k]=max(mr[k],a[k][z]);
          cl=max(cl,a[k][z]);
          if(min(a[k][j-1],a[k][z+1])<=mr[k]) ok=0;
         }
         if(min(a[i-1][z],a[alt+1][z])<=cl) break;
         ans+=ok;
       }

      }


    }
  }

  return ans;
}



/*void _(){
  int n,m;
  cin >> n >> m;
  int ans=0,a[n+5][m+5];
  for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin >> a[i][j];
  
  for(int i=2;i<n;i++){
  	for(int j=2;j<m;j++){
  	  if(a[i][j]>=a[i-1][j] || a[i][j]>=a[i][j-1]) continue;
  	  
      for(int alt=i;alt<n;alt++){
       vector<int> mr(n+5,0);

       for(int z=j;z<m;z++){
         int cl=0;
         bool ok=1;
         for(int k=i;k<=alt;k++){
          mr[k]=max(mr[k],a[k][z]);
          cl=max(cl,a[k][z]);
          if(min(a[k][j-1],a[k][z+1])<=mr[k]) ok=0;
         }
         if(min(a[i-1][z],a[alt+1][z])<=cl) break;
         ans+=ok;
       }

      }


  	}
  }

  cout << ans << '\n';
}

int32_t main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tc=1;//cin >> tc;
  while(tc--) _();
  return 0;
}*/

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