oj.uz

Submission #144035

# Submission time Handle Problem Language Result Execution time Memory
144035 2019-08-15T18:16:24 Z Kanon Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 1001608 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);
  }
  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);
  }
  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 3 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 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 3 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 2 ms 504 KB Output is correct
13 Correct 2 ms 376 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 256 KB Output is correct
17 Correct 2 ms 252 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 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 3 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 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 3 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 2 ms 504 KB Output is correct
13 Correct 2 ms 376 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 256 KB Output is correct
17 Correct 10 ms 1400 KB Output is correct
18 Correct 6 ms 1400 KB Output is correct
19 Correct 6 ms 1400 KB Output is correct
20 Correct 5 ms 1144 KB Output is correct
21 Correct 6 ms 1400 KB Output is correct
22 Correct 7 ms 1400 KB Output is correct
23 Correct 7 ms 1400 KB Output is correct
24 Correct 4 ms 888 KB Output is correct
25 Correct 2 ms 252 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 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 3 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 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 3 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 2 ms 504 KB Output is correct
13 Correct 2 ms 376 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 256 KB Output is correct
17 Correct 10 ms 1400 KB Output is correct
18 Correct 6 ms 1400 KB Output is correct
19 Correct 6 ms 1400 KB Output is correct
20 Correct 5 ms 1144 KB Output is correct
21 Correct 6 ms 1400 KB Output is correct
22 Correct 7 ms 1400 KB Output is correct
23 Correct 7 ms 1400 KB Output is correct
24 Correct 4 ms 888 KB Output is correct
25 Correct 28 ms 6648 KB Output is correct
26 Correct 29 ms 6648 KB Output is correct
27 Correct 32 ms 6648 KB Output is correct
28 Correct 21 ms 6008 KB Output is correct
29 Correct 31 ms 7416 KB Output is correct
30 Correct 31 ms 7548 KB Output is correct
31 Correct 30 ms 7288 KB Output is correct
32 Correct 31 ms 7160 KB Output is correct
33 Correct 2 ms 252 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 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 3 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 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 3 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 2 ms 504 KB Output is correct
13 Correct 2 ms 376 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 256 KB Output is correct
17 Correct 10 ms 1400 KB Output is correct
18 Correct 6 ms 1400 KB Output is correct
19 Correct 6 ms 1400 KB Output is correct
20 Correct 5 ms 1144 KB Output is correct
21 Correct 6 ms 1400 KB Output is correct
22 Correct 7 ms 1400 KB Output is correct
23 Correct 7 ms 1400 KB Output is correct
24 Correct 4 ms 888 KB Output is correct
25 Correct 28 ms 6648 KB Output is correct
26 Correct 29 ms 6648 KB Output is correct
27 Correct 32 ms 6648 KB Output is correct
28 Correct 21 ms 6008 KB Output is correct
29 Correct 31 ms 7416 KB Output is correct
30 Correct 31 ms 7548 KB Output is correct
31 Correct 30 ms 7288 KB Output is correct
32 Correct 31 ms 7160 KB Output is correct
33 Correct 227 ms 64796 KB Output is correct
34 Correct 228 ms 70904 KB Output is correct
35 Correct 238 ms 71032 KB Output is correct
36 Correct 232 ms 77060 KB Output is correct
37 Correct 421 ms 78840 KB Output is correct
38 Correct 431 ms 78836 KB Output is correct
39 Correct 424 ms 79052 KB Output is correct
40 Correct 395 ms 73976 KB Output is correct
41 Correct 195 ms 63716 KB Output is correct
42 Correct 245 ms 69428 KB Output is correct
43 Correct 412 ms 88472 KB Output is correct
44 Correct 422 ms 88764 KB Output is correct
45 Correct 207 ms 44664 KB Output is correct
46 Correct 205 ms 44572 KB Output is correct
47 Correct 409 ms 85496 KB Output is correct
48 Correct 402 ms 85664 KB Output is correct
49 Correct 2 ms 252 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 256 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1272 KB Output is correct
2 Correct 5 ms 1144 KB Output is correct
3 Correct 3 ms 1016 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 1404 KB Output is correct
7 Correct 6 ms 1400 KB Output is correct
8 Correct 6 ms 1400 KB Output is correct
9 Correct 5 ms 1400 KB Output is correct
10 Correct 3 ms 760 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 376 KB Output is correct
2 Correct 1296 ms 370460 KB Output is correct
3 Correct 2916 ms 803832 KB Output is correct
4 Correct 2948 ms 807584 KB Output is correct
5 Correct 2993 ms 807952 KB Output is correct
6 Correct 595 ms 314616 KB Output is correct
7 Correct 1170 ms 597624 KB Output is correct
8 Correct 1308 ms 637096 KB Output is correct
9 Correct 2 ms 252 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 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 3 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 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 3 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 2 ms 504 KB Output is correct
13 Correct 2 ms 376 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 256 KB Output is correct
17 Correct 10 ms 1400 KB Output is correct
18 Correct 6 ms 1400 KB Output is correct
19 Correct 6 ms 1400 KB Output is correct
20 Correct 5 ms 1144 KB Output is correct
21 Correct 6 ms 1400 KB Output is correct
22 Correct 7 ms 1400 KB Output is correct
23 Correct 7 ms 1400 KB Output is correct
24 Correct 4 ms 888 KB Output is correct
25 Correct 28 ms 6648 KB Output is correct
26 Correct 29 ms 6648 KB Output is correct
27 Correct 32 ms 6648 KB Output is correct
28 Correct 21 ms 6008 KB Output is correct
29 Correct 31 ms 7416 KB Output is correct
30 Correct 31 ms 7548 KB Output is correct
31 Correct 30 ms 7288 KB Output is correct
32 Correct 31 ms 7160 KB Output is correct
33 Correct 227 ms 64796 KB Output is correct
34 Correct 228 ms 70904 KB Output is correct
35 Correct 238 ms 71032 KB Output is correct
36 Correct 232 ms 77060 KB Output is correct
37 Correct 421 ms 78840 KB Output is correct
38 Correct 431 ms 78836 KB Output is correct
39 Correct 424 ms 79052 KB Output is correct
40 Correct 395 ms 73976 KB Output is correct
41 Correct 195 ms 63716 KB Output is correct
42 Correct 245 ms 69428 KB Output is correct
43 Correct 412 ms 88472 KB Output is correct
44 Correct 422 ms 88764 KB Output is correct
45 Correct 207 ms 44664 KB Output is correct
46 Correct 205 ms 44572 KB Output is correct
47 Correct 409 ms 85496 KB Output is correct
48 Correct 402 ms 85664 KB Output is correct
49 Correct 6 ms 1272 KB Output is correct
50 Correct 5 ms 1144 KB Output is correct
51 Correct 3 ms 1016 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 1404 KB Output is correct
55 Correct 6 ms 1400 KB Output is correct
56 Correct 6 ms 1400 KB Output is correct
57 Correct 5 ms 1400 KB Output is correct
58 Correct 3 ms 760 KB Output is correct
59 Correct 4 ms 1016 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 1296 ms 370460 KB Output is correct
62 Correct 2916 ms 803832 KB Output is correct
63 Correct 2948 ms 807584 KB Output is correct
64 Correct 2993 ms 807952 KB Output is correct
65 Correct 595 ms 314616 KB Output is correct
66 Correct 1170 ms 597624 KB Output is correct
67 Correct 1308 ms 637096 KB Output is correct
68 Correct 3087 ms 817460 KB Output is correct
69 Correct 3064 ms 899960 KB Output is correct
70 Correct 3804 ms 898276 KB Output is correct
71 Correct 3708 ms 979108 KB Output is correct
72 Execution timed out 5158 ms 1001608 KB Time limit exceeded
73 Halted 0 ms 0 KB -