oj.uz

Submission #144103

# Submission time Handle Problem Language Result Execution time Memory
144103 2019-08-16T04:23:26 Z Kanon Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 636852 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define ordered_set tree<long long, null_type, greater<long long>, rb_tree_tag,tree_order_statistics_node_update>
#define range(i, m, n) for(int i = m; i < n; i++)
#define husk(i, m, n) for(int i = m; i > n; i--)


long long count_rectangles(vector<vector<int>> a) {
  int m = a.front().size();
  int n = a.size();
  auto pos = [&] (vector<int> cur) {
    int s = cur.size();
    vector<pair<int, int>> res;
    vector<int> st;
    range(i, 0, s) {
      while(st.size() && cur[st.back()] <= cur[i]) {
        if(st.back() < i - 1) res.emplace_back(st.back() + 1, i - 1);
        int b = st.back();
        st.pop_back();
        if(cur[b] == cur[i]) goto A;
      }
      if(st.size() && st.back() < i - 1) res.emplace_back(st.back() + 1, i - 1);
      A:;
      st.push_back(i);
    }
    return res;
  };
  vector<vector<vector<pair<int, int>>>> hp;
  vector<vector<pair<int, int>>> cat;
  hp.resize(n); for(auto &i : hp) i.resize(m);
  cat.resize(m); for(auto &i : cat) i.resize(m, make_pair(-2, -2));
  range(i, 0, n) {
    vector<pair<int, int>> foo = pos(a[i]);
    for(auto u : foo) {
      int l = u.first, r = u.second;
      pair<int, int> p = make_pair(l, i);
      /*if(cat[l][r].second == i - 1) {
        p.second = cat[l][r].first;
        cat[l][r].second = i;
      }
      else cat[l][r] = make_pair(i, i);*/
      if(i) {
        for(auto x : hp[i - 1][r]) if(x.first == l) p.second = x.second;
      }
      hp[i][r].push_back(p);
    }
  }
  vector<vector<vector<pair<int, int>>>> vs;
  vs.resize(n); for(auto &i : vs) i.resize(m);
  vector<vector<pair<int, int>>> dog;
  dog.resize(n); for(auto &i : dog) i.resize(n, make_pair(-2, -2));
  range(i, 0, m) {
    vector<int> fuck(n);
    range(j, 0, n) fuck[j] = a[j][i];
    vector<pair<int, int>> foo = pos(fuck);
    for(auto u : foo) {
      int l = u.first, r = u.second;
      pair<int, int> p = make_pair(l, i);
      /*if(dog[l][r].second == i - 1) {
        p.second = cat[l][r].first;
        dog[l][r].second = i;
      } else dog[l][r] = make_pair(i, i);*/
      if(i) {
        for(auto x : vs[r][i - 1]) if(x.first == l) p.second = x.second;
      }
      vs[r][i].push_back(p);
    }
  }
  long long res = 0;
  auto cnt = [&](vector<pair<int, int>> &x, vector<pair<int, int>> &y) {
    for(auto &i : y) {
      swap(i.first, i.second);
    }
    sort(y.begin(), y.end());
    reverse(y.begin(), y.end());
    reverse(x.begin(), x.end());
    ordered_set cur;
    auto it = x.begin();
    int p = y.size() - 1;
    while(it != x.end()) {
      while(~p && y[p].first <= it->first) {
        cur.insert(y[p].second);
        p--;
      }
      res += cur.order_of_key(it->second - 1);
      it++;
    }
  };
  range(i, 0, n) {
    range(j, 0, m) {
      cnt(hp[i][j], vs[i][j]);
    }
  }
  return res;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 888 KB Output is correct
18 Correct 5 ms 892 KB Output is correct
19 Correct 5 ms 1016 KB Output is correct
20 Correct 4 ms 888 KB Output is correct
21 Correct 5 ms 1016 KB Output is correct
22 Correct 5 ms 1016 KB Output is correct
23 Correct 5 ms 1016 KB Output is correct
24 Correct 3 ms 632 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 380 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 256 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 888 KB Output is correct
18 Correct 5 ms 892 KB Output is correct
19 Correct 5 ms 1016 KB Output is correct
20 Correct 4 ms 888 KB Output is correct
21 Correct 5 ms 1016 KB Output is correct
22 Correct 5 ms 1016 KB Output is correct
23 Correct 5 ms 1016 KB Output is correct
24 Correct 3 ms 632 KB Output is correct
25 Correct 27 ms 3964 KB Output is correct
26 Correct 27 ms 3960 KB Output is correct
27 Correct 27 ms 3960 KB Output is correct
28 Correct 14 ms 3960 KB Output is correct
29 Correct 20 ms 4600 KB Output is correct
30 Correct 21 ms 4600 KB Output is correct
31 Correct 20 ms 4600 KB Output is correct
32 Correct 20 ms 4472 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 ms 380 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 256 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 888 KB Output is correct
18 Correct 5 ms 892 KB Output is correct
19 Correct 5 ms 1016 KB Output is correct
20 Correct 4 ms 888 KB Output is correct
21 Correct 5 ms 1016 KB Output is correct
22 Correct 5 ms 1016 KB Output is correct
23 Correct 5 ms 1016 KB Output is correct
24 Correct 3 ms 632 KB Output is correct
25 Correct 27 ms 3964 KB Output is correct
26 Correct 27 ms 3960 KB Output is correct
27 Correct 27 ms 3960 KB Output is correct
28 Correct 14 ms 3960 KB Output is correct
29 Correct 20 ms 4600 KB Output is correct
30 Correct 21 ms 4600 KB Output is correct
31 Correct 20 ms 4600 KB Output is correct
32 Correct 20 ms 4472 KB Output is correct
33 Correct 130 ms 40696 KB Output is correct
34 Correct 141 ms 45560 KB Output is correct
35 Correct 126 ms 45532 KB Output is correct
36 Correct 140 ms 50436 KB Output is correct
37 Correct 741 ms 46200 KB Output is correct
38 Correct 741 ms 46356 KB Output is correct
39 Correct 738 ms 46328 KB Output is correct
40 Correct 672 ms 43836 KB Output is correct
41 Correct 119 ms 42616 KB Output is correct
42 Correct 146 ms 45176 KB Output is correct
43 Correct 237 ms 53128 KB Output is correct
44 Correct 244 ms 53072 KB Output is correct
45 Correct 124 ms 27768 KB Output is correct
46 Correct 129 ms 27640 KB Output is correct
47 Correct 230 ms 51704 KB Output is correct
48 Correct 236 ms 51748 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 2 ms 256 KB Output is correct
51 Correct 2 ms 380 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 49912 KB Output is correct
2 Correct 42 ms 36088 KB Output is correct
3 Correct 44 ms 49796 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 45 ms 49912 KB Output is correct
6 Correct 45 ms 49912 KB Output is correct
7 Correct 45 ms 49912 KB Output is correct
8 Correct 45 ms 49840 KB Output is correct
9 Correct 45 ms 49912 KB Output is correct
10 Correct 44 ms 49528 KB Output is correct
11 Correct 44 ms 49668 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 773 ms 256504 KB Output is correct
3 Correct 1727 ms 536328 KB Output is correct
4 Correct 1732 ms 538788 KB Output is correct
5 Correct 1714 ms 539044 KB Output is correct
6 Correct 376 ms 230520 KB Output is correct
7 Correct 730 ms 414244 KB Output is correct
8 Correct 768 ms 441336 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 380 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 888 KB Output is correct
18 Correct 5 ms 892 KB Output is correct
19 Correct 5 ms 1016 KB Output is correct
20 Correct 4 ms 888 KB Output is correct
21 Correct 5 ms 1016 KB Output is correct
22 Correct 5 ms 1016 KB Output is correct
23 Correct 5 ms 1016 KB Output is correct
24 Correct 3 ms 632 KB Output is correct
25 Correct 27 ms 3964 KB Output is correct
26 Correct 27 ms 3960 KB Output is correct
27 Correct 27 ms 3960 KB Output is correct
28 Correct 14 ms 3960 KB Output is correct
29 Correct 20 ms 4600 KB Output is correct
30 Correct 21 ms 4600 KB Output is correct
31 Correct 20 ms 4600 KB Output is correct
32 Correct 20 ms 4472 KB Output is correct
33 Correct 130 ms 40696 KB Output is correct
34 Correct 141 ms 45560 KB Output is correct
35 Correct 126 ms 45532 KB Output is correct
36 Correct 140 ms 50436 KB Output is correct
37 Correct 741 ms 46200 KB Output is correct
38 Correct 741 ms 46356 KB Output is correct
39 Correct 738 ms 46328 KB Output is correct
40 Correct 672 ms 43836 KB Output is correct
41 Correct 119 ms 42616 KB Output is correct
42 Correct 146 ms 45176 KB Output is correct
43 Correct 237 ms 53128 KB Output is correct
44 Correct 244 ms 53072 KB Output is correct
45 Correct 124 ms 27768 KB Output is correct
46 Correct 129 ms 27640 KB Output is correct
47 Correct 230 ms 51704 KB Output is correct
48 Correct 236 ms 51748 KB Output is correct
49 Correct 56 ms 49912 KB Output is correct
50 Correct 42 ms 36088 KB Output is correct
51 Correct 44 ms 49796 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 45 ms 49912 KB Output is correct
54 Correct 45 ms 49912 KB Output is correct
55 Correct 45 ms 49912 KB Output is correct
56 Correct 45 ms 49840 KB Output is correct
57 Correct 45 ms 49912 KB Output is correct
58 Correct 44 ms 49528 KB Output is correct
59 Correct 44 ms 49668 KB Output is correct
60 Correct 2 ms 256 KB Output is correct
61 Correct 773 ms 256504 KB Output is correct
62 Correct 1727 ms 536328 KB Output is correct
63 Correct 1732 ms 538788 KB Output is correct
64 Correct 1714 ms 539044 KB Output is correct
65 Correct 376 ms 230520 KB Output is correct
66 Correct 730 ms 414244 KB Output is correct
67 Correct 768 ms 441336 KB Output is correct
68 Correct 1689 ms 505036 KB Output is correct
69 Correct 1873 ms 571060 KB Output is correct
70 Correct 1895 ms 570828 KB Output is correct
71 Correct 2189 ms 636852 KB Output is correct
72 Execution timed out 5029 ms 264904 KB Time limit exceeded
73 Halted 0 ms 0 KB -