oj.uz

답안 #144104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
144104 2019-08-16T04:28:44 Z Kanon Rectangles (IOI19_rect) C++14
100 / 100
 3662 ms 674456 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);
      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 = dog[l][r].first;
        dog[l][r].second = i;
      } else dog[l][r] = make_pair(i, i);
      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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 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 376 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 376 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 376 KB Output is correct
14 Correct 2 ms 256 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 376 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 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 376 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 376 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 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 4 ms 1016 KB Output is correct
18 Correct 4 ms 1016 KB Output is correct
19 Correct 4 ms 888 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 376 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 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 376 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 376 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 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 4 ms 1016 KB Output is correct
18 Correct 4 ms 1016 KB Output is correct
19 Correct 4 ms 888 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 11 ms 3960 KB Output is correct
26 Correct 12 ms 3960 KB Output is correct
27 Correct 13 ms 3960 KB Output is correct
28 Correct 13 ms 3960 KB Output is correct
29 Correct 19 ms 4604 KB Output is correct
30 Correct 20 ms 4600 KB Output is correct
31 Correct 20 ms 4600 KB Output is correct
32 Correct 19 ms 4472 KB Output is correct
33 Correct 2 ms 376 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 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 376 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 376 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 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 4 ms 1016 KB Output is correct
18 Correct 4 ms 1016 KB Output is correct
19 Correct 4 ms 888 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 11 ms 3960 KB Output is correct
26 Correct 12 ms 3960 KB Output is correct
27 Correct 13 ms 3960 KB Output is correct
28 Correct 13 ms 3960 KB Output is correct
29 Correct 19 ms 4604 KB Output is correct
30 Correct 20 ms 4600 KB Output is correct
31 Correct 20 ms 4600 KB Output is correct
32 Correct 19 ms 4472 KB Output is correct
33 Correct 132 ms 40800 KB Output is correct
34 Correct 144 ms 45604 KB Output is correct
35 Correct 146 ms 45564 KB Output is correct
36 Correct 144 ms 50396 KB Output is correct
37 Correct 117 ms 46268 KB Output is correct
38 Correct 116 ms 46200 KB Output is correct
39 Correct 117 ms 46328 KB Output is correct
40 Correct 111 ms 43868 KB Output is correct
41 Correct 127 ms 42616 KB Output is correct
42 Correct 151 ms 45176 KB Output is correct
43 Correct 240 ms 53112 KB Output is correct
44 Correct 251 ms 53112 KB Output is correct
45 Correct 126 ms 27868 KB Output is correct
46 Correct 122 ms 27768 KB Output is correct
47 Correct 232 ms 51704 KB Output is correct
48 Correct 235 ms 51780 KB Output is correct
49 Correct 2 ms 376 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

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 49912 KB Output is correct
2 Correct 34 ms 36088 KB Output is correct
3 Correct 45 ms 49748 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 46 ms 49884 KB Output is correct
6 Correct 46 ms 49912 KB Output is correct
7 Correct 47 ms 49912 KB Output is correct
8 Correct 46 ms 49912 KB Output is correct
9 Correct 48 ms 49912 KB Output is correct
10 Correct 45 ms 49628 KB Output is correct
11 Correct 46 ms 49660 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 833 ms 256592 KB Output is correct
3 Correct 1860 ms 536440 KB Output is correct
4 Correct 1864 ms 538836 KB Output is correct
5 Correct 1883 ms 539120 KB Output is correct
6 Correct 384 ms 230520 KB Output is correct
7 Correct 723 ms 414072 KB Output is correct
8 Correct 773 ms 441336 KB Output is correct
9 Correct 2 ms 376 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
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 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 376 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 376 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 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 4 ms 1016 KB Output is correct
18 Correct 4 ms 1016 KB Output is correct
19 Correct 4 ms 888 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 11 ms 3960 KB Output is correct
26 Correct 12 ms 3960 KB Output is correct
27 Correct 13 ms 3960 KB Output is correct
28 Correct 13 ms 3960 KB Output is correct
29 Correct 19 ms 4604 KB Output is correct
30 Correct 20 ms 4600 KB Output is correct
31 Correct 20 ms 4600 KB Output is correct
32 Correct 19 ms 4472 KB Output is correct
33 Correct 132 ms 40800 KB Output is correct
34 Correct 144 ms 45604 KB Output is correct
35 Correct 146 ms 45564 KB Output is correct
36 Correct 144 ms 50396 KB Output is correct
37 Correct 117 ms 46268 KB Output is correct
38 Correct 116 ms 46200 KB Output is correct
39 Correct 117 ms 46328 KB Output is correct
40 Correct 111 ms 43868 KB Output is correct
41 Correct 127 ms 42616 KB Output is correct
42 Correct 151 ms 45176 KB Output is correct
43 Correct 240 ms 53112 KB Output is correct
44 Correct 251 ms 53112 KB Output is correct
45 Correct 126 ms 27868 KB Output is correct
46 Correct 122 ms 27768 KB Output is correct
47 Correct 232 ms 51704 KB Output is correct
48 Correct 235 ms 51780 KB Output is correct
49 Correct 46 ms 49912 KB Output is correct
50 Correct 34 ms 36088 KB Output is correct
51 Correct 45 ms 49748 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 46 ms 49884 KB Output is correct
54 Correct 46 ms 49912 KB Output is correct
55 Correct 47 ms 49912 KB Output is correct
56 Correct 46 ms 49912 KB Output is correct
57 Correct 48 ms 49912 KB Output is correct
58 Correct 45 ms 49628 KB Output is correct
59 Correct 46 ms 49660 KB Output is correct
60 Correct 2 ms 380 KB Output is correct
61 Correct 833 ms 256592 KB Output is correct
62 Correct 1860 ms 536440 KB Output is correct
63 Correct 1864 ms 538836 KB Output is correct
64 Correct 1883 ms 539120 KB Output is correct
65 Correct 384 ms 230520 KB Output is correct
66 Correct 723 ms 414072 KB Output is correct
67 Correct 773 ms 441336 KB Output is correct
68 Correct 1782 ms 505036 KB Output is correct
69 Correct 1941 ms 570912 KB Output is correct
70 Correct 2001 ms 570936 KB Output is correct
71 Correct 2163 ms 636972 KB Output is correct
72 Correct 1542 ms 559320 KB Output is correct
73 Correct 2129 ms 411512 KB Output is correct
74 Correct 2216 ms 432336 KB Output is correct
75 Correct 3579 ms 672304 KB Output is correct
76 Correct 2183 ms 412668 KB Output is correct
77 Correct 2879 ms 541512 KB Output is correct
78 Correct 3662 ms 674456 KB Output is correct
79 Correct 2063 ms 401764 KB Output is correct
80 Correct 3488 ms 658304 KB Output is correct
81 Correct 3357 ms 639112 KB Output is correct
82 Correct 903 ms 347900 KB Output is correct
83 Correct 1509 ms 558996 KB Output is correct
84 Correct 1523 ms 559384 KB Output is correct
85 Correct 1552 ms 559204 KB Output is correct
86 Correct 2 ms 376 KB Output is correct
87 Correct 2 ms 256 KB Output is correct
88 Correct 2 ms 380 KB Output is correct
89 Correct 2 ms 376 KB Output is correct
90 Correct 2 ms 256 KB Output is correct