oj.uz

Submission #144034

# Submission time Handle Problem Language Result Execution time Memory
144034 2019-08-15T18:14:17 Z Kanon Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 999284 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<set<pair<short, short>>>> hp;
  hp.resize(n); for(auto &i : hp) i.resize(m);
  vector<vector<vector<pair<short, short>>>> pp;
  pp.resize(n); for(auto &i : pp) i.resize(m);
  range(i, 0, n) {
    vector<pair<int, int>> foo = pos(a[i]);
    for(auto u : foo) {
      int l = u.first, r = u.second;
      pair<short, short> p = make_pair(l, i);
      if(i && hp[i - 1][r].lower_bound(make_pair(l, -1))->first == l) p.second = hp[i - 1][r].lower_bound(make_pair(l, -1))->second;
      hp[i][r].insert(p);
    }
    range(r, 0, m) for(auto j : hp[i][r]) pp[i][r].push_back(j);
    if(i >= 2) hp[i - 2].clear();
  }
  hp.clear();
  vector<vector<set<pair<short, short>>>> vs;
  vs.resize(n); for(auto &i : vs) i.resize(m);
  vector<vector<vector<pair<short, short>>>> ss;
  ss.resize(n); for(auto &i : ss) i.resize(m);
  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<short, short> p = make_pair(l, i);
      if(i && vs[r][i - 1].lower_bound(make_pair(l, -1))->first == l) p.second = vs[r][i - 1].lower_bound(make_pair(l, -1))->second;
      vs[r][i].insert(p);
    }
    range(r, 0, n) for(auto j : vs[r][i]) ss[r][i].push_back(j);
  }
  vs.clear();
  long long res = 0;
  auto cnt = [&](vector<pair<short, short>> &x, vector<pair<short, short>> &y) {
    for(auto &i : y) {
      swap(i.first, i.second);
    }
    sort(y.begin(), y.end());
    reverse(y.begin(), y.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(pp[i][j], ss[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 3 ms 504 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 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 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 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 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 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 3 ms 504 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 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 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 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 1272 KB Output is correct
18 Correct 6 ms 1272 KB Output is correct
19 Correct 6 ms 1400 KB Output is correct
20 Correct 5 ms 1272 KB Output is correct
21 Correct 6 ms 1400 KB Output is correct
22 Correct 7 ms 1404 KB Output is correct
23 Correct 6 ms 1404 KB Output is correct
24 Correct 4 ms 888 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 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 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 3 ms 504 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 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 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 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 1272 KB Output is correct
18 Correct 6 ms 1272 KB Output is correct
19 Correct 6 ms 1400 KB Output is correct
20 Correct 5 ms 1272 KB Output is correct
21 Correct 6 ms 1400 KB Output is correct
22 Correct 7 ms 1404 KB Output is correct
23 Correct 6 ms 1404 KB Output is correct
24 Correct 4 ms 888 KB Output is correct
25 Correct 29 ms 6660 KB Output is correct
26 Correct 29 ms 6648 KB Output is correct
27 Correct 29 ms 6648 KB Output is correct
28 Correct 19 ms 6008 KB Output is correct
29 Correct 32 ms 7420 KB Output is correct
30 Correct 32 ms 7544 KB Output is correct
31 Correct 31 ms 7248 KB Output is correct
32 Correct 32 ms 7172 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 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 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 3 ms 504 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 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 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 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 1272 KB Output is correct
18 Correct 6 ms 1272 KB Output is correct
19 Correct 6 ms 1400 KB Output is correct
20 Correct 5 ms 1272 KB Output is correct
21 Correct 6 ms 1400 KB Output is correct
22 Correct 7 ms 1404 KB Output is correct
23 Correct 6 ms 1404 KB Output is correct
24 Correct 4 ms 888 KB Output is correct
25 Correct 29 ms 6660 KB Output is correct
26 Correct 29 ms 6648 KB Output is correct
27 Correct 29 ms 6648 KB Output is correct
28 Correct 19 ms 6008 KB Output is correct
29 Correct 32 ms 7420 KB Output is correct
30 Correct 32 ms 7544 KB Output is correct
31 Correct 31 ms 7248 KB Output is correct
32 Correct 32 ms 7172 KB Output is correct
33 Correct 231 ms 64632 KB Output is correct
34 Correct 235 ms 70904 KB Output is correct
35 Correct 231 ms 70952 KB Output is correct
36 Correct 231 ms 77144 KB Output is correct
37 Correct 423 ms 78896 KB Output is correct
38 Correct 422 ms 78852 KB Output is correct
39 Correct 440 ms 78948 KB Output is correct
40 Correct 394 ms 73964 KB Output is correct
41 Correct 200 ms 63708 KB Output is correct
42 Correct 245 ms 69624 KB Output is correct
43 Correct 420 ms 88568 KB Output is correct
44 Correct 447 ms 88824 KB Output is correct
45 Correct 206 ms 44536 KB Output is correct
46 Correct 202 ms 44376 KB Output is correct
47 Correct 405 ms 85624 KB Output is correct
48 Correct 402 ms 85748 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 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1400 KB Output is correct
2 Correct 6 ms 1272 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 6 ms 1400 KB Output is correct
6 Correct 6 ms 1400 KB Output is correct
7 Correct 6 ms 1400 KB Output is correct
8 Correct 5 ms 1400 KB Output is correct
9 Correct 6 ms 1400 KB Output is correct
10 Correct 3 ms 636 KB Output is correct
11 Correct 4 ms 1016 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 1280 ms 370532 KB Output is correct
3 Correct 2916 ms 803748 KB Output is correct
4 Correct 2953 ms 807608 KB Output is correct
5 Correct 2949 ms 807992 KB Output is correct
6 Correct 585 ms 314796 KB Output is correct
7 Correct 1198 ms 597460 KB Output is correct
8 Correct 1234 ms 637056 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 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 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 3 ms 504 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 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 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 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 1272 KB Output is correct
18 Correct 6 ms 1272 KB Output is correct
19 Correct 6 ms 1400 KB Output is correct
20 Correct 5 ms 1272 KB Output is correct
21 Correct 6 ms 1400 KB Output is correct
22 Correct 7 ms 1404 KB Output is correct
23 Correct 6 ms 1404 KB Output is correct
24 Correct 4 ms 888 KB Output is correct
25 Correct 29 ms 6660 KB Output is correct
26 Correct 29 ms 6648 KB Output is correct
27 Correct 29 ms 6648 KB Output is correct
28 Correct 19 ms 6008 KB Output is correct
29 Correct 32 ms 7420 KB Output is correct
30 Correct 32 ms 7544 KB Output is correct
31 Correct 31 ms 7248 KB Output is correct
32 Correct 32 ms 7172 KB Output is correct
33 Correct 231 ms 64632 KB Output is correct
34 Correct 235 ms 70904 KB Output is correct
35 Correct 231 ms 70952 KB Output is correct
36 Correct 231 ms 77144 KB Output is correct
37 Correct 423 ms 78896 KB Output is correct
38 Correct 422 ms 78852 KB Output is correct
39 Correct 440 ms 78948 KB Output is correct
40 Correct 394 ms 73964 KB Output is correct
41 Correct 200 ms 63708 KB Output is correct
42 Correct 245 ms 69624 KB Output is correct
43 Correct 420 ms 88568 KB Output is correct
44 Correct 447 ms 88824 KB Output is correct
45 Correct 206 ms 44536 KB Output is correct
46 Correct 202 ms 44376 KB Output is correct
47 Correct 405 ms 85624 KB Output is correct
48 Correct 402 ms 85748 KB Output is correct
49 Correct 6 ms 1400 KB Output is correct
50 Correct 6 ms 1272 KB Output is correct
51 Correct 3 ms 1144 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 6 ms 1400 KB Output is correct
54 Correct 6 ms 1400 KB Output is correct
55 Correct 6 ms 1400 KB Output is correct
56 Correct 5 ms 1400 KB Output is correct
57 Correct 6 ms 1400 KB Output is correct
58 Correct 3 ms 636 KB Output is correct
59 Correct 4 ms 1016 KB Output is correct
60 Correct 2 ms 256 KB Output is correct
61 Correct 1280 ms 370532 KB Output is correct
62 Correct 2916 ms 803748 KB Output is correct
63 Correct 2953 ms 807608 KB Output is correct
64 Correct 2949 ms 807992 KB Output is correct
65 Correct 585 ms 314796 KB Output is correct
66 Correct 1198 ms 597460 KB Output is correct
67 Correct 1234 ms 637056 KB Output is correct
68 Correct 3150 ms 818724 KB Output is correct
69 Correct 3461 ms 898208 KB Output is correct
70 Correct 3686 ms 898680 KB Output is correct
71 Correct 3695 ms 979320 KB Output is correct
72 Execution timed out 5145 ms 999284 KB Time limit exceeded
73 Halted 0 ms 0 KB -