Submission #340548

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
340548	2020-12-27 22:18:17	FlashGamezzz	Rectangles (IOI19_rect)	C++17	37 / 100	5075 ms	234628 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 <iostream>
#include <cstdlib>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <unordered_set>
#include <vector>
#include <utility>
#include "rect.h"
using namespace std;
int n, m;
vector<vector<vector<bool> > > val, val2;
long long count_rectangles(vector<vector<int> > a) {
  n = a.size(); m = a[0].size(); long long ans = 0;
  val.push_back(vector<vector<bool> >()); val2.push_back(vector<vector<bool> >());
  for (int r = 1; r < n-1; r++){
    val.push_back(vector<vector<bool> >()); val[r].push_back(vector<bool>());
    for (int cs = 1; cs < m-1; cs++){
      val[r].push_back(vector<bool>()); int maxv = 0;
      for (int t = 0; t < cs; t++){
        val[r][cs].push_back(false);
      }
      for (int ce = cs; ce < m-1; ce++){
        maxv = max(maxv, a[r][ce]);
        if (maxv < a[r][cs-1] && maxv < a[r][ce+1]){
          val[r][cs].push_back(true);
        } else {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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