oj.uz

Submission #265372

# Submission time Handle Problem Language Result Execution time Memory
265372 2020-08-14T16:48:44 Z hamerin Rectangles (IOI19_rect) C++17
100 / 100
 4331 ms 662312 KB 
#include "rect.h"

#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;

using i64 = long long;
using d64 = long double;
using pi = pair<int, int>;
using pli = pair<i64, i64>;
using ti = tuple<int, int, int>;
using tli = tuple<i64, i64, i64>;

#define iterall(cont) cont.begin(), cont.end()
#define prec(n) setprecision(n) << fixed

vector<pi> findLegalTuple(const vector<int> &v) {
    vector<pi> ret;
    vector<size_t> seq;  // monotonic
    size_t sn = 0;

    for (size_t i = 0; i < v.size(); i++) {
        while (sn >= 1 && v[seq[sn - 1]] < v[i]) {
            seq.pop_back(), --sn;
            if (sn >= 1 && i - seq[sn - 1] >= 2)
                ret.emplace_back(seq[sn - 1], i);
        }
        if (sn >= 1 && v[seq[sn - 1]] == v[i]) seq.pop_back(), --sn;

        seq.emplace_back(i), ++sn;
    }

    return ret;
}

// 이거 N^3이라서 쫌 이따 바꿔야지
vector<pi> getMaxPos(const vector<int> &v) {
    size_t N = v.size();
    vector<pi> ret(N, {-1, -1});

    {
        vector<int> seq;  // monotone
        size_t sn = 0;
        for (int i = 0; i < N; i++) {
            while (sn >= 1 && v[seq[sn - 1]] < v[i]) {
                ret[seq[sn - 1]].second = i;
                seq.pop_back(), --sn;
            }
            seq.emplace_back(i), ++sn;
        }
    }

    {
        vector<int> seq;  // monotone
        size_t sn = 0;
        for (int i = N - 1; i >= 0; i--) {
            while (sn >= 1 && v[seq[sn - 1]] < v[i]) {
                ret[seq[sn - 1]].first = i;
                seq.pop_back(), --sn;
            }
            seq.emplace_back(i), ++sn;
        }
    }

    return ret;
}

vector<pi> processToIntervals(const vector<pi> &v) {
    vector<pi> ret;

    for (auto [el, _] : v) {
        if (!ret.empty() && ret.back().second == el - 1)
            ret.back().second++;
        else
            ret.emplace_back(el, el);
    }

    return ret;
}

bool intervalBinarySearch(const vector<pi> &v, pi t) {
    if (v.empty()) return false;

    const size_t N = v.size();

    int r1 = -1;
    {
        size_t s = 0, e = N - 1;

        while (e - s >= 2) {
            size_t m = (s + e) >> 1;
            if (v[m].first <= t.first && t.first <= v[m].second) {
                r1 = m;
                break;
            }

            if (v[m].second < t.first) s = m + 1;
            else e = m - 1;
        }

        if (v[s].first <= t.first && t.first <= v[s].second) r1 = s;
        if (v[e].first <= t.first && t.first <= v[e].second) r1 = e;
    }

    if (r1 == -1) return false;
    return v[r1].first <= t.second && t.second <= v[r1].second;
}

i64 _hs(i64 a, i64 b, i64 c, i64 d) {
    return (a << 48) + (b << 32) + (c << 16) + d;
}

i64 count_rectangles(vector<vector<int>> a) {
    const size_t N = a.size();
    const size_t M = a[0].size();

    // transpose
    vector<vector<int>> b(M, vector<int>(N));
    for (int i = 0; i < N; i++)
        for (int j = 0; j < M; j++) b[j][i] = a[i][j];

    // get Max Position
    vector<vector<pi>> aM(N, vector<pi>(M));
    vector<vector<pi>> bM(M, vector<pi>(N));

    for (int i = 0; i < N; i++) aM[i] = getMaxPos(a[i]);
    for (int i = 0; i < M; i++) bM[i] = getMaxPos(b[i]);

    // find Legal Tuple && assign
    vector<vector<vector<pi>>> aL(M, decltype(aL)::value_type(M));
    vector<vector<vector<pi>>> bL(N, decltype(bL)::value_type(N));

    for (int i = 0; i < N; i++) {
        auto Lg = findLegalTuple(a[i]);
        for (auto [l, r] : Lg) aL[l][r].emplace_back(i, 0);
    }
    for (int i = 0; i < M; i++) {
        auto Lg = findLegalTuple(b[i]);
        for (auto [l, r] : Lg) bL[l][r].emplace_back(i, 0);
    }

    for (auto &vec : aL)
        for (auto &el : vec) el = processToIntervals(el);
    for (auto &vec : bL)
        for (auto &el : vec) el = processToIntervals(el);

    // Main Logic
    vector<i64> us;

    for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
            auto [L, R] = aM[i][j];
            auto [T, B] = bM[j][i];
            auto H = _hs(L, R, T, B);
            if (L == -1 || R == -1 || T == -1 || B == -1) continue;

            if (intervalBinarySearch(aL[L][R], {T + 1, B - 1}) &&
                intervalBinarySearch(bL[T][B], {L + 1, R - 1}))
                us.emplace_back(H);
        }
    }

    sort(iterall(us));
    us.erase(unique(iterall(us)), us.end());

    return us.size();
}

Compilation message

rect.cpp: In function 'std::vector<std::pair<int, int> > getMaxPos(const std::vector<int>&)':
rect.cpp:47:27: warning: comparison of integer expressions of different signedness: 'int' and 'size_t' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for (int i = 0; i < N; i++) {
      |                         ~~^~~
rect.cpp: In function 'i64 count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:122:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  122 |     for (int i = 0; i < N; i++)
      |                     ~~^~~
rect.cpp:123:27: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  123 |         for (int j = 0; j < M; j++) b[j][i] = a[i][j];
      |                         ~~^~~
rect.cpp:129:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  129 |     for (int i = 0; i < N; i++) aM[i] = getMaxPos(a[i]);
      |                     ~~^~~
rect.cpp:130:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  130 |     for (int i = 0; i < M; i++) bM[i] = getMaxPos(b[i]);
      |                     ~~^~~
rect.cpp:136:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  136 |     for (int i = 0; i < N; i++) {
      |                     ~~^~~
rect.cpp:140:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  140 |     for (int i = 0; i < M; i++) {
      |                     ~~^~~
rect.cpp:153:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  153 |     for (int i = 0; i < N; i++) {
      |                     ~~^~~
rect.cpp:154:27: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  154 |         for (int j = 0; j < M; j++) {
      |                         ~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 256 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 3 ms 1024 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 3 ms 1024 KB Output is correct
20 Correct 3 ms 896 KB Output is correct
21 Correct 4 ms 1024 KB Output is correct
22 Correct 4 ms 1024 KB Output is correct
23 Correct 4 ms 1024 KB Output is correct
24 Correct 3 ms 768 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 256 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 3 ms 1024 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 3 ms 1024 KB Output is correct
20 Correct 3 ms 896 KB Output is correct
21 Correct 4 ms 1024 KB Output is correct
22 Correct 4 ms 1024 KB Output is correct
23 Correct 4 ms 1024 KB Output is correct
24 Correct 3 ms 768 KB Output is correct
25 Correct 14 ms 4664 KB Output is correct
26 Correct 14 ms 4664 KB Output is correct
27 Correct 13 ms 4664 KB Output is correct
28 Correct 13 ms 3968 KB Output is correct
29 Correct 23 ms 4736 KB Output is correct
30 Correct 24 ms 4856 KB Output is correct
31 Correct 20 ms 4864 KB Output is correct
32 Correct 19 ms 4736 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 0 ms 256 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 3 ms 1024 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 3 ms 1024 KB Output is correct
20 Correct 3 ms 896 KB Output is correct
21 Correct 4 ms 1024 KB Output is correct
22 Correct 4 ms 1024 KB Output is correct
23 Correct 4 ms 1024 KB Output is correct
24 Correct 3 ms 768 KB Output is correct
25 Correct 14 ms 4664 KB Output is correct
26 Correct 14 ms 4664 KB Output is correct
27 Correct 13 ms 4664 KB Output is correct
28 Correct 13 ms 3968 KB Output is correct
29 Correct 23 ms 4736 KB Output is correct
30 Correct 24 ms 4856 KB Output is correct
31 Correct 20 ms 4864 KB Output is correct
32 Correct 19 ms 4736 KB Output is correct
33 Correct 146 ms 55416 KB Output is correct
34 Correct 145 ms 55544 KB Output is correct
35 Correct 139 ms 55432 KB Output is correct
36 Correct 128 ms 55544 KB Output is correct
37 Correct 190 ms 51576 KB Output is correct
38 Correct 184 ms 52596 KB Output is correct
39 Correct 177 ms 51760 KB Output is correct
40 Correct 168 ms 49016 KB Output is correct
41 Correct 158 ms 41352 KB Output is correct
42 Correct 157 ms 43276 KB Output is correct
43 Correct 282 ms 52096 KB Output is correct
44 Correct 315 ms 53740 KB Output is correct
45 Correct 139 ms 30192 KB Output is correct
46 Correct 143 ms 30192 KB Output is correct
47 Correct 252 ms 51848 KB Output is correct
48 Correct 256 ms 52584 KB Output is correct
49 Correct 0 ms 256 KB Output is correct
50 Correct 0 ms 256 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 0 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 147792 KB Output is correct
2 Correct 117 ms 107000 KB Output is correct
3 Correct 154 ms 147704 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 157 ms 147904 KB Output is correct
6 Correct 157 ms 147832 KB Output is correct
7 Correct 165 ms 147832 KB Output is correct
8 Correct 163 ms 147832 KB Output is correct
9 Correct 162 ms 147852 KB Output is correct
10 Correct 157 ms 147576 KB Output is correct
11 Correct 158 ms 147696 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 872 ms 266320 KB Output is correct
3 Correct 1890 ms 510660 KB Output is correct
4 Correct 2001 ms 512228 KB Output is correct
5 Correct 1931 ms 512996 KB Output is correct
6 Correct 441 ms 269048 KB Output is correct
7 Correct 790 ms 438520 KB Output is correct
8 Correct 840 ms 466740 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 3 ms 1024 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 3 ms 1024 KB Output is correct
20 Correct 3 ms 896 KB Output is correct
21 Correct 4 ms 1024 KB Output is correct
22 Correct 4 ms 1024 KB Output is correct
23 Correct 4 ms 1024 KB Output is correct
24 Correct 3 ms 768 KB Output is correct
25 Correct 14 ms 4664 KB Output is correct
26 Correct 14 ms 4664 KB Output is correct
27 Correct 13 ms 4664 KB Output is correct
28 Correct 13 ms 3968 KB Output is correct
29 Correct 23 ms 4736 KB Output is correct
30 Correct 24 ms 4856 KB Output is correct
31 Correct 20 ms 4864 KB Output is correct
32 Correct 19 ms 4736 KB Output is correct
33 Correct 146 ms 55416 KB Output is correct
34 Correct 145 ms 55544 KB Output is correct
35 Correct 139 ms 55432 KB Output is correct
36 Correct 128 ms 55544 KB Output is correct
37 Correct 190 ms 51576 KB Output is correct
38 Correct 184 ms 52596 KB Output is correct
39 Correct 177 ms 51760 KB Output is correct
40 Correct 168 ms 49016 KB Output is correct
41 Correct 158 ms 41352 KB Output is correct
42 Correct 157 ms 43276 KB Output is correct
43 Correct 282 ms 52096 KB Output is correct
44 Correct 315 ms 53740 KB Output is correct
45 Correct 139 ms 30192 KB Output is correct
46 Correct 143 ms 30192 KB Output is correct
47 Correct 252 ms 51848 KB Output is correct
48 Correct 256 ms 52584 KB Output is correct
49 Correct 156 ms 147792 KB Output is correct
50 Correct 117 ms 107000 KB Output is correct
51 Correct 154 ms 147704 KB Output is correct
52 Correct 1 ms 256 KB Output is correct
53 Correct 157 ms 147904 KB Output is correct
54 Correct 157 ms 147832 KB Output is correct
55 Correct 165 ms 147832 KB Output is correct
56 Correct 163 ms 147832 KB Output is correct
57 Correct 162 ms 147852 KB Output is correct
58 Correct 157 ms 147576 KB Output is correct
59 Correct 158 ms 147696 KB Output is correct
60 Correct 1 ms 256 KB Output is correct
61 Correct 872 ms 266320 KB Output is correct
62 Correct 1890 ms 510660 KB Output is correct
63 Correct 2001 ms 512228 KB Output is correct
64 Correct 1931 ms 512996 KB Output is correct
65 Correct 441 ms 269048 KB Output is correct
66 Correct 790 ms 438520 KB Output is correct
67 Correct 840 ms 466740 KB Output is correct
68 Correct 2609 ms 661816 KB Output is correct
69 Correct 2174 ms 662080 KB Output is correct
70 Correct 2111 ms 662312 KB Output is correct
71 Correct 1694 ms 662008 KB Output is correct
72 Correct 2736 ms 633948 KB Output is correct
73 Correct 2559 ms 403604 KB Output is correct
74 Correct 2531 ms 428908 KB Output is correct
75 Correct 4191 ms 634556 KB Output is correct
76 Correct 2587 ms 405588 KB Output is correct
77 Correct 3306 ms 512596 KB Output is correct
78 Correct 4331 ms 637504 KB Output is correct
79 Correct 2325 ms 397892 KB Output is correct
80 Correct 4091 ms 633028 KB Output is correct
81 Correct 3982 ms 617028 KB Output is correct
82 Correct 1610 ms 399156 KB Output is correct
83 Correct 2635 ms 618520 KB Output is correct
84 Correct 2634 ms 639212 KB Output is correct
85 Correct 2621 ms 639164 KB Output is correct
86 Correct 0 ms 256 KB Output is correct
87 Correct 0 ms 256 KB Output is correct
88 Correct 1 ms 384 KB Output is correct
89 Correct 1 ms 384 KB Output is correct
90 Correct 0 ms 256 KB Output is correct