oj.uz

Submission #144029

# Submission time Handle Problem Language Result Execution time Memory
144029 2019-08-15T17:31:44 Z Kanon Rectangles (IOI19_rect) C++14
72 / 100
 3137 ms 1048576 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--)

const int N = 2505;

set<pair<int, int>> hp[N][N], vs[N][N];

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;
  };
  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);
    }
    sort(sy.begin(), sy.end());
    reverse(sy.begin(), sy.end());
    ordered_set cur;
    auto it = x.begin();
    int p = sy.size() - 1;
    while(it != x.end()) {
      while(~p && sy[p].first <= it->first) {
        cur.insert(sy[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 533 ms 589796 KB Output is correct
2 Correct 535 ms 589832 KB Output is correct
3 Correct 538 ms 589864 KB Output is correct
4 Correct 550 ms 589816 KB Output is correct
5 Correct 556 ms 589888 KB Output is correct
6 Correct 556 ms 589864 KB Output is correct
7 Correct 540 ms 589836 KB Output is correct
8 Correct 532 ms 589824 KB Output is correct
9 Correct 535 ms 589820 KB Output is correct
10 Correct 536 ms 589788 KB Output is correct
11 Correct 537 ms 589944 KB Output is correct
12 Correct 566 ms 589920 KB Output is correct
13 Correct 539 ms 589688 KB Output is correct
14 Correct 533 ms 589976 KB Output is correct
15 Correct 534 ms 589816 KB Output is correct
16 Correct 591 ms 589764 KB Output is correct
17 Correct 536 ms 589916 KB Output is correct
18 Correct 533 ms 589816 KB Output is correct
19 Correct 536 ms 589824 KB Output is correct
20 Correct 536 ms 589676 KB Output is correct
21 Correct 535 ms 589872 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 533 ms 589796 KB Output is correct
2 Correct 535 ms 589832 KB Output is correct
3 Correct 538 ms 589864 KB Output is correct
4 Correct 550 ms 589816 KB Output is correct
5 Correct 556 ms 589888 KB Output is correct
6 Correct 556 ms 589864 KB Output is correct
7 Correct 540 ms 589836 KB Output is correct
8 Correct 532 ms 589824 KB Output is correct
9 Correct 535 ms 589820 KB Output is correct
10 Correct 536 ms 589788 KB Output is correct
11 Correct 537 ms 589944 KB Output is correct
12 Correct 566 ms 589920 KB Output is correct
13 Correct 539 ms 589688 KB Output is correct
14 Correct 533 ms 589976 KB Output is correct
15 Correct 534 ms 589816 KB Output is correct
16 Correct 591 ms 589764 KB Output is correct
17 Correct 537 ms 590456 KB Output is correct
18 Correct 538 ms 590424 KB Output is correct
19 Correct 544 ms 590472 KB Output is correct
20 Correct 536 ms 590072 KB Output is correct
21 Correct 543 ms 590492 KB Output is correct
22 Correct 541 ms 590328 KB Output is correct
23 Correct 542 ms 590328 KB Output is correct
24 Correct 536 ms 590072 KB Output is correct
25 Correct 536 ms 589916 KB Output is correct
26 Correct 533 ms 589816 KB Output is correct
27 Correct 536 ms 589824 KB Output is correct
28 Correct 536 ms 589676 KB Output is correct
29 Correct 535 ms 589872 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 533 ms 589796 KB Output is correct
2 Correct 535 ms 589832 KB Output is correct
3 Correct 538 ms 589864 KB Output is correct
4 Correct 550 ms 589816 KB Output is correct
5 Correct 556 ms 589888 KB Output is correct
6 Correct 556 ms 589864 KB Output is correct
7 Correct 540 ms 589836 KB Output is correct
8 Correct 532 ms 589824 KB Output is correct
9 Correct 535 ms 589820 KB Output is correct
10 Correct 536 ms 589788 KB Output is correct
11 Correct 537 ms 589944 KB Output is correct
12 Correct 566 ms 589920 KB Output is correct
13 Correct 539 ms 589688 KB Output is correct
14 Correct 533 ms 589976 KB Output is correct
15 Correct 534 ms 589816 KB Output is correct
16 Correct 591 ms 589764 KB Output is correct
17 Correct 537 ms 590456 KB Output is correct
18 Correct 538 ms 590424 KB Output is correct
19 Correct 544 ms 590472 KB Output is correct
20 Correct 536 ms 590072 KB Output is correct
21 Correct 543 ms 590492 KB Output is correct
22 Correct 541 ms 590328 KB Output is correct
23 Correct 542 ms 590328 KB Output is correct
24 Correct 536 ms 590072 KB Output is correct
25 Correct 555 ms 593944 KB Output is correct
26 Correct 557 ms 593924 KB Output is correct
27 Correct 554 ms 593848 KB Output is correct
28 Correct 544 ms 591536 KB Output is correct
29 Correct 558 ms 593656 KB Output is correct
30 Correct 574 ms 593656 KB Output is correct
31 Correct 573 ms 593528 KB Output is correct
32 Correct 555 ms 593440 KB Output is correct
33 Correct 536 ms 589916 KB Output is correct
34 Correct 533 ms 589816 KB Output is correct
35 Correct 536 ms 589824 KB Output is correct
36 Correct 536 ms 589676 KB Output is correct
37 Correct 535 ms 589872 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 533 ms 589796 KB Output is correct
2 Correct 535 ms 589832 KB Output is correct
3 Correct 538 ms 589864 KB Output is correct
4 Correct 550 ms 589816 KB Output is correct
5 Correct 556 ms 589888 KB Output is correct
6 Correct 556 ms 589864 KB Output is correct
7 Correct 540 ms 589836 KB Output is correct
8 Correct 532 ms 589824 KB Output is correct
9 Correct 535 ms 589820 KB Output is correct
10 Correct 536 ms 589788 KB Output is correct
11 Correct 537 ms 589944 KB Output is correct
12 Correct 566 ms 589920 KB Output is correct
13 Correct 539 ms 589688 KB Output is correct
14 Correct 533 ms 589976 KB Output is correct
15 Correct 534 ms 589816 KB Output is correct
16 Correct 591 ms 589764 KB Output is correct
17 Correct 537 ms 590456 KB Output is correct
18 Correct 538 ms 590424 KB Output is correct
19 Correct 544 ms 590472 KB Output is correct
20 Correct 536 ms 590072 KB Output is correct
21 Correct 543 ms 590492 KB Output is correct
22 Correct 541 ms 590328 KB Output is correct
23 Correct 542 ms 590328 KB Output is correct
24 Correct 536 ms 590072 KB Output is correct
25 Correct 555 ms 593944 KB Output is correct
26 Correct 557 ms 593924 KB Output is correct
27 Correct 554 ms 593848 KB Output is correct
28 Correct 544 ms 591536 KB Output is correct
29 Correct 558 ms 593656 KB Output is correct
30 Correct 574 ms 593656 KB Output is correct
31 Correct 573 ms 593528 KB Output is correct
32 Correct 555 ms 593440 KB Output is correct
33 Correct 707 ms 616724 KB Output is correct
34 Correct 690 ms 616796 KB Output is correct
35 Correct 711 ms 616568 KB Output is correct
36 Correct 682 ms 616696 KB Output is correct
37 Correct 916 ms 639596 KB Output is correct
38 Correct 901 ms 639736 KB Output is correct
39 Correct 904 ms 639624 KB Output is correct
40 Correct 884 ms 636340 KB Output is correct
41 Correct 765 ms 605176 KB Output is correct
42 Correct 682 ms 611576 KB Output is correct
43 Correct 838 ms 638332 KB Output is correct
44 Correct 849 ms 638840 KB Output is correct
45 Correct 694 ms 614164 KB Output is correct
46 Correct 700 ms 614240 KB Output is correct
47 Correct 835 ms 635256 KB Output is correct
48 Correct 831 ms 635384 KB Output is correct
49 Correct 536 ms 589916 KB Output is correct
50 Correct 533 ms 589816 KB Output is correct
51 Correct 536 ms 589824 KB Output is correct
52 Correct 536 ms 589676 KB Output is correct
53 Correct 535 ms 589872 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 541 ms 590292 KB Output is correct
2 Correct 538 ms 590328 KB Output is correct
3 Correct 565 ms 589816 KB Output is correct
4 Correct 533 ms 589816 KB Output is correct
5 Correct 536 ms 590272 KB Output is correct
6 Correct 539 ms 590396 KB Output is correct
7 Correct 537 ms 590260 KB Output is correct
8 Correct 553 ms 590204 KB Output is correct
9 Correct 546 ms 590316 KB Output is correct
10 Correct 540 ms 590072 KB Output is correct
11 Correct 562 ms 590128 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 539 ms 589768 KB Output is correct
2 Correct 1201 ms 679564 KB Output is correct
3 Correct 2044 ms 784540 KB Output is correct
4 Correct 2075 ms 785624 KB Output is correct
5 Correct 2075 ms 785520 KB Output is correct
6 Correct 744 ms 614276 KB Output is correct
7 Correct 922 ms 635900 KB Output is correct
8 Correct 966 ms 638868 KB Output is correct
9 Correct 536 ms 589916 KB Output is correct
10 Correct 533 ms 589816 KB Output is correct
11 Correct 536 ms 589824 KB Output is correct
12 Correct 536 ms 589676 KB Output is correct
13 Correct 535 ms 589872 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 533 ms 589796 KB Output is correct
2 Correct 535 ms 589832 KB Output is correct
3 Correct 538 ms 589864 KB Output is correct
4 Correct 550 ms 589816 KB Output is correct
5 Correct 556 ms 589888 KB Output is correct
6 Correct 556 ms 589864 KB Output is correct
7 Correct 540 ms 589836 KB Output is correct
8 Correct 532 ms 589824 KB Output is correct
9 Correct 535 ms 589820 KB Output is correct
10 Correct 536 ms 589788 KB Output is correct
11 Correct 537 ms 589944 KB Output is correct
12 Correct 566 ms 589920 KB Output is correct
13 Correct 539 ms 589688 KB Output is correct
14 Correct 533 ms 589976 KB Output is correct
15 Correct 534 ms 589816 KB Output is correct
16 Correct 591 ms 589764 KB Output is correct
17 Correct 537 ms 590456 KB Output is correct
18 Correct 538 ms 590424 KB Output is correct
19 Correct 544 ms 590472 KB Output is correct
20 Correct 536 ms 590072 KB Output is correct
21 Correct 543 ms 590492 KB Output is correct
22 Correct 541 ms 590328 KB Output is correct
23 Correct 542 ms 590328 KB Output is correct
24 Correct 536 ms 590072 KB Output is correct
25 Correct 555 ms 593944 KB Output is correct
26 Correct 557 ms 593924 KB Output is correct
27 Correct 554 ms 593848 KB Output is correct
28 Correct 544 ms 591536 KB Output is correct
29 Correct 558 ms 593656 KB Output is correct
30 Correct 574 ms 593656 KB Output is correct
31 Correct 573 ms 593528 KB Output is correct
32 Correct 555 ms 593440 KB Output is correct
33 Correct 707 ms 616724 KB Output is correct
34 Correct 690 ms 616796 KB Output is correct
35 Correct 711 ms 616568 KB Output is correct
36 Correct 682 ms 616696 KB Output is correct
37 Correct 916 ms 639596 KB Output is correct
38 Correct 901 ms 639736 KB Output is correct
39 Correct 904 ms 639624 KB Output is correct
40 Correct 884 ms 636340 KB Output is correct
41 Correct 765 ms 605176 KB Output is correct
42 Correct 682 ms 611576 KB Output is correct
43 Correct 838 ms 638332 KB Output is correct
44 Correct 849 ms 638840 KB Output is correct
45 Correct 694 ms 614164 KB Output is correct
46 Correct 700 ms 614240 KB Output is correct
47 Correct 835 ms 635256 KB Output is correct
48 Correct 831 ms 635384 KB Output is correct
49 Correct 541 ms 590292 KB Output is correct
50 Correct 538 ms 590328 KB Output is correct
51 Correct 565 ms 589816 KB Output is correct
52 Correct 533 ms 589816 KB Output is correct
53 Correct 536 ms 590272 KB Output is correct
54 Correct 539 ms 590396 KB Output is correct
55 Correct 537 ms 590260 KB Output is correct
56 Correct 553 ms 590204 KB Output is correct
57 Correct 546 ms 590316 KB Output is correct
58 Correct 540 ms 590072 KB Output is correct
59 Correct 562 ms 590128 KB Output is correct
60 Correct 539 ms 589768 KB Output is correct
61 Correct 1201 ms 679564 KB Output is correct
62 Correct 2044 ms 784540 KB Output is correct
63 Correct 2075 ms 785624 KB Output is correct
64 Correct 2075 ms 785520 KB Output is correct
65 Correct 744 ms 614276 KB Output is correct
66 Correct 922 ms 635900 KB Output is correct
67 Correct 966 ms 638868 KB Output is correct
68 Correct 2965 ms 932452 KB Output is correct
69 Correct 2775 ms 932616 KB Output is correct
70 Correct 2750 ms 932344 KB Output is correct
71 Correct 2502 ms 932304 KB Output is correct
72 Runtime error 3137 ms 1048576 KB Execution killed with signal 9 (could be triggered by violating memory limits)
73 Halted 0 ms 0 KB -