oj.uz

Submission #264812

# Submission time Handle Problem Language Result Execution time Memory
264812 2020-08-14T10:03:07 Z hamerin Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 662028 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;
    }

    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) {
    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
    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:123:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  123 |     for (int i = 0; i < N; i++)
      |                     ~~^~~
rect.cpp:124:27: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  124 |         for (int j = 0; j < M; j++) b[j][i] = a[i][j];
      |                         ~~^~~
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 < N; i++) aM[i] = getMaxPos(a[i]);
      |                     ~~^~~
rect.cpp:131:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  131 |     for (int i = 0; i < M; i++) bM[i] = getMaxPos(b[i]);
      |                     ~~^~~
rect.cpp:137:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  137 |     for (int i = 0; i < N; i++) {
      |                     ~~^~~
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 < M; i++) {
      |                     ~~^~~
rect.cpp:154:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  154 |     for (int i = 0; i < N; i++) {
      |                     ~~^~~
rect.cpp:155:27: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
  155 |         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 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 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 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 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 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 5 ms 1024 KB Output is correct
23 Correct 5 ms 1024 KB Output is correct
24 Correct 3 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 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 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 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 5 ms 1024 KB Output is correct
23 Correct 5 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 13 ms 4664 KB Output is correct
27 Correct 16 ms 4664 KB Output is correct
28 Correct 13 ms 3968 KB Output is correct
29 Correct 19 ms 4736 KB Output is correct
30 Correct 21 ms 4992 KB Output is correct
31 Correct 19 ms 4856 KB Output is correct
32 Correct 19 ms 4736 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 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 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 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 5 ms 1024 KB Output is correct
23 Correct 5 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 13 ms 4664 KB Output is correct
27 Correct 16 ms 4664 KB Output is correct
28 Correct 13 ms 3968 KB Output is correct
29 Correct 19 ms 4736 KB Output is correct
30 Correct 21 ms 4992 KB Output is correct
31 Correct 19 ms 4856 KB Output is correct
32 Correct 19 ms 4736 KB Output is correct
33 Correct 160 ms 52604 KB Output is correct
34 Correct 136 ms 52600 KB Output is correct
35 Correct 138 ms 52604 KB Output is correct
36 Correct 127 ms 52600 KB Output is correct
37 Correct 175 ms 48504 KB Output is correct
38 Correct 178 ms 49572 KB Output is correct
39 Correct 182 ms 48504 KB Output is correct
40 Correct 170 ms 45820 KB Output is correct
41 Correct 136 ms 40824 KB Output is correct
42 Correct 157 ms 42740 KB Output is correct
43 Correct 301 ms 50300 KB Output is correct
44 Correct 277 ms 50412 KB Output is correct
45 Correct 151 ms 28716 KB Output is correct
46 Correct 138 ms 28784 KB Output is correct
47 Correct 275 ms 49260 KB Output is correct
48 Correct 256 ms 49376 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 191 ms 147832 KB Output is correct
2 Correct 128 ms 106744 KB Output is correct
3 Correct 185 ms 147704 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 206 ms 147832 KB Output is correct
6 Correct 182 ms 147960 KB Output is correct
7 Correct 192 ms 147832 KB Output is correct
8 Correct 170 ms 147832 KB Output is correct
9 Correct 172 ms 147832 KB Output is correct
10 Correct 162 ms 147576 KB Output is correct
11 Correct 163 ms 147704 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 910 ms 263724 KB Output is correct
3 Correct 2015 ms 510436 KB Output is correct
4 Correct 2049 ms 512228 KB Output is correct
5 Correct 2153 ms 513036 KB Output is correct
6 Correct 479 ms 268920 KB Output is correct
7 Correct 851 ms 438648 KB Output is correct
8 Correct 831 ms 466808 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 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 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 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 5 ms 1024 KB Output is correct
23 Correct 5 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 13 ms 4664 KB Output is correct
27 Correct 16 ms 4664 KB Output is correct
28 Correct 13 ms 3968 KB Output is correct
29 Correct 19 ms 4736 KB Output is correct
30 Correct 21 ms 4992 KB Output is correct
31 Correct 19 ms 4856 KB Output is correct
32 Correct 19 ms 4736 KB Output is correct
33 Correct 160 ms 52604 KB Output is correct
34 Correct 136 ms 52600 KB Output is correct
35 Correct 138 ms 52604 KB Output is correct
36 Correct 127 ms 52600 KB Output is correct
37 Correct 175 ms 48504 KB Output is correct
38 Correct 178 ms 49572 KB Output is correct
39 Correct 182 ms 48504 KB Output is correct
40 Correct 170 ms 45820 KB Output is correct
41 Correct 136 ms 40824 KB Output is correct
42 Correct 157 ms 42740 KB Output is correct
43 Correct 301 ms 50300 KB Output is correct
44 Correct 277 ms 50412 KB Output is correct
45 Correct 151 ms 28716 KB Output is correct
46 Correct 138 ms 28784 KB Output is correct
47 Correct 275 ms 49260 KB Output is correct
48 Correct 256 ms 49376 KB Output is correct
49 Correct 191 ms 147832 KB Output is correct
50 Correct 128 ms 106744 KB Output is correct
51 Correct 185 ms 147704 KB Output is correct
52 Correct 1 ms 256 KB Output is correct
53 Correct 206 ms 147832 KB Output is correct
54 Correct 182 ms 147960 KB Output is correct
55 Correct 192 ms 147832 KB Output is correct
56 Correct 170 ms 147832 KB Output is correct
57 Correct 172 ms 147832 KB Output is correct
58 Correct 162 ms 147576 KB Output is correct
59 Correct 163 ms 147704 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 910 ms 263724 KB Output is correct
62 Correct 2015 ms 510436 KB Output is correct
63 Correct 2049 ms 512228 KB Output is correct
64 Correct 2153 ms 513036 KB Output is correct
65 Correct 479 ms 268920 KB Output is correct
66 Correct 851 ms 438648 KB Output is correct
67 Correct 831 ms 466808 KB Output is correct
68 Correct 2697 ms 662028 KB Output is correct
69 Correct 2326 ms 661920 KB Output is correct
70 Correct 2220 ms 661948 KB Output is correct
71 Correct 1665 ms 661776 KB Output is correct
72 Correct 2768 ms 634008 KB Output is correct
73 Correct 3084 ms 403796 KB Output is correct
74 Correct 3302 ms 428756 KB Output is correct
75 Execution timed out 5074 ms 634632 KB Time limit exceeded
76 Halted 0 ms 0 KB -