oj.uz

Submission #264801

# Submission time Handle Problem Language Result Execution time Memory
264801 2020-08-14T09:55:38 Z hamerin Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 732336 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;
            if (v[m].first > t.first) 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;
    }

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

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

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

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

    return r1 != -1 && r2 != -1 && r1 == r2;
}

i64 _hs(i64 a, i64 b, i64 c, i64 d) {
    i64 x = 2501;
    return x * x * x * a + x * x * b + x * c + 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
    unordered_set<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 (us.find(H) != us.end()) continue;

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

    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:141:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  141 |     for (int i = 0; i < N; i++)
      |                     ~~^~~
rect.cpp:142:27: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  142 |         for (int j = 0; j < M; j++) b[j][i] = a[i][j];
      |                         ~~^~~
rect.cpp:148:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  148 |     for (int i = 0; i < N; i++) aM[i] = getMaxPos(a[i]);
      |                     ~~^~~
rect.cpp:149:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  149 |     for (int i = 0; i < M; i++) bM[i] = getMaxPos(b[i]);
      |                     ~~^~~
rect.cpp:155:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  155 |     for (int i = 0; i < N; i++) {
      |                     ~~^~~
rect.cpp:159:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  159 |     for (int i = 0; i < M; i++) {
      |                     ~~^~~
rect.cpp:172:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  172 |     for (int i = 0; i < N; i++) {
      |                     ~~^~~
rect.cpp:173:27: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  173 |         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 384 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 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 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 1 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 384 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 0 ms 256 KB Output is correct
15 Correct 0 ms 256 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 1280 KB Output is correct
19 Correct 3 ms 1152 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 2 ms 768 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 1 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 1 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 384 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 0 ms 256 KB Output is correct
15 Correct 0 ms 256 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 1280 KB Output is correct
19 Correct 3 ms 1152 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 2 ms 768 KB Output is correct
25 Correct 17 ms 5316 KB Output is correct
26 Correct 19 ms 5308 KB Output is correct
27 Correct 19 ms 5316 KB Output is correct
28 Correct 14 ms 3968 KB Output is correct
29 Correct 22 ms 4864 KB Output is correct
30 Correct 24 ms 4988 KB Output is correct
31 Correct 21 ms 4736 KB Output is correct
32 Correct 26 ms 4780 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 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 1 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 384 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 0 ms 256 KB Output is correct
15 Correct 0 ms 256 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 1280 KB Output is correct
19 Correct 3 ms 1152 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 2 ms 768 KB Output is correct
25 Correct 17 ms 5316 KB Output is correct
26 Correct 19 ms 5308 KB Output is correct
27 Correct 19 ms 5316 KB Output is correct
28 Correct 14 ms 3968 KB Output is correct
29 Correct 22 ms 4864 KB Output is correct
30 Correct 24 ms 4988 KB Output is correct
31 Correct 21 ms 4736 KB Output is correct
32 Correct 26 ms 4780 KB Output is correct
33 Correct 146 ms 53624 KB Output is correct
34 Correct 138 ms 53624 KB Output is correct
35 Correct 137 ms 53624 KB Output is correct
36 Correct 131 ms 53752 KB Output is correct
37 Correct 217 ms 57696 KB Output is correct
38 Correct 254 ms 57588 KB Output is correct
39 Correct 218 ms 57568 KB Output is correct
40 Correct 212 ms 54264 KB Output is correct
41 Correct 169 ms 41660 KB Output is correct
42 Correct 247 ms 43560 KB Output is correct
43 Correct 590 ms 55868 KB Output is correct
44 Correct 384 ms 56052 KB Output is correct
45 Correct 281 ms 32024 KB Output is correct
46 Correct 162 ms 31900 KB Output is correct
47 Correct 318 ms 53256 KB Output is correct
48 Correct 327 ms 53228 KB Output is correct
49 Correct 1 ms 256 KB Output is correct
50 Correct 1 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 1 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 147960 KB Output is correct
2 Correct 113 ms 106744 KB Output is correct
3 Correct 152 ms 147704 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 156 ms 147900 KB Output is correct
6 Correct 154 ms 147960 KB Output is correct
7 Correct 153 ms 147960 KB Output is correct
8 Correct 159 ms 147832 KB Output is correct
9 Correct 157 ms 147832 KB Output is correct
10 Correct 177 ms 147576 KB Output is correct
11 Correct 161 ms 147960 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1093 ms 264256 KB Output is correct
3 Correct 2926 ms 515304 KB Output is correct
4 Correct 2638 ms 518740 KB Output is correct
5 Correct 2660 ms 518736 KB Output is correct
6 Correct 455 ms 270456 KB Output is correct
7 Correct 751 ms 440312 KB Output is correct
8 Correct 812 ms 469624 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 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 1 ms 256 KB Output is correct

Subtask #7
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 384 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 0 ms 256 KB Output is correct
15 Correct 0 ms 256 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 1280 KB Output is correct
19 Correct 3 ms 1152 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 2 ms 768 KB Output is correct
25 Correct 17 ms 5316 KB Output is correct
26 Correct 19 ms 5308 KB Output is correct
27 Correct 19 ms 5316 KB Output is correct
28 Correct 14 ms 3968 KB Output is correct
29 Correct 22 ms 4864 KB Output is correct
30 Correct 24 ms 4988 KB Output is correct
31 Correct 21 ms 4736 KB Output is correct
32 Correct 26 ms 4780 KB Output is correct
33 Correct 146 ms 53624 KB Output is correct
34 Correct 138 ms 53624 KB Output is correct
35 Correct 137 ms 53624 KB Output is correct
36 Correct 131 ms 53752 KB Output is correct
37 Correct 217 ms 57696 KB Output is correct
38 Correct 254 ms 57588 KB Output is correct
39 Correct 218 ms 57568 KB Output is correct
40 Correct 212 ms 54264 KB Output is correct
41 Correct 169 ms 41660 KB Output is correct
42 Correct 247 ms 43560 KB Output is correct
43 Correct 590 ms 55868 KB Output is correct
44 Correct 384 ms 56052 KB Output is correct
45 Correct 281 ms 32024 KB Output is correct
46 Correct 162 ms 31900 KB Output is correct
47 Correct 318 ms 53256 KB Output is correct
48 Correct 327 ms 53228 KB Output is correct
49 Correct 155 ms 147960 KB Output is correct
50 Correct 113 ms 106744 KB Output is correct
51 Correct 152 ms 147704 KB Output is correct
52 Correct 1 ms 256 KB Output is correct
53 Correct 156 ms 147900 KB Output is correct
54 Correct 154 ms 147960 KB Output is correct
55 Correct 153 ms 147960 KB Output is correct
56 Correct 159 ms 147832 KB Output is correct
57 Correct 157 ms 147832 KB Output is correct
58 Correct 177 ms 147576 KB Output is correct
59 Correct 161 ms 147960 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 1093 ms 264256 KB Output is correct
62 Correct 2926 ms 515304 KB Output is correct
63 Correct 2638 ms 518740 KB Output is correct
64 Correct 2660 ms 518736 KB Output is correct
65 Correct 455 ms 270456 KB Output is correct
66 Correct 751 ms 440312 KB Output is correct
67 Correct 812 ms 469624 KB Output is correct
68 Correct 2697 ms 663484 KB Output is correct
69 Correct 2090 ms 663416 KB Output is correct
70 Correct 2174 ms 663160 KB Output is correct
71 Correct 1665 ms 663200 KB Output is correct
72 Correct 4019 ms 732336 KB Output is correct
73 Correct 4202 ms 446100 KB Output is correct
74 Correct 4614 ms 456464 KB Output is correct
75 Execution timed out 5095 ms 658596 KB Time limit exceeded
76 Halted 0 ms 0 KB -