oj.uz

Submission #824779

# Submission time Handle Problem Language Result Execution time Memory
824779 2023-08-14T10:01:25 Z erray Rectangles (IOI19_rect) C++17
100 / 100
 2092 ms 834552 KB 
#include "rect.h"
#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG
  #include "/home/eagle/ioi19/d1/debug.h"
#else 
  #define debug(...) void(37)
#endif

struct Fenwick {
  vector<short> sum;
  int n;
  Fenwick(int _n) : n(_n) {
    sum.resize(n + 1);
  }
  void modify(int x, int d) {
    x += 1;
    while (x <= n) {
      sum[x] += d;
      x += x & -x;
    }
  }
  int get(int x) {
    x += 1;
    int res = 0;
    while (x > 0) {
      res += sum[x];
      x -= x & -x;
    }
    return res;
  }
};

constexpr int mxN = 2500;
vector<array<short, 2>> col_ranges[mxN][mxN];
vector<array<short, 2>> row_ranges[mxN][mxN];
using RT = vector<vector<vector<array<short, 2>>>>;
void calc_ranges(vector<vector<int>> A, bool inv) {
	int N = int(A.size());
  int M = int(A[0].size());
  int sn = N, sm = M;
  if (inv) {
    swap(sn, sm);
  }
  //RT res(sn, vector<vector<array<short, 2>>>(sm));
  vector<vector<array<int, 2>>> last(M, vector<array<int, 2>>(M, array<int, 2>{}));
  for (int i = N - 1; i >= 0; --i) {
    auto Add = [&](int l, int r) {
      if (l + 1 == r) {
        return;
      }
      if (last[l][r][0] != i + 1) {
        last[l][r][1] = i;
      }
      last[l][r][0] = i;
      (inv ? col_ranges[l][i] : row_ranges[i][l]).push_back({r, last[l][r][1]});
    };
    vector<int> st;
    for (int j = M - 1; j >= 0; --j) {
      bool eq = false;
      while (!st.empty() && A[i][st.back()] <= A[i][j]) {
        eq |= A[i][st.back()] == A[i][j];
        Add(j, st.back());
        st.pop_back();
      }
      if (!st.empty() && !eq) {
        Add(j, st.back());
      }
      st.push_back(j);
    }
  }
}

long long count_rectangles(std::vector<std::vector<int> > A) {
	int N = int(A.size());
  int M = int(A[0].size());
  calc_ranges(A, false);  
  vector<vector<int>> temp_A(M, vector<int>(N));
  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < M; ++j) {
      temp_A[j][i] = A[i][j];
    }
  }
  calc_ranges(temp_A, true);
  /*
  auto temp = calc_ranges(temp_A);
  RT col_ranges(N, vector<vector<array<short, 2>>>(M));
  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < M; ++j) {
      col_ranges[i][j] = temp[j][i];
    }
  }
  */
  vector<Fenwick> fenw(N, Fenwick(N));
  long long ans = 0;
  for (int l = 0; l < M - 1; ++l) {
    vector<vector<array<short, 2>>> query(M);
    for (int i = 0; i < N; ++i) {
      for (auto[r, ending] : row_ranges[i][l]) {
        query[r].push_back({i, ending});
      }
    }
    vector<vector<array<short, 2>>> rem(M);
    for (int i = 0; i < N; ++i) {
      for (auto[d, ending] : col_ranges[i][l + 1]) {
        fenw[i + 1].modify(d - 1, +1);
        rem[min(M - 1, ending + 1)].push_back({i + 1, d - 1});
      }
    }
    for (int r = l + 2; r < M; ++r) {
      for (auto[u, d] : query[r]) {
        ans += fenw[u].get(d);
      }
      for (auto[u, d] : rem[r]) {
        fenw[u].modify(d, -1);
      }
    }
    debug(ans);
  }
  return ans;
}

Compilation message

rect.cpp: In lambda function:
rect.cpp:58:62: warning: narrowing conversion of 'r' from 'int' to 'short int' [-Wnarrowing]
   58 |       (inv ? col_ranges[l][i] : row_ranges[i][l]).push_back({r, last[l][r][1]});
      |                                                              ^
rect.cpp:58:79: warning: narrowing conversion of '(&(&(& last)->std::vector<std::vector<std::array<int, 2> > >::operator[](((std::vector<std::vector<std::array<int, 2> > >::size_type)l)))->std::vector<std::array<int, 2> >::operator[](((std::vector<std::array<int, 2> >::size_type)r)))->std::array<int, 2>::operator[](1)' from 'std::array<int, 2>::value_type' {aka 'int'} to 'short int' [-Wnarrowing]
   58 |       (inv ? col_ranges[l][i] : row_ranges[i][l]).push_back({r, last[l][r][1]});
      |                                                                               ^
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:102:29: warning: narrowing conversion of 'i' from 'int' to 'short int' [-Wnarrowing]
  102 |         query[r].push_back({i, ending});
      |                             ^
rect.cpp:109:50: warning: narrowing conversion of '(i + 1)' from 'int' to 'short int' [-Wnarrowing]
  109 |         rem[min(M - 1, ending + 1)].push_back({i + 1, d - 1});
      |                                                ~~^~~
rect.cpp:109:57: warning: narrowing conversion of '(((int)d) - 1)' from 'int' to 'short int' [-Wnarrowing]
  109 |         rem[min(M - 1, ending + 1)].push_back({i + 1, d - 1});
      |                                                       ~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 293772 KB Output is correct
2 Correct 124 ms 293792 KB Output is correct
3 Correct 121 ms 293836 KB Output is correct
4 Correct 121 ms 293888 KB Output is correct
5 Correct 127 ms 293928 KB Output is correct
6 Correct 126 ms 293848 KB Output is correct
7 Correct 121 ms 293836 KB Output is correct
8 Correct 121 ms 293756 KB Output is correct
9 Correct 124 ms 293776 KB Output is correct
10 Correct 125 ms 293800 KB Output is correct
11 Correct 138 ms 293816 KB Output is correct
12 Correct 135 ms 293928 KB Output is correct
13 Correct 123 ms 293720 KB Output is correct
14 Correct 127 ms 293932 KB Output is correct
15 Correct 124 ms 293768 KB Output is correct
16 Correct 126 ms 293708 KB Output is correct
17 Correct 122 ms 293816 KB Output is correct
18 Correct 125 ms 293700 KB Output is correct
19 Correct 124 ms 293820 KB Output is correct
20 Correct 124 ms 293724 KB Output is correct
21 Correct 124 ms 293816 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 293772 KB Output is correct
2 Correct 124 ms 293792 KB Output is correct
3 Correct 121 ms 293836 KB Output is correct
4 Correct 121 ms 293888 KB Output is correct
5 Correct 127 ms 293928 KB Output is correct
6 Correct 126 ms 293848 KB Output is correct
7 Correct 121 ms 293836 KB Output is correct
8 Correct 121 ms 293756 KB Output is correct
9 Correct 124 ms 293776 KB Output is correct
10 Correct 125 ms 293800 KB Output is correct
11 Correct 138 ms 293816 KB Output is correct
12 Correct 135 ms 293928 KB Output is correct
13 Correct 123 ms 293720 KB Output is correct
14 Correct 127 ms 293932 KB Output is correct
15 Correct 124 ms 293768 KB Output is correct
16 Correct 126 ms 293708 KB Output is correct
17 Correct 122 ms 293816 KB Output is correct
18 Correct 125 ms 293700 KB Output is correct
19 Correct 124 ms 293820 KB Output is correct
20 Correct 124 ms 293724 KB Output is correct
21 Correct 124 ms 293816 KB Output is correct
22 Correct 123 ms 294304 KB Output is correct
23 Correct 125 ms 294352 KB Output is correct
24 Correct 125 ms 294316 KB Output is correct
25 Correct 125 ms 294068 KB Output is correct
26 Correct 127 ms 294080 KB Output is correct
27 Correct 126 ms 294092 KB Output is correct
28 Correct 125 ms 294120 KB Output is correct
29 Correct 124 ms 293952 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 293772 KB Output is correct
2 Correct 124 ms 293792 KB Output is correct
3 Correct 121 ms 293836 KB Output is correct
4 Correct 121 ms 293888 KB Output is correct
5 Correct 127 ms 293928 KB Output is correct
6 Correct 126 ms 293848 KB Output is correct
7 Correct 121 ms 293836 KB Output is correct
8 Correct 121 ms 293756 KB Output is correct
9 Correct 124 ms 293776 KB Output is correct
10 Correct 125 ms 293800 KB Output is correct
11 Correct 138 ms 293816 KB Output is correct
12 Correct 135 ms 293928 KB Output is correct
13 Correct 123 ms 293720 KB Output is correct
14 Correct 127 ms 293932 KB Output is correct
15 Correct 124 ms 293768 KB Output is correct
16 Correct 126 ms 293708 KB Output is correct
17 Correct 123 ms 294304 KB Output is correct
18 Correct 125 ms 294352 KB Output is correct
19 Correct 125 ms 294316 KB Output is correct
20 Correct 125 ms 294068 KB Output is correct
21 Correct 127 ms 294080 KB Output is correct
22 Correct 126 ms 294092 KB Output is correct
23 Correct 125 ms 294120 KB Output is correct
24 Correct 124 ms 293952 KB Output is correct
25 Correct 122 ms 293816 KB Output is correct
26 Correct 125 ms 293700 KB Output is correct
27 Correct 124 ms 293820 KB Output is correct
28 Correct 124 ms 293724 KB Output is correct
29 Correct 124 ms 293816 KB Output is correct
30 Correct 141 ms 297244 KB Output is correct
31 Correct 128 ms 297232 KB Output is correct
32 Correct 130 ms 297164 KB Output is correct
33 Correct 132 ms 295544 KB Output is correct
34 Correct 133 ms 296024 KB Output is correct
35 Correct 136 ms 296056 KB Output is correct
36 Correct 142 ms 296212 KB Output is correct
37 Correct 140 ms 295848 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 293772 KB Output is correct
2 Correct 124 ms 293792 KB Output is correct
3 Correct 121 ms 293836 KB Output is correct
4 Correct 121 ms 293888 KB Output is correct
5 Correct 127 ms 293928 KB Output is correct
6 Correct 126 ms 293848 KB Output is correct
7 Correct 121 ms 293836 KB Output is correct
8 Correct 121 ms 293756 KB Output is correct
9 Correct 124 ms 293776 KB Output is correct
10 Correct 125 ms 293800 KB Output is correct
11 Correct 138 ms 293816 KB Output is correct
12 Correct 135 ms 293928 KB Output is correct
13 Correct 123 ms 293720 KB Output is correct
14 Correct 127 ms 293932 KB Output is correct
15 Correct 124 ms 293768 KB Output is correct
16 Correct 126 ms 293708 KB Output is correct
17 Correct 123 ms 294304 KB Output is correct
18 Correct 125 ms 294352 KB Output is correct
19 Correct 125 ms 294316 KB Output is correct
20 Correct 125 ms 294068 KB Output is correct
21 Correct 127 ms 294080 KB Output is correct
22 Correct 126 ms 294092 KB Output is correct
23 Correct 125 ms 294120 KB Output is correct
24 Correct 124 ms 293952 KB Output is correct
25 Correct 141 ms 297244 KB Output is correct
26 Correct 128 ms 297232 KB Output is correct
27 Correct 130 ms 297164 KB Output is correct
28 Correct 132 ms 295544 KB Output is correct
29 Correct 133 ms 296024 KB Output is correct
30 Correct 136 ms 296056 KB Output is correct
31 Correct 142 ms 296212 KB Output is correct
32 Correct 140 ms 295848 KB Output is correct
33 Correct 122 ms 293816 KB Output is correct
34 Correct 125 ms 293700 KB Output is correct
35 Correct 124 ms 293820 KB Output is correct
36 Correct 124 ms 293724 KB Output is correct
37 Correct 124 ms 293816 KB Output is correct
38 Correct 221 ms 321544 KB Output is correct
39 Correct 194 ms 314800 KB Output is correct
40 Correct 202 ms 314784 KB Output is correct
41 Correct 167 ms 308604 KB Output is correct
42 Correct 226 ms 336948 KB Output is correct
43 Correct 229 ms 336788 KB Output is correct
44 Correct 229 ms 336792 KB Output is correct
45 Correct 223 ms 333860 KB Output is correct
46 Correct 212 ms 313176 KB Output is correct
47 Correct 195 ms 315764 KB Output is correct
48 Correct 252 ms 321700 KB Output is correct
49 Correct 277 ms 322092 KB Output is correct
50 Correct 188 ms 310092 KB Output is correct
51 Correct 187 ms 307180 KB Output is correct
52 Correct 246 ms 320704 KB Output is correct
53 Correct 263 ms 321048 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 343116 KB Output is correct
2 Correct 154 ms 329416 KB Output is correct
3 Correct 171 ms 342896 KB Output is correct
4 Correct 126 ms 293696 KB Output is correct
5 Correct 167 ms 343048 KB Output is correct
6 Correct 169 ms 343044 KB Output is correct
7 Correct 171 ms 343044 KB Output is correct
8 Correct 166 ms 342968 KB Output is correct
9 Correct 167 ms 343036 KB Output is correct
10 Correct 165 ms 342908 KB Output is correct
11 Correct 169 ms 342976 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 293816 KB Output is correct
2 Correct 125 ms 293700 KB Output is correct
3 Correct 124 ms 293820 KB Output is correct
4 Correct 124 ms 293724 KB Output is correct
5 Correct 124 ms 293816 KB Output is correct
6 Correct 131 ms 293796 KB Output is correct
7 Correct 523 ms 397132 KB Output is correct
8 Correct 1112 ms 538108 KB Output is correct
9 Correct 1107 ms 539472 KB Output is correct
10 Correct 1070 ms 539496 KB Output is correct
11 Correct 310 ms 379980 KB Output is correct
12 Correct 457 ms 435688 KB Output is correct
13 Correct 521 ms 441856 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 293772 KB Output is correct
2 Correct 124 ms 293792 KB Output is correct
3 Correct 121 ms 293836 KB Output is correct
4 Correct 121 ms 293888 KB Output is correct
5 Correct 127 ms 293928 KB Output is correct
6 Correct 126 ms 293848 KB Output is correct
7 Correct 121 ms 293836 KB Output is correct
8 Correct 121 ms 293756 KB Output is correct
9 Correct 124 ms 293776 KB Output is correct
10 Correct 125 ms 293800 KB Output is correct
11 Correct 138 ms 293816 KB Output is correct
12 Correct 135 ms 293928 KB Output is correct
13 Correct 123 ms 293720 KB Output is correct
14 Correct 127 ms 293932 KB Output is correct
15 Correct 124 ms 293768 KB Output is correct
16 Correct 126 ms 293708 KB Output is correct
17 Correct 123 ms 294304 KB Output is correct
18 Correct 125 ms 294352 KB Output is correct
19 Correct 125 ms 294316 KB Output is correct
20 Correct 125 ms 294068 KB Output is correct
21 Correct 127 ms 294080 KB Output is correct
22 Correct 126 ms 294092 KB Output is correct
23 Correct 125 ms 294120 KB Output is correct
24 Correct 124 ms 293952 KB Output is correct
25 Correct 141 ms 297244 KB Output is correct
26 Correct 128 ms 297232 KB Output is correct
27 Correct 130 ms 297164 KB Output is correct
28 Correct 132 ms 295544 KB Output is correct
29 Correct 133 ms 296024 KB Output is correct
30 Correct 136 ms 296056 KB Output is correct
31 Correct 142 ms 296212 KB Output is correct
32 Correct 140 ms 295848 KB Output is correct
33 Correct 221 ms 321544 KB Output is correct
34 Correct 194 ms 314800 KB Output is correct
35 Correct 202 ms 314784 KB Output is correct
36 Correct 167 ms 308604 KB Output is correct
37 Correct 226 ms 336948 KB Output is correct
38 Correct 229 ms 336788 KB Output is correct
39 Correct 229 ms 336792 KB Output is correct
40 Correct 223 ms 333860 KB Output is correct
41 Correct 212 ms 313176 KB Output is correct
42 Correct 195 ms 315764 KB Output is correct
43 Correct 252 ms 321700 KB Output is correct
44 Correct 277 ms 322092 KB Output is correct
45 Correct 188 ms 310092 KB Output is correct
46 Correct 187 ms 307180 KB Output is correct
47 Correct 246 ms 320704 KB Output is correct
48 Correct 263 ms 321048 KB Output is correct
49 Correct 164 ms 343116 KB Output is correct
50 Correct 154 ms 329416 KB Output is correct
51 Correct 171 ms 342896 KB Output is correct
52 Correct 126 ms 293696 KB Output is correct
53 Correct 167 ms 343048 KB Output is correct
54 Correct 169 ms 343044 KB Output is correct
55 Correct 171 ms 343044 KB Output is correct
56 Correct 166 ms 342968 KB Output is correct
57 Correct 167 ms 343036 KB Output is correct
58 Correct 165 ms 342908 KB Output is correct
59 Correct 169 ms 342976 KB Output is correct
60 Correct 131 ms 293796 KB Output is correct
61 Correct 523 ms 397132 KB Output is correct
62 Correct 1112 ms 538108 KB Output is correct
63 Correct 1107 ms 539472 KB Output is correct
64 Correct 1070 ms 539496 KB Output is correct
65 Correct 310 ms 379980 KB Output is correct
66 Correct 457 ms 435688 KB Output is correct
67 Correct 521 ms 441856 KB Output is correct
68 Correct 122 ms 293816 KB Output is correct
69 Correct 125 ms 293700 KB Output is correct
70 Correct 124 ms 293820 KB Output is correct
71 Correct 124 ms 293724 KB Output is correct
72 Correct 124 ms 293816 KB Output is correct
73 Correct 1812 ms 636700 KB Output is correct
74 Correct 1186 ms 555828 KB Output is correct
75 Correct 1332 ms 555668 KB Output is correct
76 Correct 831 ms 474836 KB Output is correct
77 Correct 2071 ms 834552 KB Output is correct
78 Correct 1181 ms 491788 KB Output is correct
79 Correct 1277 ms 533164 KB Output is correct
80 Correct 2005 ms 642812 KB Output is correct
81 Correct 1233 ms 492440 KB Output is correct
82 Correct 1649 ms 583756 KB Output is correct
83 Correct 2013 ms 643256 KB Output is correct
84 Correct 1154 ms 482352 KB Output is correct
85 Correct 1913 ms 629772 KB Output is correct
86 Correct 2090 ms 618516 KB Output is correct
87 Correct 1185 ms 637032 KB Output is correct
88 Correct 2079 ms 831832 KB Output is correct
89 Correct 2092 ms 832180 KB Output is correct
90 Correct 2055 ms 832040 KB Output is correct