oj.uz

Submission #635894

# Submission time Handle Problem Language Result Execution time Memory
635894 2022-08-27T10:11:16 Z tabr Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 1029636 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));
    }
};

#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>;

pbds<int> segs[2500][2500];
set<pair<int, int>> ngs[2500][2500];
int first_ng[2500][2500];
int last_ng[2500][2500];

long long count_rectangles(vector<vector<int>> a) {
    int h = (int) a.size();
    int w = (int) a[0].size();
    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();
            } else {
                first_ng[i][j] = h;
            }
            s.emplace_back(i);
        }
    }
    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();
            } else {
                last_ng[i][j] = -1;
            }
            s.emplace_back(i);
        }
    }
    long long res = 0;
    set<pair<int, int>> cnt;
    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;
        vector<int> v_min, v_max;
        int up_last = 0;
        int down_last = 0;
        for (int j = 1; j < w - 1; j++) {
            while (!v_min.empty() && first_ng[i - 1][v_min.back()] >= first_ng[i - 1][j]) {
                v_min.pop_back();
            }
            v_min.emplace_back(j);
            while (!v_max.empty() && last_ng[i + 1][v_max.back()] <= last_ng[i + 1][j]) {
                v_max.pop_back();
            }
            v_max.emplace_back(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].emplace(first_ng[i - 1][*lower_bound(v_min.begin(), v_min.end(), k)], i);
                }
                auto iter = ngs[k][j].begin();
                while (iter != ngs[k][j].end() && iter->first == i) {
                    segs[k][j].erase(iter->second);
                    iter = ngs[k][j].erase(iter);
                }
                if (down_last < k) {
                    res += (int) (segs[k][j].size() - segs[k][j].order_of_key(last_ng[i + 1][*lower_bound(v_max.begin(), v_max.end(), k)] + 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 544 ms 783064 KB Output is correct
2 Correct 510 ms 783336 KB Output is correct
3 Correct 507 ms 783432 KB Output is correct
4 Correct 506 ms 783484 KB Output is correct
5 Correct 503 ms 783336 KB Output is correct
6 Correct 506 ms 783284 KB Output is correct
7 Correct 514 ms 783244 KB Output is correct
8 Correct 513 ms 783244 KB Output is correct
9 Correct 512 ms 783324 KB Output is correct
10 Correct 508 ms 783232 KB Output is correct
11 Correct 517 ms 783436 KB Output is correct
12 Correct 531 ms 783224 KB Output is correct
13 Correct 518 ms 783080 KB Output is correct
14 Correct 504 ms 783064 KB Output is correct
15 Correct 521 ms 783092 KB Output is correct
16 Correct 522 ms 783036 KB Output is correct
17 Correct 504 ms 783020 KB Output is correct
18 Correct 521 ms 783032 KB Output is correct
19 Correct 513 ms 783212 KB Output is correct
20 Correct 518 ms 783344 KB Output is correct
21 Correct 510 ms 783144 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 544 ms 783064 KB Output is correct
2 Correct 510 ms 783336 KB Output is correct
3 Correct 507 ms 783432 KB Output is correct
4 Correct 506 ms 783484 KB Output is correct
5 Correct 503 ms 783336 KB Output is correct
6 Correct 506 ms 783284 KB Output is correct
7 Correct 514 ms 783244 KB Output is correct
8 Correct 513 ms 783244 KB Output is correct
9 Correct 512 ms 783324 KB Output is correct
10 Correct 508 ms 783232 KB Output is correct
11 Correct 517 ms 783436 KB Output is correct
12 Correct 531 ms 783224 KB Output is correct
13 Correct 518 ms 783080 KB Output is correct
14 Correct 504 ms 783064 KB Output is correct
15 Correct 521 ms 783092 KB Output is correct
16 Correct 522 ms 783036 KB Output is correct
17 Correct 504 ms 783020 KB Output is correct
18 Correct 521 ms 783032 KB Output is correct
19 Correct 513 ms 783212 KB Output is correct
20 Correct 518 ms 783344 KB Output is correct
21 Correct 510 ms 783144 KB Output is correct
22 Correct 529 ms 784420 KB Output is correct
23 Correct 512 ms 784352 KB Output is correct
24 Correct 567 ms 784356 KB Output is correct
25 Correct 524 ms 783888 KB Output is correct
26 Correct 510 ms 783856 KB Output is correct
27 Correct 512 ms 783816 KB Output is correct
28 Correct 530 ms 783820 KB Output is correct
29 Correct 506 ms 783824 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 544 ms 783064 KB Output is correct
2 Correct 510 ms 783336 KB Output is correct
3 Correct 507 ms 783432 KB Output is correct
4 Correct 506 ms 783484 KB Output is correct
5 Correct 503 ms 783336 KB Output is correct
6 Correct 506 ms 783284 KB Output is correct
7 Correct 514 ms 783244 KB Output is correct
8 Correct 513 ms 783244 KB Output is correct
9 Correct 512 ms 783324 KB Output is correct
10 Correct 508 ms 783232 KB Output is correct
11 Correct 517 ms 783436 KB Output is correct
12 Correct 531 ms 783224 KB Output is correct
13 Correct 518 ms 783080 KB Output is correct
14 Correct 504 ms 783064 KB Output is correct
15 Correct 521 ms 783092 KB Output is correct
16 Correct 522 ms 783036 KB Output is correct
17 Correct 529 ms 784420 KB Output is correct
18 Correct 512 ms 784352 KB Output is correct
19 Correct 567 ms 784356 KB Output is correct
20 Correct 524 ms 783888 KB Output is correct
21 Correct 510 ms 783856 KB Output is correct
22 Correct 512 ms 783816 KB Output is correct
23 Correct 530 ms 783820 KB Output is correct
24 Correct 506 ms 783824 KB Output is correct
25 Correct 504 ms 783020 KB Output is correct
26 Correct 521 ms 783032 KB Output is correct
27 Correct 513 ms 783212 KB Output is correct
28 Correct 518 ms 783344 KB Output is correct
29 Correct 510 ms 783144 KB Output is correct
30 Correct 546 ms 789172 KB Output is correct
31 Correct 556 ms 789236 KB Output is correct
32 Correct 553 ms 789320 KB Output is correct
33 Correct 514 ms 785340 KB Output is correct
34 Correct 539 ms 785480 KB Output is correct
35 Correct 554 ms 785668 KB Output is correct
36 Correct 541 ms 785536 KB Output is correct
37 Correct 545 ms 785604 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 544 ms 783064 KB Output is correct
2 Correct 510 ms 783336 KB Output is correct
3 Correct 507 ms 783432 KB Output is correct
4 Correct 506 ms 783484 KB Output is correct
5 Correct 503 ms 783336 KB Output is correct
6 Correct 506 ms 783284 KB Output is correct
7 Correct 514 ms 783244 KB Output is correct
8 Correct 513 ms 783244 KB Output is correct
9 Correct 512 ms 783324 KB Output is correct
10 Correct 508 ms 783232 KB Output is correct
11 Correct 517 ms 783436 KB Output is correct
12 Correct 531 ms 783224 KB Output is correct
13 Correct 518 ms 783080 KB Output is correct
14 Correct 504 ms 783064 KB Output is correct
15 Correct 521 ms 783092 KB Output is correct
16 Correct 522 ms 783036 KB Output is correct
17 Correct 529 ms 784420 KB Output is correct
18 Correct 512 ms 784352 KB Output is correct
19 Correct 567 ms 784356 KB Output is correct
20 Correct 524 ms 783888 KB Output is correct
21 Correct 510 ms 783856 KB Output is correct
22 Correct 512 ms 783816 KB Output is correct
23 Correct 530 ms 783820 KB Output is correct
24 Correct 506 ms 783824 KB Output is correct
25 Correct 546 ms 789172 KB Output is correct
26 Correct 556 ms 789236 KB Output is correct
27 Correct 553 ms 789320 KB Output is correct
28 Correct 514 ms 785340 KB Output is correct
29 Correct 539 ms 785480 KB Output is correct
30 Correct 554 ms 785668 KB Output is correct
31 Correct 541 ms 785536 KB Output is correct
32 Correct 545 ms 785604 KB Output is correct
33 Correct 504 ms 783020 KB Output is correct
34 Correct 521 ms 783032 KB Output is correct
35 Correct 513 ms 783212 KB Output is correct
36 Correct 518 ms 783344 KB Output is correct
37 Correct 510 ms 783144 KB Output is correct
38 Correct 678 ms 797372 KB Output is correct
39 Correct 692 ms 797420 KB Output is correct
40 Correct 788 ms 797608 KB Output is correct
41 Correct 942 ms 797736 KB Output is correct
42 Correct 1183 ms 843380 KB Output is correct
43 Correct 1132 ms 843248 KB Output is correct
44 Correct 1112 ms 843192 KB Output is correct
45 Correct 1074 ms 839376 KB Output is correct
46 Correct 624 ms 797276 KB Output is correct
47 Correct 657 ms 797512 KB Output is correct
48 Correct 858 ms 797604 KB Output is correct
49 Correct 913 ms 797528 KB Output is correct
50 Correct 728 ms 793580 KB Output is correct
51 Correct 709 ms 790988 KB Output is correct
52 Correct 884 ms 797568 KB Output is correct
53 Correct 887 ms 797668 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 527 ms 784032 KB Output is correct
2 Correct 514 ms 784160 KB Output is correct
3 Correct 512 ms 783256 KB Output is correct
4 Correct 520 ms 783064 KB Output is correct
5 Correct 513 ms 783860 KB Output is correct
6 Correct 522 ms 783756 KB Output is correct
7 Correct 535 ms 783968 KB Output is correct
8 Correct 512 ms 783804 KB Output is correct
9 Correct 521 ms 783852 KB Output is correct
10 Correct 513 ms 783064 KB Output is correct
11 Correct 502 ms 783176 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 504 ms 783020 KB Output is correct
2 Correct 521 ms 783032 KB Output is correct
3 Correct 513 ms 783212 KB Output is correct
4 Correct 518 ms 783344 KB Output is correct
5 Correct 510 ms 783144 KB Output is correct
6 Correct 517 ms 783128 KB Output is correct
7 Correct 1156 ms 832164 KB Output is correct
8 Correct 1831 ms 882980 KB Output is correct
9 Correct 1828 ms 883836 KB Output is correct
10 Correct 1854 ms 883844 KB Output is correct
11 Correct 746 ms 834036 KB Output is correct
12 Correct 982 ms 880600 KB Output is correct
13 Correct 1030 ms 883816 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 544 ms 783064 KB Output is correct
2 Correct 510 ms 783336 KB Output is correct
3 Correct 507 ms 783432 KB Output is correct
4 Correct 506 ms 783484 KB Output is correct
5 Correct 503 ms 783336 KB Output is correct
6 Correct 506 ms 783284 KB Output is correct
7 Correct 514 ms 783244 KB Output is correct
8 Correct 513 ms 783244 KB Output is correct
9 Correct 512 ms 783324 KB Output is correct
10 Correct 508 ms 783232 KB Output is correct
11 Correct 517 ms 783436 KB Output is correct
12 Correct 531 ms 783224 KB Output is correct
13 Correct 518 ms 783080 KB Output is correct
14 Correct 504 ms 783064 KB Output is correct
15 Correct 521 ms 783092 KB Output is correct
16 Correct 522 ms 783036 KB Output is correct
17 Correct 529 ms 784420 KB Output is correct
18 Correct 512 ms 784352 KB Output is correct
19 Correct 567 ms 784356 KB Output is correct
20 Correct 524 ms 783888 KB Output is correct
21 Correct 510 ms 783856 KB Output is correct
22 Correct 512 ms 783816 KB Output is correct
23 Correct 530 ms 783820 KB Output is correct
24 Correct 506 ms 783824 KB Output is correct
25 Correct 546 ms 789172 KB Output is correct
26 Correct 556 ms 789236 KB Output is correct
27 Correct 553 ms 789320 KB Output is correct
28 Correct 514 ms 785340 KB Output is correct
29 Correct 539 ms 785480 KB Output is correct
30 Correct 554 ms 785668 KB Output is correct
31 Correct 541 ms 785536 KB Output is correct
32 Correct 545 ms 785604 KB Output is correct
33 Correct 678 ms 797372 KB Output is correct
34 Correct 692 ms 797420 KB Output is correct
35 Correct 788 ms 797608 KB Output is correct
36 Correct 942 ms 797736 KB Output is correct
37 Correct 1183 ms 843380 KB Output is correct
38 Correct 1132 ms 843248 KB Output is correct
39 Correct 1112 ms 843192 KB Output is correct
40 Correct 1074 ms 839376 KB Output is correct
41 Correct 624 ms 797276 KB Output is correct
42 Correct 657 ms 797512 KB Output is correct
43 Correct 858 ms 797604 KB Output is correct
44 Correct 913 ms 797528 KB Output is correct
45 Correct 728 ms 793580 KB Output is correct
46 Correct 709 ms 790988 KB Output is correct
47 Correct 884 ms 797568 KB Output is correct
48 Correct 887 ms 797668 KB Output is correct
49 Correct 527 ms 784032 KB Output is correct
50 Correct 514 ms 784160 KB Output is correct
51 Correct 512 ms 783256 KB Output is correct
52 Correct 520 ms 783064 KB Output is correct
53 Correct 513 ms 783860 KB Output is correct
54 Correct 522 ms 783756 KB Output is correct
55 Correct 535 ms 783968 KB Output is correct
56 Correct 512 ms 783804 KB Output is correct
57 Correct 521 ms 783852 KB Output is correct
58 Correct 513 ms 783064 KB Output is correct
59 Correct 502 ms 783176 KB Output is correct
60 Correct 517 ms 783128 KB Output is correct
61 Correct 1156 ms 832164 KB Output is correct
62 Correct 1831 ms 882980 KB Output is correct
63 Correct 1828 ms 883836 KB Output is correct
64 Correct 1854 ms 883844 KB Output is correct
65 Correct 746 ms 834036 KB Output is correct
66 Correct 982 ms 880600 KB Output is correct
67 Correct 1030 ms 883816 KB Output is correct
68 Correct 504 ms 783020 KB Output is correct
69 Correct 521 ms 783032 KB Output is correct
70 Correct 513 ms 783212 KB Output is correct
71 Correct 518 ms 783344 KB Output is correct
72 Correct 510 ms 783144 KB Output is correct
73 Correct 3047 ms 883816 KB Output is correct
74 Correct 2786 ms 883720 KB Output is correct
75 Correct 3766 ms 883540 KB Output is correct
76 Correct 3161 ms 882824 KB Output is correct
77 Execution timed out 5132 ms 1029636 KB Time limit exceeded
78 Halted 0 ms 0 KB -