oj.uz

Submission #248537

# Submission time Handle Problem Language Result Execution time Memory
248537 2020-07-12T16:08:34 Z quocnguyen1012 Rectangles (IOI19_rect) C++14
100 / 100
 1669 ms 215484 KB 
#ifndef LOCAL
#include "rect.h"
#endif // LOCAL
#include <bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ar array

using namespace std;
typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 2505;

int N, M;
vector<int> strow[maxn], stcol[maxn];
int lst_row[maxn][maxn], lst_col[maxn][maxn];
int cnt_row[maxn][maxn], cnt_col[maxn][maxn];
int bit[maxn];

void upd(int i, int v)
{
  for(; i < maxn; i += i & -i)
    bit[i] += v;
}

int sum(int i)
{
  int res = 0;
  for(; i; i -= i & -i)
    res += bit[i];
  return res;
}

ii get(int l, int r, int cur, int lst[maxn][maxn], int cnt[maxn][maxn])
{
  if(lst[l][r] != cur - 1)
    cnt[l][r] = 0;
  ++cnt[l][r]; lst[l][r] = cur;
  return mp(r - l - 1, cnt[l][r]);
}

ll way(vector<ii> & row, vector<ii> & col)
{
  for(auto & it : col) swap(it.fi, it.se);
  ll res = 0;
  sort(col.rbegin(), col.rend());
  sort(row.rbegin(), row.rend());
  int j = 0;
  for(int i = 0; i < (int)row.size(); ++i){
    while(j < (int)col.size() && col[j].fi >= row[i].fi){
      upd(col[j].se, 1);
      ++j;
    }
    res += sum(row[i].se);
  }
  for(int i = 0; i < j; ++i)
    upd(col[i].se, -1);
  return res;
}

long long count_rectangles(std::vector<std::vector<int>> a)
{
  N = a.size();
  M = a[0].size();
  for(int i = 0; i < N; ++i)
    strow[i].eb(0);
  for(int j = 0; j < M; ++j)
    stcol[j].eb(0);
  ll ans = 0;
  for(int i = 0; i < N - 1; ++i){
    for(int j = 0; j < M - 1; ++j){
      ///row
      vector<ii> rows;
      bool eq = false;
      while(strow[i].size()){
        int k = strow[i].back();
        if(k < j && !eq) rows.eb(get(k, j + 1, i, lst_row, cnt_row));
        if(a[i][k] == a[i][j + 1]) eq = true;
        if(a[i][k] <= a[i][j + 1])
          strow[i].pop_back();
        else break;
      }
      strow[i].eb(j + 1);
      ///col
      vector<ii> cols;
      eq = false;
      while(stcol[j].size()){
        int k = stcol[j].back();
        //if(i == 4 && j == 3) cerr << k << ' ';
        if(k < i && !eq) cols.eb(get(k, i + 1, j, lst_col, cnt_col));
        if(a[i + 1][j] == a[k][j]) eq = true;
        if(a[k][j] <= a[i + 1][j])
          stcol[j].pop_back();
        else break;
      }
      stcol[j].eb(i + 1);
      /*
      if(i == 4 && j == 3){
        for(auto & it : rows) cerr << it.fi << ' ' << it.se << '\n';
        cerr << '\n';
        for(auto & it : cols) cerr << it.fi << ' ' << it.se << '\n';
        cerr << way(rows, cols);
      }
      */
      auto v = way(rows, cols);
      ans += v;
      if(v){
       // cerr << i + 1 << ' ' << j + 1 << ' ' << v << '\n';
      }
    }
  }
  return ans;
}

#ifdef LOCAL
signed main(void)
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  #ifdef LOCAL
    freopen("A.INP", "r", stdin);
    freopen("A.OUT", "w", stdout);
  #endif // LOCAL
  int n, m; cin >> n >> m;
  vector<vector<int>> a;
  a.assign(n, vector<int>(m));
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < m; ++j){
      cin >> a[i][j];
    }
  }
  cout << count_rectangles(a);
}
#endif

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 512 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 0 ms 512 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 512 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 896 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 512 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 0 ms 512 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 512 KB Output is correct
17 Correct 2 ms 1920 KB Output is correct
18 Correct 2 ms 1920 KB Output is correct
19 Correct 2 ms 1920 KB Output is correct
20 Correct 2 ms 1792 KB Output is correct
21 Correct 3 ms 1792 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 2 ms 1792 KB Output is correct
24 Correct 2 ms 1408 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 896 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 512 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 0 ms 512 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 512 KB Output is correct
17 Correct 2 ms 1920 KB Output is correct
18 Correct 2 ms 1920 KB Output is correct
19 Correct 2 ms 1920 KB Output is correct
20 Correct 2 ms 1792 KB Output is correct
21 Correct 3 ms 1792 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 2 ms 1792 KB Output is correct
24 Correct 2 ms 1408 KB Output is correct
25 Correct 7 ms 4608 KB Output is correct
26 Correct 11 ms 4608 KB Output is correct
27 Correct 7 ms 4736 KB Output is correct
28 Correct 7 ms 4096 KB Output is correct
29 Correct 14 ms 4352 KB Output is correct
30 Correct 12 ms 4608 KB Output is correct
31 Correct 11 ms 4352 KB Output is correct
32 Correct 12 ms 4352 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 896 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 512 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 0 ms 512 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 512 KB Output is correct
17 Correct 2 ms 1920 KB Output is correct
18 Correct 2 ms 1920 KB Output is correct
19 Correct 2 ms 1920 KB Output is correct
20 Correct 2 ms 1792 KB Output is correct
21 Correct 3 ms 1792 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 2 ms 1792 KB Output is correct
24 Correct 2 ms 1408 KB Output is correct
25 Correct 7 ms 4608 KB Output is correct
26 Correct 11 ms 4608 KB Output is correct
27 Correct 7 ms 4736 KB Output is correct
28 Correct 7 ms 4096 KB Output is correct
29 Correct 14 ms 4352 KB Output is correct
30 Correct 12 ms 4608 KB Output is correct
31 Correct 11 ms 4352 KB Output is correct
32 Correct 12 ms 4352 KB Output is correct
33 Correct 68 ms 25400 KB Output is correct
34 Correct 75 ms 25464 KB Output is correct
35 Correct 76 ms 25464 KB Output is correct
36 Correct 77 ms 25592 KB Output is correct
37 Correct 74 ms 24568 KB Output is correct
38 Correct 77 ms 24568 KB Output is correct
39 Correct 77 ms 24824 KB Output is correct
40 Correct 73 ms 23944 KB Output is correct
41 Correct 51 ms 16632 KB Output is correct
42 Correct 64 ms 16760 KB Output is correct
43 Correct 127 ms 20216 KB Output is correct
44 Correct 126 ms 22264 KB Output is correct
45 Correct 65 ms 14432 KB Output is correct
46 Correct 65 ms 14328 KB Output is correct
47 Correct 120 ms 19064 KB Output is correct
48 Correct 119 ms 20284 KB Output is correct
49 Correct 0 ms 384 KB Output is correct
50 Correct 0 ms 384 KB Output is correct
51 Correct 1 ms 896 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 1 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 20864 KB Output is correct
2 Correct 10 ms 17792 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 10 ms 16128 KB Output is correct
6 Correct 10 ms 15616 KB Output is correct
7 Correct 10 ms 15872 KB Output is correct
8 Correct 10 ms 14848 KB Output is correct
9 Correct 9 ms 14720 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 6 ms 10752 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 273 ms 57464 KB Output is correct
3 Correct 593 ms 102028 KB Output is correct
4 Correct 612 ms 102496 KB Output is correct
5 Correct 592 ms 102496 KB Output is correct
6 Correct 109 ms 30840 KB Output is correct
7 Correct 203 ms 58104 KB Output is correct
8 Correct 228 ms 62072 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 512 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 0 ms 512 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 512 KB Output is correct
17 Correct 2 ms 1920 KB Output is correct
18 Correct 2 ms 1920 KB Output is correct
19 Correct 2 ms 1920 KB Output is correct
20 Correct 2 ms 1792 KB Output is correct
21 Correct 3 ms 1792 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 2 ms 1792 KB Output is correct
24 Correct 2 ms 1408 KB Output is correct
25 Correct 7 ms 4608 KB Output is correct
26 Correct 11 ms 4608 KB Output is correct
27 Correct 7 ms 4736 KB Output is correct
28 Correct 7 ms 4096 KB Output is correct
29 Correct 14 ms 4352 KB Output is correct
30 Correct 12 ms 4608 KB Output is correct
31 Correct 11 ms 4352 KB Output is correct
32 Correct 12 ms 4352 KB Output is correct
33 Correct 68 ms 25400 KB Output is correct
34 Correct 75 ms 25464 KB Output is correct
35 Correct 76 ms 25464 KB Output is correct
36 Correct 77 ms 25592 KB Output is correct
37 Correct 74 ms 24568 KB Output is correct
38 Correct 77 ms 24568 KB Output is correct
39 Correct 77 ms 24824 KB Output is correct
40 Correct 73 ms 23944 KB Output is correct
41 Correct 51 ms 16632 KB Output is correct
42 Correct 64 ms 16760 KB Output is correct
43 Correct 127 ms 20216 KB Output is correct
44 Correct 126 ms 22264 KB Output is correct
45 Correct 65 ms 14432 KB Output is correct
46 Correct 65 ms 14328 KB Output is correct
47 Correct 120 ms 19064 KB Output is correct
48 Correct 119 ms 20284 KB Output is correct
49 Correct 11 ms 20864 KB Output is correct
50 Correct 10 ms 17792 KB Output is correct
51 Correct 1 ms 512 KB Output is correct
52 Correct 0 ms 384 KB Output is correct
53 Correct 10 ms 16128 KB Output is correct
54 Correct 10 ms 15616 KB Output is correct
55 Correct 10 ms 15872 KB Output is correct
56 Correct 10 ms 14848 KB Output is correct
57 Correct 9 ms 14720 KB Output is correct
58 Correct 1 ms 512 KB Output is correct
59 Correct 6 ms 10752 KB Output is correct
60 Correct 1 ms 512 KB Output is correct
61 Correct 273 ms 57464 KB Output is correct
62 Correct 593 ms 102028 KB Output is correct
63 Correct 612 ms 102496 KB Output is correct
64 Correct 592 ms 102496 KB Output is correct
65 Correct 109 ms 30840 KB Output is correct
66 Correct 203 ms 58104 KB Output is correct
67 Correct 228 ms 62072 KB Output is correct
68 Correct 854 ms 166300 KB Output is correct
69 Correct 914 ms 211304 KB Output is correct
70 Correct 971 ms 212988 KB Output is correct
71 Correct 1016 ms 211432 KB Output is correct
72 Correct 1014 ms 215484 KB Output is correct
73 Correct 951 ms 93944 KB Output is correct
74 Correct 1018 ms 110344 KB Output is correct
75 Correct 1583 ms 140052 KB Output is correct
76 Correct 1016 ms 114040 KB Output is correct
77 Correct 1310 ms 143616 KB Output is correct
78 Correct 1669 ms 172896 KB Output is correct
79 Correct 898 ms 87416 KB Output is correct
80 Correct 1575 ms 145384 KB Output is correct
81 Correct 1557 ms 140588 KB Output is correct
82 Correct 587 ms 133520 KB Output is correct
83 Correct 993 ms 214976 KB Output is correct
84 Correct 1014 ms 215320 KB Output is correct
85 Correct 1032 ms 215380 KB Output is correct
86 Correct 0 ms 384 KB Output is correct
87 Correct 0 ms 384 KB Output is correct
88 Correct 1 ms 896 KB Output is correct
89 Correct 1 ms 384 KB Output is correct
90 Correct 1 ms 384 KB Output is correct