Submission #240910

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
240910	2020-06-21 12:47:17	zoomswk	Rectangles (IOI19_rect)	C++17	0 / 100	15 ms	8576 KiB

rect

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "rect.h"
using namespace std;
//int max_in_row[205][205][205]; // max_in_row[i][j][k] = max{a[i][j..k]}
int col_prev_larger[705][705]; // stores prev row
//int min_col_prev_larger[205][205][205]; // stores prev row
int col_next_larger[705][705]; // stores next row
//int max_col_next_larger[205][205][205]; // stores next row
int mir[705][705]; // mir[i][k] = max{a[i][c..k]}
int mcpl[705][705];
int mcnl[705][705];
long long count_rectangles(std::vector<std::vector<int> > a) {
  int n = (int)a.size();
  int m = (int)a[0].size();
  if(n < 3 || m < 3) return 0;
  for(int i=1; i<n-1; i++){
    for(int j=1; j<m-1; j++){
      /*
      max_in_row[i][j][j] = a[i][j];
      for(int k=j+1; k<m-1; k++){
        max_in_row[i][j][k] = max(max_in_row[i][j][k-1], a[i][k]);
      }
      */
      col_prev_larger[i][j] = 1e9;
      for(int k=i-1; k>=0; k--){
        if(a[k][j] > a[i][j]){
          col_prev_larger[i][j] = k;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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