oj.uz

Submission #144025

# Submission time Handle Problem Language Result Execution time Memory
144025 2019-08-15T17:16:38 Z Kanon Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 930188 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<int, int>>>> hp, vs;
  hp.resize(n); for(auto &i : hp) i.resize(m);
  vs.resize(n); for(auto &i : vs) 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<int, int> 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(i, 0, m) {
    vector<int> ss(n);
    range(j, 0, n) ss[j] = a[j][i];
    vector<pair<int, int>> foo = pos(ss);
    for(auto u : foo) {
      int l = u.first, r = u.second;
      pair<int, int> 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);
    }
  }
  long long res = 0;
  auto cnt = [&](set<pair<int, int>> &x, set<pair<int, int>> &y) {
    vector<pair<int, int>> sy;
    for(auto i : y) {
      swap(i.first, i.second);
      sy.push_back(i);
    }
    for(auto u : x) {
      for(auto v : sy) {
        if(u.second <= v.second && v.first <= u.first) res++;
      }
    }
    return;
    sort(sy.begin(), sy.end());
    reverse(sy.begin(), sy.end());
    ordered_set cur;
    auto it = x.end();
    int p = sy.size() - 1;
    while(it != x.begin()) {
      it--;
      while(~p && sy[p].first <= it->first) {
        cur.insert(sy[p].second);
        p--;
      }
      res += cur.order_of_key(it->second - 1);
    }
  };
  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 256 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 508 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 492 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 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 376 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 256 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 508 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 492 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 1528 KB Output is correct
18 Correct 6 ms 1528 KB Output is correct
19 Correct 5 ms 1528 KB Output is correct
20 Correct 4 ms 1244 KB Output is correct
21 Correct 5 ms 1528 KB Output is correct
22 Correct 5 ms 1528 KB Output is correct
23 Correct 5 ms 1528 KB Output is correct
24 Correct 3 ms 892 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 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 256 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 508 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 492 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 1528 KB Output is correct
18 Correct 6 ms 1528 KB Output is correct
19 Correct 5 ms 1528 KB Output is correct
20 Correct 4 ms 1244 KB Output is correct
21 Correct 5 ms 1528 KB Output is correct
22 Correct 5 ms 1528 KB Output is correct
23 Correct 5 ms 1528 KB Output is correct
24 Correct 3 ms 892 KB Output is correct
25 Correct 27 ms 8112 KB Output is correct
26 Correct 26 ms 8056 KB Output is correct
27 Correct 26 ms 8056 KB Output is correct
28 Correct 13 ms 5880 KB Output is correct
29 Correct 25 ms 7928 KB Output is correct
30 Correct 25 ms 7928 KB Output is correct
31 Correct 24 ms 7800 KB Output is correct
32 Correct 23 ms 7672 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 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 256 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 508 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 492 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 1528 KB Output is correct
18 Correct 6 ms 1528 KB Output is correct
19 Correct 5 ms 1528 KB Output is correct
20 Correct 4 ms 1244 KB Output is correct
21 Correct 5 ms 1528 KB Output is correct
22 Correct 5 ms 1528 KB Output is correct
23 Correct 5 ms 1528 KB Output is correct
24 Correct 3 ms 892 KB Output is correct
25 Correct 27 ms 8112 KB Output is correct
26 Correct 26 ms 8056 KB Output is correct
27 Correct 26 ms 8056 KB Output is correct
28 Correct 13 ms 5880 KB Output is correct
29 Correct 25 ms 7928 KB Output is correct
30 Correct 25 ms 7928 KB Output is correct
31 Correct 24 ms 7800 KB Output is correct
32 Correct 23 ms 7672 KB Output is correct
33 Correct 264 ms 73220 KB Output is correct
34 Correct 174 ms 73208 KB Output is correct
35 Correct 182 ms 73208 KB Output is correct
36 Correct 159 ms 73336 KB Output is correct
37 Correct 401 ms 96200 KB Output is correct
38 Correct 402 ms 96120 KB Output is correct
39 Correct 402 ms 96120 KB Output is correct
40 Correct 382 ms 89976 KB Output is correct
41 Correct 132 ms 61768 KB Output is correct
42 Correct 166 ms 68088 KB Output is correct
43 Correct 308 ms 95096 KB Output is correct
44 Correct 312 ms 95560 KB Output is correct
45 Correct 157 ms 47864 KB Output is correct
46 Correct 156 ms 47736 KB Output is correct
47 Correct 325 ms 91800 KB Output is correct
48 Correct 297 ms 91896 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 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 6 ms 1528 KB Output is correct
2 Correct 5 ms 1400 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 5 ms 1400 KB Output is correct
6 Correct 5 ms 1400 KB Output is correct
7 Correct 5 ms 1400 KB Output is correct
8 Correct 5 ms 1532 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 1144 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 823 ms 359388 KB Output is correct
3 Correct 1862 ms 779312 KB Output is correct
4 Correct 1842 ms 783060 KB Output is correct
5 Correct 1845 ms 783352 KB Output is correct
6 Correct 366 ms 314488 KB Output is correct
7 Correct 735 ms 597432 KB Output is correct
8 Correct 777 ms 636948 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 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 256 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 508 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 492 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 1528 KB Output is correct
18 Correct 6 ms 1528 KB Output is correct
19 Correct 5 ms 1528 KB Output is correct
20 Correct 4 ms 1244 KB Output is correct
21 Correct 5 ms 1528 KB Output is correct
22 Correct 5 ms 1528 KB Output is correct
23 Correct 5 ms 1528 KB Output is correct
24 Correct 3 ms 892 KB Output is correct
25 Correct 27 ms 8112 KB Output is correct
26 Correct 26 ms 8056 KB Output is correct
27 Correct 26 ms 8056 KB Output is correct
28 Correct 13 ms 5880 KB Output is correct
29 Correct 25 ms 7928 KB Output is correct
30 Correct 25 ms 7928 KB Output is correct
31 Correct 24 ms 7800 KB Output is correct
32 Correct 23 ms 7672 KB Output is correct
33 Correct 264 ms 73220 KB Output is correct
34 Correct 174 ms 73208 KB Output is correct
35 Correct 182 ms 73208 KB Output is correct
36 Correct 159 ms 73336 KB Output is correct
37 Correct 401 ms 96200 KB Output is correct
38 Correct 402 ms 96120 KB Output is correct
39 Correct 402 ms 96120 KB Output is correct
40 Correct 382 ms 89976 KB Output is correct
41 Correct 132 ms 61768 KB Output is correct
42 Correct 166 ms 68088 KB Output is correct
43 Correct 308 ms 95096 KB Output is correct
44 Correct 312 ms 95560 KB Output is correct
45 Correct 157 ms 47864 KB Output is correct
46 Correct 156 ms 47736 KB Output is correct
47 Correct 325 ms 91800 KB Output is correct
48 Correct 297 ms 91896 KB Output is correct
49 Correct 6 ms 1528 KB Output is correct
50 Correct 5 ms 1400 KB Output is correct
51 Correct 3 ms 1016 KB Output is correct
52 Correct 2 ms 256 KB Output is correct
53 Correct 5 ms 1400 KB Output is correct
54 Correct 5 ms 1400 KB Output is correct
55 Correct 5 ms 1400 KB Output is correct
56 Correct 5 ms 1532 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 1144 KB Output is correct
60 Correct 2 ms 252 KB Output is correct
61 Correct 823 ms 359388 KB Output is correct
62 Correct 1862 ms 779312 KB Output is correct
63 Correct 1842 ms 783060 KB Output is correct
64 Correct 1845 ms 783352 KB Output is correct
65 Correct 366 ms 314488 KB Output is correct
66 Correct 735 ms 597432 KB Output is correct
67 Correct 777 ms 636948 KB Output is correct
68 Execution timed out 5085 ms 930188 KB Time limit exceeded
69 Halted 0 ms 0 KB -