oj.uz

Submission #635875

# Submission time Handle Problem Language Result Execution time Memory
635875 2022-08-27T09:02:50 Z tabr Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 1045820 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

struct dsu {
    vector<int> p;
    vector<int> sz;
    vector<int> mn;
    vector<int> mx;
    int n;

    dsu(int _n) : n(_n) {
        p = vector<int>(n);
        iota(p.begin(), p.end(), 0);
        sz = vector<int>(n, 1);
        mx = p;
        mn = p;
    }

    inline int get(int x) {
        if (p[x] == x) {
            return x;
        } else {
            return p[x] = get(p[x]);
        }
    }

    inline bool unite(int x, int y) {
        x = get(x);
        y = get(y);
        if (x == y) {
            return false;
        }
        p[x] = y;
        sz[y] += sz[x];
        mn[y] = min(mn[y], mn[x]);
        mx[y] = max(mx[y], mx[x]);
        return true;
    }

    inline bool same(int x, int y) {
        return (get(x) == get(y));
    }

    inline int size(int x) {
        return sz[get(x)];
    }

    inline bool root(int x) {
        return (x == get(x));
    }
};

namespace smin {
struct sparse {
    using T = int;
    int n;
    int h;
    vector<vector<T>> table;

    T op(T x, T y) {
        return min(x, y);
    }

    sparse(const vector<T> &v) {
        n = (int) v.size();
        h = 32 - __builtin_clz(n);
        table.resize(h);
        table[0] = v;
        for (int j = 1; j < h; j++) {
            table[j].resize(n - (1 << j) + 1);
            for (int i = 0; i <= n - (1 << j); i++) {
                table[j][i] = op(table[j - 1][i], table[j - 1][i + (1 << (j - 1))]);
            }
        }
    }

    T get(int l, int r) {
        assert(l < r);
        int k = 31 - __builtin_clz(r - l);
        return op(table[k][l], table[k][r - (1 << k)]);
    }
};
}  // namespace smin

namespace smax {
struct sparse {
    using T = int;
    int n;
    int h;
    vector<vector<T>> table;

    T op(T x, T y) {
        return max(x, y);
    }

    sparse(const vector<T> &v) {
        n = (int) v.size();
        h = 32 - __builtin_clz(n);
        table.resize(h);
        table[0] = v;
        for (int j = 1; j < h; j++) {
            table[j].resize(n - (1 << j) + 1);
            for (int i = 0; i <= n - (1 << j); i++) {
                table[j][i] = op(table[j - 1][i], table[j - 1][i + (1 << (j - 1))]);
            }
        }
    }

    T get(int l, int r) {
        assert(l < r);
        int k = 31 - __builtin_clz(r - l);
        return op(table[k][l], table[k][r - (1 << k)]);
    }
};
}  // namespace smax

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

template <typename T>
using pbds = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

long long count_rectangles(vector<vector<int>> a) {
    int h = (int) a.size();
    int w = (int) a[0].size();
    vector<vector<int>> first_ng(h, vector<int>(w, h));
    for (int j = 0; j < w; j++) {
        vector<int> s;
        for (int i = h - 1; i >= 0; i--) {
            while (!s.empty() && a[s.back()][j] < a[i][j]) {
                s.pop_back();
            }
            if (!s.empty()) {
                first_ng[i][j] = s.back();
            }
            s.emplace_back(i);
        }
    }
    vector<vector<int>> last_ng(h, vector<int>(w, -1));
    for (int j = 0; j < w; j++) {
        vector<int> s;
        for (int i = 0; i < h; i++) {
            while (!s.empty() && a[s.back()][j] < a[i][j]) {
                s.pop_back();
            }
            if (!s.empty()) {
                last_ng[i][j] = s.back();
            }
            s.emplace_back(i);
        }
    }
    long long res = 0;
    set<pair<int, int>> cnt;
    vector<vector<pbds<int>>> segs(w, vector<pbds<int>>(w));
    vector<vector<map<int, vector<int>>>> ngs(w, vector<map<int, vector<int>>>(w));
    for (int i = 1; i < h - 1; i++) {
        vector<vector<int>> bound(w);
        map<int, vector<int>> v;
        for (int j = 0; j < w; j++) {
            v[a[i][j]].emplace_back(j);
        }
        dsu uf(w);
        for (auto p : v) {
            for (int j : p.second) {
                if (j - 1 >= 0 && a[i][j] >= a[i][j - 1]) {
                    uf.unite(j - 1, j);
                }
                if (j + 1 < w && a[i][j] >= a[i][j + 1]) {
                    uf.unite(j + 1, j);
                }
            }
            for (int j : p.second) {
                if (uf.root(j) && uf.mn[j] > 0 && uf.mx[j] < w - 1) {
                    bound[uf.mx[j]].emplace_back(uf.mn[j]);
                }
            }
        }
        set<pair<int, int>> new_cnt;
        smin::sparse sp_min(first_ng[i - 1]);
        smax::sparse sp_max(last_ng[i + 1]);
        int up_last = 0;
        int down_last = 0;
        for (int j = 1; j < w - 1; j++) {
            if (a[i][j] >= a[i - 1][j]) {
                up_last = j;
            }
            if (a[i][j] >= a[i + 1][j]) {
                down_last = j;
            }
            for (int k : bound[j]) {
                new_cnt.emplace(k, j);
                if (up_last < k) {
                    segs[k][j].insert(i);
                    ngs[k][j][sp_min.get(k, j + 1)].emplace_back(i);
                }
                for (int x : ngs[k][j][i]) {
                    segs[k][j].erase(x);
                }
                ngs[k][j].erase(i);
                if (down_last < k) {
                    // debug(i, j, k, (int) (segs[k][j].size() - segs[k][j].order_of_key(sp_max.get(k, j + 1) + 1)));
                    res += (int) (segs[k][j].size() - segs[k][j].order_of_key(sp_max.get(k, j + 1) + 1));
                }
            }
        }
        for (auto p : cnt) {
            if (!new_cnt.count(p)) {
                segs[p.first][p.second].clear();
                ngs[p.first][p.second].clear();
            }
        }
        swap(cnt, new_cnt);
    }
    return res;
}

#ifdef tabr
mt19937 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());

int rand_int(int a, int b) {  // [a, b]
    return uniform_int_distribution<int>(a, b)(rng);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    debug(count_rectangles({{4, 8, 7, 5, 6},
                            {7, 4, 10, 3, 5},
                            {9, 7, 20, 14, 2},
                            {9, 14, 7, 3, 6},
                            {5, 7, 5, 2, 7},
                            {4, 5, 13, 5, 6}}));
    debug(count_rectangles({{5, 7, 5},
                            {9, 4, 7},
                            {9, 7, 20},
                            {7, 4, 10},
                            {4, 8, 7}}));
    debug(count_rectangles({{10, 10, 10},
                            {10, 9, 10},
                            {10, 0, 10},
                            {10, 1, 10},
                            {10, 5, 10},
                            {10, 10, 10}}));
    vector<vector<int>> a(6, vector<int>(3, 10));
    for (int i = 1; i < 5; i++) {
        for (int j = 1; j < 2; j++) {
            a[i][j] = rand_int(0, 9);
        }
    }
    for (auto b : a) debug(b);
    debug(count_rectangles(a));
    return 0;
}
#endif

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 0 ms 292 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 0 ms 292 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 5 ms 1620 KB Output is correct
23 Correct 6 ms 1620 KB Output is correct
24 Correct 5 ms 1620 KB Output is correct
25 Correct 3 ms 1236 KB Output is correct
26 Correct 6 ms 1236 KB Output is correct
27 Correct 6 ms 1236 KB Output is correct
28 Correct 5 ms 1200 KB Output is correct
29 Correct 2 ms 568 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 0 ms 292 KB Output is correct
17 Correct 5 ms 1620 KB Output is correct
18 Correct 6 ms 1620 KB Output is correct
19 Correct 5 ms 1620 KB Output is correct
20 Correct 3 ms 1236 KB Output is correct
21 Correct 6 ms 1236 KB Output is correct
22 Correct 6 ms 1236 KB Output is correct
23 Correct 5 ms 1200 KB Output is correct
24 Correct 2 ms 568 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 30 ms 8244 KB Output is correct
31 Correct 30 ms 8268 KB Output is correct
32 Correct 31 ms 8316 KB Output is correct
33 Correct 15 ms 6108 KB Output is correct
34 Correct 38 ms 6208 KB Output is correct
35 Correct 44 ms 6264 KB Output is correct
36 Correct 36 ms 6356 KB Output is correct
37 Correct 35 ms 6268 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 0 ms 292 KB Output is correct
17 Correct 5 ms 1620 KB Output is correct
18 Correct 6 ms 1620 KB Output is correct
19 Correct 5 ms 1620 KB Output is correct
20 Correct 3 ms 1236 KB Output is correct
21 Correct 6 ms 1236 KB Output is correct
22 Correct 6 ms 1236 KB Output is correct
23 Correct 5 ms 1200 KB Output is correct
24 Correct 2 ms 568 KB Output is correct
25 Correct 30 ms 8244 KB Output is correct
26 Correct 30 ms 8268 KB Output is correct
27 Correct 31 ms 8316 KB Output is correct
28 Correct 15 ms 6108 KB Output is correct
29 Correct 38 ms 6208 KB Output is correct
30 Correct 44 ms 6264 KB Output is correct
31 Correct 36 ms 6356 KB Output is correct
32 Correct 35 ms 6268 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 231 ms 72908 KB Output is correct
39 Correct 266 ms 72908 KB Output is correct
40 Correct 296 ms 73076 KB Output is correct
41 Correct 357 ms 73092 KB Output is correct
42 Correct 558 ms 98780 KB Output is correct
43 Correct 563 ms 98604 KB Output is correct
44 Correct 563 ms 99000 KB Output is correct
45 Correct 615 ms 97104 KB Output is correct
46 Correct 167 ms 70476 KB Output is correct
47 Correct 223 ms 70620 KB Output is correct
48 Correct 510 ms 71552 KB Output is correct
49 Correct 584 ms 73516 KB Output is correct
50 Correct 263 ms 21576 KB Output is correct
51 Correct 293 ms 67776 KB Output is correct
52 Correct 551 ms 72592 KB Output is correct
53 Correct 545 ms 73656 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 706 ms 784528 KB Output is correct
2 Correct 526 ms 566056 KB Output is correct
3 Correct 675 ms 783636 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 613 ms 784304 KB Output is correct
6 Correct 630 ms 784352 KB Output is correct
7 Correct 712 ms 784300 KB Output is correct
8 Correct 629 ms 784220 KB Output is correct
9 Correct 614 ms 784176 KB Output is correct
10 Correct 631 ms 783400 KB Output is correct
11 Correct 602 ms 783492 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1316 ms 721088 KB Output is correct
8 Correct 2307 ms 881796 KB Output is correct
9 Correct 2303 ms 881572 KB Output is correct
10 Correct 2257 ms 882324 KB Output is correct
11 Correct 949 ms 832596 KB Output is correct
12 Correct 1284 ms 781808 KB Output is correct
13 Correct 1405 ms 882228 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 0 ms 292 KB Output is correct
17 Correct 5 ms 1620 KB Output is correct
18 Correct 6 ms 1620 KB Output is correct
19 Correct 5 ms 1620 KB Output is correct
20 Correct 3 ms 1236 KB Output is correct
21 Correct 6 ms 1236 KB Output is correct
22 Correct 6 ms 1236 KB Output is correct
23 Correct 5 ms 1200 KB Output is correct
24 Correct 2 ms 568 KB Output is correct
25 Correct 30 ms 8244 KB Output is correct
26 Correct 30 ms 8268 KB Output is correct
27 Correct 31 ms 8316 KB Output is correct
28 Correct 15 ms 6108 KB Output is correct
29 Correct 38 ms 6208 KB Output is correct
30 Correct 44 ms 6264 KB Output is correct
31 Correct 36 ms 6356 KB Output is correct
32 Correct 35 ms 6268 KB Output is correct
33 Correct 231 ms 72908 KB Output is correct
34 Correct 266 ms 72908 KB Output is correct
35 Correct 296 ms 73076 KB Output is correct
36 Correct 357 ms 73092 KB Output is correct
37 Correct 558 ms 98780 KB Output is correct
38 Correct 563 ms 98604 KB Output is correct
39 Correct 563 ms 99000 KB Output is correct
40 Correct 615 ms 97104 KB Output is correct
41 Correct 167 ms 70476 KB Output is correct
42 Correct 223 ms 70620 KB Output is correct
43 Correct 510 ms 71552 KB Output is correct
44 Correct 584 ms 73516 KB Output is correct
45 Correct 263 ms 21576 KB Output is correct
46 Correct 293 ms 67776 KB Output is correct
47 Correct 551 ms 72592 KB Output is correct
48 Correct 545 ms 73656 KB Output is correct
49 Correct 706 ms 784528 KB Output is correct
50 Correct 526 ms 566056 KB Output is correct
51 Correct 675 ms 783636 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 613 ms 784304 KB Output is correct
54 Correct 630 ms 784352 KB Output is correct
55 Correct 712 ms 784300 KB Output is correct
56 Correct 629 ms 784220 KB Output is correct
57 Correct 614 ms 784176 KB Output is correct
58 Correct 631 ms 783400 KB Output is correct
59 Correct 602 ms 783492 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1316 ms 721088 KB Output is correct
62 Correct 2307 ms 881796 KB Output is correct
63 Correct 2303 ms 881572 KB Output is correct
64 Correct 2257 ms 882324 KB Output is correct
65 Correct 949 ms 832596 KB Output is correct
66 Correct 1284 ms 781808 KB Output is correct
67 Correct 1405 ms 882228 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 3623 ms 927808 KB Output is correct
74 Correct 3273 ms 928232 KB Output is correct
75 Correct 4642 ms 929172 KB Output is correct
76 Correct 3684 ms 929492 KB Output is correct
77 Execution timed out 5091 ms 1045820 KB Time limit exceeded
78 Halted 0 ms 0 KB -