oj.uz

Submission #873201

# Submission time Handle Problem Language Result Execution time Memory
873201 2023-11-14T15:46:20 Z nguyentunglam Rectangles (IOI19_rect) C++17
100 / 100
 2158 ms 401428 KB 
#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define endl "\n"
using namespace std;

const int N = 2510;

int a[N][N], L[N], R[N], f[N][N], g[N][N];

int n, m;

vector<tuple<int, int, int> > row[N], col[N], query[N];

stack<int> S;

int bit[N];

void up (int pos, int val) {
  for(pos; pos; pos -= pos & -pos) {
    S.push(pos);
    bit[pos] += val;
  }
}

int get(int pos) {
  int ret = 0;
  for(pos; pos <= n; pos += pos & -pos) ret += bit[pos];
  return ret;
}

void rollback () {
  while (!S.empty()) bit[S.top()] = 0, S.pop();
}

long long count_rectangles (vector<vector<int> > _a) {
  n = _a.size(), m = _a[0].size();

  for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) a[i][j] = _a[i][j];

  for(int i = 1; i < n - 1; i++) {
    stack<int> st;
    for(int j = 0; j < m; j++) {
      while (!st.empty() && a[i][st.top()] <= a[i][j]) st.pop();
      L[j] = st.empty() ? 0 : st.top() + 1;
      st.push(j);
    }
    while (!st.empty()) st.pop();
    for(int j = m - 1; j >= 0; j--) {
      while (!st.empty() && a[i][st.top()] <= a[i][j]) st.pop();
      R[j] = st.empty() ? m : st.top() - 1;
      st.push(j);
    }
    for(int j = 0; j < m; j++) if (L[j] > 0 && R[j] < m - 1) row[i].emplace_back(L[j], R[j], 0);
    sort(all(row[i]));
    row[i].resize(unique(all(row[i])) - row[i].begin());
  }

  for(int i = 0; i < n; i++) row[i].emplace_back(1e9, 1e9, 1e9);

  for(int j = 1; j < m - 1; j++) {
    stack<int> st;
    for(int i = 0; i < n; i++) {
      while (!st.empty() && a[st.top()][j] <= a[i][j]) st.pop();
      L[i] = st.empty() ? 0 : st.top() + 1;
      st.push(i);
    } 
    while (!st.empty()) st.pop();
    for(int i = n - 1; i >= 0; i--) {
      while (!st.empty() && a[st.top()][j] <= a[i][j]) st.pop();
      R[i] = st.empty() ? n : st.top() - 1;
      st.push(i);
    }
    for(int i = 0; i < n; i++) if (L[i] > 0 && R[i] < n - 1) col[j].emplace_back(L[i], R[i], 0);
    sort(all(col[j]));
    col[j].resize(unique(all(col[j])) - col[j].begin());
  }

  for(int j = 0; j < m; j++) col[j].emplace_back(1e9, 1e9, 1e9);

  for(int j = m - 2; j >= 1; j--) {
    // cout << j << endl;
    for(auto &[l, r, f] : col[j]) if (l != 1e9) {
      auto &[_l, _r, _f] = *lower_bound(all(col[j + 1]), make_tuple(l, r, f));
      if (l == _l && r == _r) f = _f;
      else f = j;
      // cout << l << " " << r << " " << f << " " << j << endl;
      query[l].emplace_back(j, f, r);
    }
  }

  long long ans = 0;

  for(int i = n - 2; i >= 1; i--) {
    int k = 0;
    sort(all(query[i]));
    for(auto &[l, r, f] : row[i]) {
      auto &[_l, _r, _f] = *lower_bound(all(row[i + 1]), make_tuple(l, r, f));
      if (l == _l && r == _r) f = _f;
      else f = i;
    }
    int pre = 0;
    for(auto &[left, right, down] : query[i]) {
      if (pre != left) rollback();
      while (k < row[i].size()) {
        auto &[l, r, f] = row[i][k];
        if (l < left) {
          rollback();
          k++;
          continue;
        }
        if (l > left) break;
        if (r > right) break;
        pre = l;
        // cout << l << " " << r << " " << f << endl;
        up(f, 1);
        k++;
      }
      if (pre != left) rollback();
      ans += get(down);
      // cout << get(down) << " " << i << " " << left << " " << right << endl;
    }
    rollback();
  }

  // cout << ans;

  return ans;
}

// int32_t main() {
//   #define task ""

//   cin.tie(0) -> sync_with_stdio(0);

//   if (fopen("task.inp", "r")) {
//     freopen("task.inp", "r", stdin);
//     freopen("task.out", "w", stdout);
//   }

//   if (fopen(task".inp", "r")) {
//     freopen (task".inp", "r", stdin);
//     freopen (task".out", "w", stdout);
//   }

//   int n, m; cin >> n >> m;

//   vector<vector<int> > _tmp;

//   for(int i = 0; i < n; i++) {
//     vector<int> tmp;
//     for(int j = 0; j < m; j++) {
//       int x; cin >> x;
//       tmp.push_back(x);
//     }
//     _tmp.push_back(tmp);
//   }

//   count_rectangles(_tmp);
// }

Compilation message

rect.cpp: In function 'void up(int, int)':
rect.cpp:19:7: warning: statement has no effect [-Wunused-value]
   19 |   for(pos; pos; pos -= pos & -pos) {
      |       ^~~
rect.cpp: In function 'int get(int)':
rect.cpp:27:7: warning: statement has no effect [-Wunused-value]
   27 |   for(pos; pos <= n; pos += pos & -pos) ret += bit[pos];
      |       ^~~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:104:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |       while (k < row[i].size()) {
      |              ~~^~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4724 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 1 ms 4700 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Correct 2 ms 4952 KB Output is correct
23 Correct 2 ms 4952 KB Output is correct
24 Correct 2 ms 4956 KB Output is correct
25 Correct 2 ms 4700 KB Output is correct
26 Correct 2 ms 4956 KB Output is correct
27 Correct 3 ms 4956 KB Output is correct
28 Correct 3 ms 4956 KB Output is correct
29 Correct 2 ms 4700 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4724 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 2 ms 4952 KB Output is correct
19 Correct 2 ms 4956 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 2 ms 4956 KB Output is correct
22 Correct 3 ms 4956 KB Output is correct
23 Correct 3 ms 4956 KB Output is correct
24 Correct 2 ms 4700 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct
29 Correct 1 ms 4700 KB Output is correct
30 Correct 8 ms 9052 KB Output is correct
31 Correct 7 ms 9052 KB Output is correct
32 Correct 8 ms 9052 KB Output is correct
33 Correct 8 ms 8284 KB Output is correct
34 Correct 15 ms 9064 KB Output is correct
35 Correct 14 ms 9300 KB Output is correct
36 Correct 13 ms 9052 KB Output is correct
37 Correct 13 ms 9192 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4724 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 2 ms 4952 KB Output is correct
19 Correct 2 ms 4956 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 2 ms 4956 KB Output is correct
22 Correct 3 ms 4956 KB Output is correct
23 Correct 3 ms 4956 KB Output is correct
24 Correct 2 ms 4700 KB Output is correct
25 Correct 8 ms 9052 KB Output is correct
26 Correct 7 ms 9052 KB Output is correct
27 Correct 8 ms 9052 KB Output is correct
28 Correct 8 ms 8284 KB Output is correct
29 Correct 15 ms 9064 KB Output is correct
30 Correct 14 ms 9300 KB Output is correct
31 Correct 13 ms 9052 KB Output is correct
32 Correct 13 ms 9192 KB Output is correct
33 Correct 1 ms 4700 KB Output is correct
34 Correct 1 ms 4700 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct
36 Correct 1 ms 4700 KB Output is correct
37 Correct 1 ms 4700 KB Output is correct
38 Correct 53 ms 30292 KB Output is correct
39 Correct 50 ms 29776 KB Output is correct
40 Correct 51 ms 30416 KB Output is correct
41 Correct 47 ms 30544 KB Output is correct
42 Correct 104 ms 43140 KB Output is correct
43 Correct 99 ms 43324 KB Output is correct
44 Correct 101 ms 43504 KB Output is correct
45 Correct 102 ms 41820 KB Output is correct
46 Correct 59 ms 26448 KB Output is correct
47 Correct 78 ms 28240 KB Output is correct
48 Correct 161 ms 42492 KB Output is correct
49 Correct 187 ms 44384 KB Output is correct
50 Correct 82 ms 27472 KB Output is correct
51 Correct 81 ms 23364 KB Output is correct
52 Correct 157 ms 42708 KB Output is correct
53 Correct 164 ms 43592 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 2 ms 4796 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4952 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4696 KB Output is correct
7 Correct 353 ms 106264 KB Output is correct
8 Correct 775 ms 212796 KB Output is correct
9 Correct 772 ms 213696 KB Output is correct
10 Correct 780 ms 213692 KB Output is correct
11 Correct 83 ms 45224 KB Output is correct
12 Correct 156 ms 84932 KB Output is correct
13 Correct 162 ms 88648 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4724 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 2 ms 4952 KB Output is correct
19 Correct 2 ms 4956 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 2 ms 4956 KB Output is correct
22 Correct 3 ms 4956 KB Output is correct
23 Correct 3 ms 4956 KB Output is correct
24 Correct 2 ms 4700 KB Output is correct
25 Correct 8 ms 9052 KB Output is correct
26 Correct 7 ms 9052 KB Output is correct
27 Correct 8 ms 9052 KB Output is correct
28 Correct 8 ms 8284 KB Output is correct
29 Correct 15 ms 9064 KB Output is correct
30 Correct 14 ms 9300 KB Output is correct
31 Correct 13 ms 9052 KB Output is correct
32 Correct 13 ms 9192 KB Output is correct
33 Correct 53 ms 30292 KB Output is correct
34 Correct 50 ms 29776 KB Output is correct
35 Correct 51 ms 30416 KB Output is correct
36 Correct 47 ms 30544 KB Output is correct
37 Correct 104 ms 43140 KB Output is correct
38 Correct 99 ms 43324 KB Output is correct
39 Correct 101 ms 43504 KB Output is correct
40 Correct 102 ms 41820 KB Output is correct
41 Correct 59 ms 26448 KB Output is correct
42 Correct 78 ms 28240 KB Output is correct
43 Correct 161 ms 42492 KB Output is correct
44 Correct 187 ms 44384 KB Output is correct
45 Correct 82 ms 27472 KB Output is correct
46 Correct 81 ms 23364 KB Output is correct
47 Correct 157 ms 42708 KB Output is correct
48 Correct 164 ms 43592 KB Output is correct
49 Correct 2 ms 4956 KB Output is correct
50 Correct 2 ms 4956 KB Output is correct
51 Correct 1 ms 4700 KB Output is correct
52 Correct 1 ms 4700 KB Output is correct
53 Correct 2 ms 4956 KB Output is correct
54 Correct 2 ms 4700 KB Output is correct
55 Correct 2 ms 4956 KB Output is correct
56 Correct 2 ms 4700 KB Output is correct
57 Correct 2 ms 4796 KB Output is correct
58 Correct 1 ms 4700 KB Output is correct
59 Correct 1 ms 4952 KB Output is correct
60 Correct 1 ms 4696 KB Output is correct
61 Correct 353 ms 106264 KB Output is correct
62 Correct 775 ms 212796 KB Output is correct
63 Correct 772 ms 213696 KB Output is correct
64 Correct 780 ms 213692 KB Output is correct
65 Correct 83 ms 45224 KB Output is correct
66 Correct 156 ms 84932 KB Output is correct
67 Correct 162 ms 88648 KB Output is correct
68 Correct 1 ms 4700 KB Output is correct
69 Correct 1 ms 4700 KB Output is correct
70 Correct 1 ms 4700 KB Output is correct
71 Correct 1 ms 4700 KB Output is correct
72 Correct 1 ms 4700 KB Output is correct
73 Correct 730 ms 260300 KB Output is correct
74 Correct 683 ms 257500 KB Output is correct
75 Correct 705 ms 254588 KB Output is correct
76 Correct 645 ms 254976 KB Output is correct
77 Correct 1314 ms 393200 KB Output is correct
78 Correct 1284 ms 231912 KB Output is correct
79 Correct 1333 ms 252408 KB Output is correct
80 Correct 2083 ms 375636 KB Output is correct
81 Correct 1299 ms 246876 KB Output is correct
82 Correct 1711 ms 306808 KB Output is correct
83 Correct 2158 ms 401428 KB Output is correct
84 Correct 1233 ms 233372 KB Output is correct
85 Correct 2105 ms 391956 KB Output is correct
86 Correct 2037 ms 380832 KB Output is correct
87 Correct 781 ms 246796 KB Output is correct
88 Correct 1318 ms 392780 KB Output is correct
89 Correct 1308 ms 393212 KB Output is correct
90 Correct 1300 ms 393432 KB Output is correct