oj.uz

Submission #143524

# Submission time Handle Problem Language Result Execution time Memory
143524 2019-08-14T13:18:47 Z imeimi2000 Rectangles (IOI19_rect) C++17
100 / 100
 4256 ms 373552 KB 
#include "rect.h"
#include <algorithm>
#include <vector>
#include <set>
 
using namespace std;
typedef long long llong;
 
const short inf = 1e4;
int n, m;
short L[2501][2501];
short R[2501][2501];
short U[2501][2501];
short D[2501][2501];
short Lm[2501][2501];
short Rm[2501][2501];
short Um[2501][2501];
short Dm[2501][2501];
 
struct idxtree {
    const static int sz = 1 << 12;
    short seg[sz << 1];
    void init(vector<short> v) {
        for (int i = 1; i <= v.size(); ++i) seg[i + sz] = v[i - 1];
        for (int i = sz; i--; ) seg[i] = min(seg[i << 1], seg[i << 1 | 1]);
    }
    short query(int x, int y) {
        x += sz;
        y += sz;
        short ret = inf;
        while (x <= y) {
            if ((x & 1) == 1) ret = min(ret, seg[x++]);
            if ((y & 1) == 0) ret = min(ret, seg[y--]);
            x >>= 1;
            y >>= 1;
        }
        return ret;
    }
} Li[2501], Ri[2501], Ui[2501], Di[2501];
 
llong count_rectangles(vector<vector<int>> a) {
    n = a.size();
    m = a[0].size();
    //step 1
    for (int i = 1; i <= n; ++i) {
        vector<short> st;
        st.push_back(0);
        for (int j = 1; j <= m; ++j) {
            while (st.size() > 1 && a[i - 1][st.back() - 1] <= a[i - 1][j - 1])
                st.pop_back();
            L[i][j] = st.back();
            st.push_back(j);
        }
    }
    for (int i = 1; i <= n; ++i) {
        vector<short> st;
        st.push_back(m + 1);
        for (int j = m; j > 0; --j) {
            while (st.size() > 1 && a[i - 1][st.back() - 1] <= a[i - 1][j - 1])
                st.pop_back();
            R[i][j] = st.back();
            st.push_back(j);
        }
    }
    for (int i = 1; i <= m; ++i) {
        vector<short> st;
        st.push_back(0);
        for (int j = 1; j <= n; ++j) {
            while (st.size() > 1 && a[st.back() - 1][i - 1] <= a[j - 1][i - 1])
                st.pop_back();
            U[j][i] = st.back();
            st.push_back(j);
        }
    }
    for (int i = 1; i <= m; ++i) {
        vector<short> st;
        st.push_back(n + 1);
        for (int j = n; j > 0; --j) {
            while (st.size() > 1 && a[st.back() - 1][i - 1] <= a[j - 1][i - 1])
                st.pop_back();
            D[j][i] = st.back();
            st.push_back(j);
        }
    }
    //step 2
    for (int i = 1; i <= n; ++i) {
        vector<short> st;
        st.push_back(0);
        for (int j = 1; j <= m; ++j) {
            while (st.size() > 1 && a[i - 1][st.back() - 1] < a[i - 1][j - 1])
                st.pop_back();
            Lm[i][j] = st.back();
            st.push_back(j);
        }
    }
    for (int i = 1; i <= n; ++i) {
        vector<short> st;
        st.push_back(m + 1);
        for (int j = m; j > 0; --j) {
            while (st.size() > 1 && a[i - 1][st.back() - 1] < a[i - 1][j - 1])
                st.pop_back();
            Rm[i][j] = st.back();
            st.push_back(j);
        }
    }
    for (int i = 1; i <= m; ++i) {
        vector<short> st;
        st.push_back(0);
        for (int j = 1; j <= n; ++j) {
            while (st.size() > 1 && a[st.back() - 1][i - 1] < a[j - 1][i - 1])
                st.pop_back();
            Um[j][i] = st.back();
            st.push_back(j);
        }
    }
    for (int i = 1; i <= m; ++i) {
        vector<short> st;
        st.push_back(n + 1);
        for (int j = n; j > 0; --j) {
            while (st.size() > 1 && a[st.back() - 1][i - 1] < a[j - 1][i - 1])
                st.pop_back();
            Dm[j][i] = st.back();
            st.push_back(j);
        }
    }
    //step 3
    for (int i = 1; i <= m; ++i) {
        vector<short> Ls, Rs;
        for (int j = 1; j <= n; ++j) {
            Ls.push_back(-Lm[j][i]);
            Rs.push_back(Rm[j][i]);
        }
        Li[i].init(Ls);
        Ri[i].init(Rs);
    }
    for (int i = 1; i <= n; ++i) {
        vector<short> Us, Ds;
        for (int j = 1; j <= m; ++j) {
            Us.push_back(-Um[i][j]);
            Ds.push_back(Dm[i][j]);
        }
        Ui[i].init(Us);
        Di[i].init(Ds);
    }
    vector<llong> ans;
    for (int i = 2; i < n; ++i) {
        for (int j = 2; j < m; ++j) {
            int Lx = L[i][j] + 1;
            if (Lx == 1) continue;
            int Rx = R[i][j] - 1;
            if (Rx == m) continue;
            int Ux = U[i][j] + 1;
            if (Ux == 1) continue;
            int Dx = D[i][j] - 1;
            if (Dx == n) continue;
            if (Ri[Lx - 1].query(Ux, Dx) - 1 < Rx) continue;
            if (-Li[Rx + 1].query(Ux, Dx) + 1 > Lx) continue;
            if (Di[Ux - 1].query(Lx, Rx) - 1 < Dx) continue;
            if (-Ui[Dx + 1].query(Lx, Rx) + 1 > Ux) continue;
            llong idx = ((llong)(Lx << 12 | Rx)) << 24 | (Ux << 12 | Dx);
            ans.push_back(idx);
        }
    }
    sort(ans.begin(), ans.end());
    ans.erase(unique(ans.begin(), ans.end()), ans.end());
    return ans.size();
}

Compilation message

rect.cpp: In member function 'void idxtree::init(std::vector<short int>)':
rect.cpp:24:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 1; i <= v.size(); ++i) seg[i + sz] = v[i - 1];
                         ~~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 5 ms 2808 KB Output is correct
3 Correct 16 ms 2808 KB Output is correct
4 Correct 5 ms 2808 KB Output is correct
5 Correct 5 ms 2808 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 5 ms 2296 KB Output is correct
8 Correct 4 ms 1784 KB Output is correct
9 Correct 5 ms 2808 KB Output is correct
10 Correct 5 ms 2808 KB Output is correct
11 Correct 5 ms 2808 KB Output is correct
12 Correct 5 ms 2808 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1016 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 2 ms 508 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 5 ms 2812 KB Output is correct
20 Correct 4 ms 2424 KB Output is correct
21 Correct 2 ms 892 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 5 ms 2808 KB Output is correct
3 Correct 16 ms 2808 KB Output is correct
4 Correct 5 ms 2808 KB Output is correct
5 Correct 5 ms 2808 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 5 ms 2296 KB Output is correct
8 Correct 4 ms 1784 KB Output is correct
9 Correct 5 ms 2808 KB Output is correct
10 Correct 5 ms 2808 KB Output is correct
11 Correct 5 ms 2808 KB Output is correct
12 Correct 5 ms 2808 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1016 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 2 ms 508 KB Output is correct
17 Correct 12 ms 7032 KB Output is correct
18 Correct 12 ms 7032 KB Output is correct
19 Correct 12 ms 7056 KB Output is correct
20 Correct 11 ms 6968 KB Output is correct
21 Correct 12 ms 6908 KB Output is correct
22 Correct 11 ms 6904 KB Output is correct
23 Correct 12 ms 7032 KB Output is correct
24 Correct 9 ms 5880 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 5 ms 2812 KB Output is correct
28 Correct 4 ms 2424 KB Output is correct
29 Correct 2 ms 892 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 5 ms 2808 KB Output is correct
3 Correct 16 ms 2808 KB Output is correct
4 Correct 5 ms 2808 KB Output is correct
5 Correct 5 ms 2808 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 5 ms 2296 KB Output is correct
8 Correct 4 ms 1784 KB Output is correct
9 Correct 5 ms 2808 KB Output is correct
10 Correct 5 ms 2808 KB Output is correct
11 Correct 5 ms 2808 KB Output is correct
12 Correct 5 ms 2808 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1016 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 2 ms 508 KB Output is correct
17 Correct 12 ms 7032 KB Output is correct
18 Correct 12 ms 7032 KB Output is correct
19 Correct 12 ms 7056 KB Output is correct
20 Correct 11 ms 6968 KB Output is correct
21 Correct 12 ms 6908 KB Output is correct
22 Correct 11 ms 6904 KB Output is correct
23 Correct 12 ms 7032 KB Output is correct
24 Correct 9 ms 5880 KB Output is correct
25 Correct 40 ms 18040 KB Output is correct
26 Correct 36 ms 18052 KB Output is correct
27 Correct 36 ms 18040 KB Output is correct
28 Correct 31 ms 17400 KB Output is correct
29 Correct 35 ms 17500 KB Output is correct
30 Correct 35 ms 17500 KB Output is correct
31 Correct 35 ms 17656 KB Output is correct
32 Correct 35 ms 17528 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 5 ms 2812 KB Output is correct
36 Correct 4 ms 2424 KB Output is correct
37 Correct 2 ms 892 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 5 ms 2808 KB Output is correct
3 Correct 16 ms 2808 KB Output is correct
4 Correct 5 ms 2808 KB Output is correct
5 Correct 5 ms 2808 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 5 ms 2296 KB Output is correct
8 Correct 4 ms 1784 KB Output is correct
9 Correct 5 ms 2808 KB Output is correct
10 Correct 5 ms 2808 KB Output is correct
11 Correct 5 ms 2808 KB Output is correct
12 Correct 5 ms 2808 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1016 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 2 ms 508 KB Output is correct
17 Correct 12 ms 7032 KB Output is correct
18 Correct 12 ms 7032 KB Output is correct
19 Correct 12 ms 7056 KB Output is correct
20 Correct 11 ms 6968 KB Output is correct
21 Correct 12 ms 6908 KB Output is correct
22 Correct 11 ms 6904 KB Output is correct
23 Correct 12 ms 7032 KB Output is correct
24 Correct 9 ms 5880 KB Output is correct
25 Correct 40 ms 18040 KB Output is correct
26 Correct 36 ms 18052 KB Output is correct
27 Correct 36 ms 18040 KB Output is correct
28 Correct 31 ms 17400 KB Output is correct
29 Correct 35 ms 17500 KB Output is correct
30 Correct 35 ms 17500 KB Output is correct
31 Correct 35 ms 17656 KB Output is correct
32 Correct 35 ms 17528 KB Output is correct
33 Correct 165 ms 76484 KB Output is correct
34 Correct 165 ms 76624 KB Output is correct
35 Correct 163 ms 76548 KB Output is correct
36 Correct 163 ms 76508 KB Output is correct
37 Correct 296 ms 80736 KB Output is correct
38 Correct 297 ms 81024 KB Output is correct
39 Correct 298 ms 80920 KB Output is correct
40 Correct 286 ms 77288 KB Output is correct
41 Correct 196 ms 76964 KB Output is correct
42 Correct 215 ms 77284 KB Output is correct
43 Correct 249 ms 78868 KB Output is correct
44 Correct 286 ms 78816 KB Output is correct
45 Correct 157 ms 57792 KB Output is correct
46 Correct 136 ms 45172 KB Output is correct
47 Correct 275 ms 78820 KB Output is correct
48 Correct 271 ms 78720 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 504 KB Output is correct
51 Correct 5 ms 2812 KB Output is correct
52 Correct 4 ms 2424 KB Output is correct
53 Correct 2 ms 892 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 60920 KB Output is correct
2 Correct 80 ms 51704 KB Output is correct
3 Correct 92 ms 60764 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 94 ms 60828 KB Output is correct
6 Correct 94 ms 60792 KB Output is correct
7 Correct 93 ms 60792 KB Output is correct
8 Correct 93 ms 60920 KB Output is correct
9 Correct 94 ms 60792 KB Output is correct
10 Correct 95 ms 60664 KB Output is correct
11 Correct 93 ms 60664 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 1022 ms 187448 KB Output is correct
3 Correct 2268 ms 310868 KB Output is correct
4 Correct 2317 ms 311936 KB Output is correct
5 Correct 2247 ms 311964 KB Output is correct
6 Correct 796 ms 192728 KB Output is correct
7 Correct 1687 ms 299776 KB Output is correct
8 Correct 1824 ms 307736 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 5 ms 2812 KB Output is correct
12 Correct 4 ms 2424 KB Output is correct
13 Correct 2 ms 892 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 5 ms 2808 KB Output is correct
3 Correct 16 ms 2808 KB Output is correct
4 Correct 5 ms 2808 KB Output is correct
5 Correct 5 ms 2808 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 5 ms 2296 KB Output is correct
8 Correct 4 ms 1784 KB Output is correct
9 Correct 5 ms 2808 KB Output is correct
10 Correct 5 ms 2808 KB Output is correct
11 Correct 5 ms 2808 KB Output is correct
12 Correct 5 ms 2808 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1016 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 2 ms 508 KB Output is correct
17 Correct 12 ms 7032 KB Output is correct
18 Correct 12 ms 7032 KB Output is correct
19 Correct 12 ms 7056 KB Output is correct
20 Correct 11 ms 6968 KB Output is correct
21 Correct 12 ms 6908 KB Output is correct
22 Correct 11 ms 6904 KB Output is correct
23 Correct 12 ms 7032 KB Output is correct
24 Correct 9 ms 5880 KB Output is correct
25 Correct 40 ms 18040 KB Output is correct
26 Correct 36 ms 18052 KB Output is correct
27 Correct 36 ms 18040 KB Output is correct
28 Correct 31 ms 17400 KB Output is correct
29 Correct 35 ms 17500 KB Output is correct
30 Correct 35 ms 17500 KB Output is correct
31 Correct 35 ms 17656 KB Output is correct
32 Correct 35 ms 17528 KB Output is correct
33 Correct 165 ms 76484 KB Output is correct
34 Correct 165 ms 76624 KB Output is correct
35 Correct 163 ms 76548 KB Output is correct
36 Correct 163 ms 76508 KB Output is correct
37 Correct 296 ms 80736 KB Output is correct
38 Correct 297 ms 81024 KB Output is correct
39 Correct 298 ms 80920 KB Output is correct
40 Correct 286 ms 77288 KB Output is correct
41 Correct 196 ms 76964 KB Output is correct
42 Correct 215 ms 77284 KB Output is correct
43 Correct 249 ms 78868 KB Output is correct
44 Correct 286 ms 78816 KB Output is correct
45 Correct 157 ms 57792 KB Output is correct
46 Correct 136 ms 45172 KB Output is correct
47 Correct 275 ms 78820 KB Output is correct
48 Correct 271 ms 78720 KB Output is correct
49 Correct 93 ms 60920 KB Output is correct
50 Correct 80 ms 51704 KB Output is correct
51 Correct 92 ms 60764 KB Output is correct
52 Correct 2 ms 504 KB Output is correct
53 Correct 94 ms 60828 KB Output is correct
54 Correct 94 ms 60792 KB Output is correct
55 Correct 93 ms 60792 KB Output is correct
56 Correct 93 ms 60920 KB Output is correct
57 Correct 94 ms 60792 KB Output is correct
58 Correct 95 ms 60664 KB Output is correct
59 Correct 93 ms 60664 KB Output is correct
60 Correct 3 ms 1144 KB Output is correct
61 Correct 1022 ms 187448 KB Output is correct
62 Correct 2268 ms 310868 KB Output is correct
63 Correct 2317 ms 311936 KB Output is correct
64 Correct 2247 ms 311964 KB Output is correct
65 Correct 796 ms 192728 KB Output is correct
66 Correct 1687 ms 299776 KB Output is correct
67 Correct 1824 ms 307736 KB Output is correct
68 Correct 1915 ms 307696 KB Output is correct
69 Correct 1883 ms 307704 KB Output is correct
70 Correct 1880 ms 307704 KB Output is correct
71 Correct 1865 ms 307704 KB Output is correct
72 Correct 3991 ms 373400 KB Output is correct
73 Correct 1790 ms 233428 KB Output is correct
74 Correct 1955 ms 276600 KB Output is correct
75 Correct 3023 ms 340572 KB Output is correct
76 Correct 1832 ms 233372 KB Output is correct
77 Correct 2427 ms 298456 KB Output is correct
78 Correct 3053 ms 340668 KB Output is correct
79 Correct 1950 ms 233428 KB Output is correct
80 Correct 3327 ms 340752 KB Output is correct
81 Correct 3253 ms 334464 KB Output is correct
82 Correct 2369 ms 288956 KB Output is correct
83 Correct 4256 ms 373360 KB Output is correct
84 Correct 4112 ms 373552 KB Output is correct
85 Correct 4034 ms 373452 KB Output is correct
86 Correct 2 ms 376 KB Output is correct
87 Correct 2 ms 504 KB Output is correct
88 Correct 5 ms 2812 KB Output is correct
89 Correct 4 ms 2424 KB Output is correct
90 Correct 2 ms 892 KB Output is correct