oj.uz

Submission #143512

# Submission time Handle Problem Language Result Execution time Memory
143512 2019-08-14T12:29:56 Z imeimi2000 Rectangles (IOI19_rect) C++17
59 / 100
 5000 ms 671352 KB 
#include "rect.h"
#include <vector>
#include <set>

using namespace std;
typedef long long llong;

const int inf = 1e8;
int n, m;
int L[2501][2501];
int R[2501][2501];
int U[2501][2501];
int D[2501][2501];
int Lm[2501][2501];
int Rm[2501][2501];
int Um[2501][2501];
int Dm[2501][2501];

struct idxtree {
    const static int sz = 1 << 12;
    int seg[sz << 1];
    void init(vector<int> 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]);
    }
    int query(int x, int y) {
        x += sz;
        y += sz;
        int 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<int> 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<int> 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<int> 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<int> 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<int> 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<int> 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<int> 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<int> 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<int> 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<int> 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);
    }
    int ans = 0;
    set<llong> sp;
    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;
            llong idx = ((llong)(Lx << 12 | Rx)) << 24 | (Ux << 12 | Dx);
            if (sp.count(idx)) continue;
            sp.insert(idx);
            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;
            ++ans; 
        }
    }
    return ans;
}

Compilation message

rect.cpp: In member function 'void idxtree::init(std::vector<int>)':
rect.cpp:23: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 3 ms 1016 KB Output is correct
2 Correct 7 ms 3832 KB Output is correct
3 Correct 6 ms 3836 KB Output is correct
4 Correct 6 ms 3832 KB Output is correct
5 Correct 6 ms 3704 KB Output is correct
6 Correct 6 ms 3832 KB Output is correct
7 Correct 5 ms 3064 KB Output is correct
8 Correct 5 ms 2424 KB Output is correct
9 Correct 7 ms 3808 KB Output is correct
10 Correct 6 ms 3876 KB Output is correct
11 Correct 6 ms 3764 KB Output is correct
12 Correct 7 ms 3832 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1144 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 2 ms 632 KB Output is correct
19 Correct 6 ms 3704 KB Output is correct
20 Correct 5 ms 3192 KB Output is correct
21 Correct 3 ms 1144 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 7 ms 3832 KB Output is correct
3 Correct 6 ms 3836 KB Output is correct
4 Correct 6 ms 3832 KB Output is correct
5 Correct 6 ms 3704 KB Output is correct
6 Correct 6 ms 3832 KB Output is correct
7 Correct 5 ms 3064 KB Output is correct
8 Correct 5 ms 2424 KB Output is correct
9 Correct 7 ms 3808 KB Output is correct
10 Correct 6 ms 3876 KB Output is correct
11 Correct 6 ms 3764 KB Output is correct
12 Correct 7 ms 3832 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1144 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 15 ms 9848 KB Output is correct
18 Correct 15 ms 9852 KB Output is correct
19 Correct 15 ms 9824 KB Output is correct
20 Correct 15 ms 9692 KB Output is correct
21 Correct 16 ms 9720 KB Output is correct
22 Correct 16 ms 9848 KB Output is correct
23 Correct 16 ms 9852 KB Output is correct
24 Correct 11 ms 7928 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 632 KB Output is correct
27 Correct 6 ms 3704 KB Output is correct
28 Correct 5 ms 3192 KB Output is correct
29 Correct 3 ms 1144 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 7 ms 3832 KB Output is correct
3 Correct 6 ms 3836 KB Output is correct
4 Correct 6 ms 3832 KB Output is correct
5 Correct 6 ms 3704 KB Output is correct
6 Correct 6 ms 3832 KB Output is correct
7 Correct 5 ms 3064 KB Output is correct
8 Correct 5 ms 2424 KB Output is correct
9 Correct 7 ms 3808 KB Output is correct
10 Correct 6 ms 3876 KB Output is correct
11 Correct 6 ms 3764 KB Output is correct
12 Correct 7 ms 3832 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1144 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 15 ms 9848 KB Output is correct
18 Correct 15 ms 9852 KB Output is correct
19 Correct 15 ms 9824 KB Output is correct
20 Correct 15 ms 9692 KB Output is correct
21 Correct 16 ms 9720 KB Output is correct
22 Correct 16 ms 9848 KB Output is correct
23 Correct 16 ms 9852 KB Output is correct
24 Correct 11 ms 7928 KB Output is correct
25 Correct 56 ms 26272 KB Output is correct
26 Correct 52 ms 26232 KB Output is correct
27 Correct 57 ms 26236 KB Output is correct
28 Correct 53 ms 25340 KB Output is correct
29 Correct 56 ms 26104 KB Output is correct
30 Correct 57 ms 26104 KB Output is correct
31 Correct 55 ms 25848 KB Output is correct
32 Correct 56 ms 25720 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 2 ms 632 KB Output is correct
35 Correct 6 ms 3704 KB Output is correct
36 Correct 5 ms 3192 KB Output is correct
37 Correct 3 ms 1144 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 7 ms 3832 KB Output is correct
3 Correct 6 ms 3836 KB Output is correct
4 Correct 6 ms 3832 KB Output is correct
5 Correct 6 ms 3704 KB Output is correct
6 Correct 6 ms 3832 KB Output is correct
7 Correct 5 ms 3064 KB Output is correct
8 Correct 5 ms 2424 KB Output is correct
9 Correct 7 ms 3808 KB Output is correct
10 Correct 6 ms 3876 KB Output is correct
11 Correct 6 ms 3764 KB Output is correct
12 Correct 7 ms 3832 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1144 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 15 ms 9848 KB Output is correct
18 Correct 15 ms 9852 KB Output is correct
19 Correct 15 ms 9824 KB Output is correct
20 Correct 15 ms 9692 KB Output is correct
21 Correct 16 ms 9720 KB Output is correct
22 Correct 16 ms 9848 KB Output is correct
23 Correct 16 ms 9852 KB Output is correct
24 Correct 11 ms 7928 KB Output is correct
25 Correct 56 ms 26272 KB Output is correct
26 Correct 52 ms 26232 KB Output is correct
27 Correct 57 ms 26236 KB Output is correct
28 Correct 53 ms 25340 KB Output is correct
29 Correct 56 ms 26104 KB Output is correct
30 Correct 57 ms 26104 KB Output is correct
31 Correct 55 ms 25848 KB Output is correct
32 Correct 56 ms 25720 KB Output is correct
33 Correct 190 ms 109536 KB Output is correct
34 Correct 192 ms 109404 KB Output is correct
35 Correct 220 ms 109488 KB Output is correct
36 Correct 188 ms 109432 KB Output is correct
37 Correct 527 ms 132264 KB Output is correct
38 Correct 544 ms 132284 KB Output is correct
39 Correct 524 ms 132256 KB Output is correct
40 Correct 495 ms 125900 KB Output is correct
41 Correct 354 ms 118648 KB Output is correct
42 Correct 432 ms 122544 KB Output is correct
43 Correct 671 ms 131644 KB Output is correct
44 Correct 704 ms 131576 KB Output is correct
45 Correct 346 ms 94040 KB Output is correct
46 Correct 329 ms 82780 KB Output is correct
47 Correct 598 ms 127608 KB Output is correct
48 Correct 597 ms 127864 KB Output is correct
49 Correct 2 ms 504 KB Output is correct
50 Correct 2 ms 632 KB Output is correct
51 Correct 6 ms 3704 KB Output is correct
52 Correct 5 ms 3192 KB Output is correct
53 Correct 3 ms 1144 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 101264 KB Output is correct
2 Correct 113 ms 86136 KB Output is correct
3 Correct 131 ms 101220 KB Output is correct
4 Correct 2 ms 632 KB Output is correct
5 Correct 133 ms 101240 KB Output is correct
6 Correct 133 ms 101176 KB Output is correct
7 Correct 132 ms 101204 KB Output is correct
8 Correct 132 ms 101212 KB Output is correct
9 Correct 132 ms 101212 KB Output is correct
10 Correct 130 ms 100984 KB Output is correct
11 Correct 132 ms 101168 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1400 KB Output is correct
2 Correct 2250 ms 365316 KB Output is correct
3 Execution timed out 5111 ms 671352 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 7 ms 3832 KB Output is correct
3 Correct 6 ms 3836 KB Output is correct
4 Correct 6 ms 3832 KB Output is correct
5 Correct 6 ms 3704 KB Output is correct
6 Correct 6 ms 3832 KB Output is correct
7 Correct 5 ms 3064 KB Output is correct
8 Correct 5 ms 2424 KB Output is correct
9 Correct 7 ms 3808 KB Output is correct
10 Correct 6 ms 3876 KB Output is correct
11 Correct 6 ms 3764 KB Output is correct
12 Correct 7 ms 3832 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1144 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 15 ms 9848 KB Output is correct
18 Correct 15 ms 9852 KB Output is correct
19 Correct 15 ms 9824 KB Output is correct
20 Correct 15 ms 9692 KB Output is correct
21 Correct 16 ms 9720 KB Output is correct
22 Correct 16 ms 9848 KB Output is correct
23 Correct 16 ms 9852 KB Output is correct
24 Correct 11 ms 7928 KB Output is correct
25 Correct 56 ms 26272 KB Output is correct
26 Correct 52 ms 26232 KB Output is correct
27 Correct 57 ms 26236 KB Output is correct
28 Correct 53 ms 25340 KB Output is correct
29 Correct 56 ms 26104 KB Output is correct
30 Correct 57 ms 26104 KB Output is correct
31 Correct 55 ms 25848 KB Output is correct
32 Correct 56 ms 25720 KB Output is correct
33 Correct 190 ms 109536 KB Output is correct
34 Correct 192 ms 109404 KB Output is correct
35 Correct 220 ms 109488 KB Output is correct
36 Correct 188 ms 109432 KB Output is correct
37 Correct 527 ms 132264 KB Output is correct
38 Correct 544 ms 132284 KB Output is correct
39 Correct 524 ms 132256 KB Output is correct
40 Correct 495 ms 125900 KB Output is correct
41 Correct 354 ms 118648 KB Output is correct
42 Correct 432 ms 122544 KB Output is correct
43 Correct 671 ms 131644 KB Output is correct
44 Correct 704 ms 131576 KB Output is correct
45 Correct 346 ms 94040 KB Output is correct
46 Correct 329 ms 82780 KB Output is correct
47 Correct 598 ms 127608 KB Output is correct
48 Correct 597 ms 127864 KB Output is correct
49 Correct 135 ms 101264 KB Output is correct
50 Correct 113 ms 86136 KB Output is correct
51 Correct 131 ms 101220 KB Output is correct
52 Correct 2 ms 632 KB Output is correct
53 Correct 133 ms 101240 KB Output is correct
54 Correct 133 ms 101176 KB Output is correct
55 Correct 132 ms 101204 KB Output is correct
56 Correct 132 ms 101212 KB Output is correct
57 Correct 132 ms 101212 KB Output is correct
58 Correct 130 ms 100984 KB Output is correct
59 Correct 132 ms 101168 KB Output is correct
60 Correct 3 ms 1400 KB Output is correct
61 Correct 2250 ms 365316 KB Output is correct
62 Execution timed out 5111 ms 671352 KB Time limit exceeded
63 Halted 0 ms 0 KB -