oj.uz

답안 #291172

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
291172 2020-09-04T20:05:38 Z IgorI Rectangles (IOI19_rect) C++17
100 / 100
 3227 ms 343628 KB 
#include <bits/stdc++.h>

using namespace std;

const int INF = 88888888;
const int N = 2502;

typedef vector<vector<int> > vvi;
typedef vector<int> vi;

#define all(x) (x).begin(), (x).end()

int n, m;
int le[N][N], ri[N][N], up[N][N], down[N][N];
int go_le[2][N][N], go_ri[2][N][N], go_up[2][N][N], go_down[2][N][N];

inline int check_rect(int x1, int y1, int x2, int y2, vector<vector<int> > &a)
{
    if (x1 <= 0 || x2 >= n - 1 || y1 <= 0 || y2 >= m - 1) return 0;
    if (x1 > x2 || y1 > y2) return 0;
    if (!(down[x1 - 1][y1] == x2 + 1 || up[x2 + 1][y1] == x1 - 1)) return 0;
    if (!(down[x1 - 1][y2] == x2 + 1 || up[x2 + 1][y2] == x1 - 1)) return 0;
    if (!(ri[x1][y1 - 1] == y2 + 1 || le[x1][y2 + 1] == y1 - 1)) return 0;
    if (!(ri[x2][y1 - 1] == y2 + 1 || le[x2][y2 + 1] == y1 - 1)) return 0;
    int D = 0;
    if (a[x1][y1 - 1] <= a[x1][y2 + 1])
    {
        D = go_down[1][x1][y1 - 1];
    }
    else
    {
        D = go_down[0][x1][y2 + 1];
    }
    int U = 0;
    if (a[x2][y1 - 1] <= a[x2][y2 + 1])
    {
        U = go_up[1][x2][y1 - 1];
    }
    else
    {
        U = go_up[0][x2][y2 + 1];
    }
    int R = 0;
    if (a[x1 - 1][y1] <= a[x2 + 1][y1])
    {
        R = go_ri[1][x1 - 1][y1];
    }
    else
    {
        R = go_ri[0][x2 + 1][y1];
    }
    int L = 0;
    if (a[x1 - 1][y2] <= a[x2 + 1][y2])
    {
        L = go_le[1][x1 - 1][y2];
    }
    else
    {
        L = go_le[0][x2 + 1][y2];
    }
    int t = (x2 < D && U < x1 && y2 < R && L < y1);
    if (!t) return 0;
    if ((down[x1 - 1][y1] == x2 + 1 || down[x1 - 1][y2] == x2 + 1) &&
        (up[x2 + 1][y1] == x1 - 1 || up[x2 + 1][y2] == x1 - 1)) return 1;
    return 2;
}

pair<int, int> st[N];
int stsz;
int pack[N];
int packsz;

long long count_rectangles(vector<vector<int> > a)
{
    n = a.size(), m = a[0].size();
    for (int i = 0; i < n; i++)
    {
        stsz = 0;
        st[stsz++] = {-1, INF};
        for (int j = 0; j < m; j++)
        {
            while (st[stsz - 1].second < a[i][j]) stsz--;
            le[i][j] = st[stsz - 1].first;
            st[stsz++] = {j, a[i][j]};
        }
    }
    for (int i = 0; i < n; i++)
    {
        stsz = 0;
        st[stsz++] = {m, INF};
        for (int j = m - 1; j >= 0; j--)
        {
            while (st[stsz - 1].second < a[i][j]) stsz--;
            ri[i][j] = st[stsz - 1].first;
            st[stsz++] = {j, a[i][j]};
        }
    }
    for (int j = 0; j < m; j++)
    {
        stsz = 0;
        st[stsz++] = {-1, INF};
        for (int i = 0; i < n; i++)
        {
            while (st[stsz - 1].second < a[i][j]) stsz--;
            up[i][j] = st[stsz - 1].first;
            st[stsz++] = {i, a[i][j]};
        }
    }
    for (int j = 0; j < m; j++)
    {
        stsz = 0;
        st[stsz++] = {n, INF};
        for (int i = n - 1; i >= 0; i--)
        {
            while (st[stsz - 1].second < a[i][j]) stsz--;
            down[i][j] = st[stsz - 1].first;
            st[stsz++] = {i, a[i][j]};
        }
    }
    for (int i = 1; i < n; i++)
    {
        vector<pair<int, int> > st;
        st.push_back({-1, INF});
        vector<int> pack;
        pack.push_back(n);
        for (int j = 0; j < m; j++)
        {
            int unpack = n;
            while (st.back().second < a[i][j])
            {
                unpack = min(unpack, down[i - 1][st.back().first]);
                st.pop_back();
                unpack = min(unpack, pack.back());
                pack.pop_back();
            }
            st.push_back({j, a[i][j]});
            pack.push_back(unpack);
            go_down[0][i][j] = unpack;
        }
    }
    for (int i = 1; i < n; i++)
    {
        vector<pair<int, int> > st;
        st.push_back({m, INF});
        vector<int> pack;
        pack.push_back(n);
        for (int j = m - 1; j >= 0; j--)
        {
            int unpack = n;
            while (st.back().second < a[i][j])
            {
                unpack = min(unpack, down[i - 1][st.back().first]);
                st.pop_back();
                unpack = min(unpack, pack.back());
                pack.pop_back();
            }
            st.push_back({j, a[i][j]});
            pack.push_back(unpack);
            go_down[1][i][j] = unpack;
        }
    }
    for (int i = 0; i + 1 < n; i++)
    {
        vector<pair<int, int> > st;
        st.push_back({-1, INF});
        vector<int> pack;
        pack.push_back(-1);
        for (int j = 0; j < m; j++)
        {
            int unpack = -1;
            while (st.back().second < a[i][j])
            {
                unpack = max(unpack, up[i + 1][st.back().first]);
                st.pop_back();
                unpack = max(unpack, pack.back());
                pack.pop_back();
            }
            st.push_back({j, a[i][j]});
            pack.push_back(unpack);
            go_up[0][i][j] = unpack;
        }
    }
    for (int i = 0; i + 1 < n; i++)
    {
        vector<pair<int, int> > st;
        st.push_back({m, INF});
        vector<int> pack;
        pack.push_back(-1);
        for (int j = m - 1; j >= 0; j--)
        {
            int unpack = -1;
            while (st.back().second < a[i][j])
            {
                unpack = max(unpack, up[i + 1][st.back().first]);
                st.pop_back();
                unpack = max(unpack, pack.back());
                pack.pop_back();
            }
            st.push_back({j, a[i][j]});
            pack.push_back(unpack);
            go_up[1][i][j] = unpack;
        }
    }
    for (int j = 1; j < m; j++)
    {
        vector<pair<int, int> > st;
        st.push_back({-1, INF});
        vector<int> pack;
        pack.push_back(m);
        for (int i = 0; i < n; i++)
        {
            int unpack = m;
            while (st.back().second < a[i][j])
            {
                unpack = min(unpack, ri[st.back().first][j - 1]);
                st.pop_back();
                unpack = min(unpack, pack.back());
                pack.pop_back();
            }
            st.push_back({i, a[i][j]});
            pack.push_back(unpack);
            go_ri[0][i][j] = unpack;
        }
    }
    for (int j = 1; j < m; j++)
    {
        vector<pair<int, int> > st;
        st.push_back({n, INF});
        vector<int> pack;
        pack.push_back(m);
        for (int i = n - 1; i >= 0; i--)
        {
            int unpack = m;
            while (st.back().second < a[i][j])
            {
                unpack = min(unpack, ri[st.back().first][j - 1]);
                st.pop_back();
                unpack = min(unpack, pack.back());
                pack.pop_back();
            }
            st.push_back({i, a[i][j]});
            pack.push_back(unpack);
            go_ri[1][i][j] = unpack;
        }
    }
    for (int j = 0; j + 1 < m; j++)
    {
        vector<pair<int, int> > st;
        st.push_back({-1, INF});
        vector<int> pack;
        pack.push_back(-1);
        for (int i = 0; i < n; i++)
        {
            int unpack = -1;
            while (st.back().second < a[i][j])
            {
                unpack = max(unpack, le[st.back().first][j + 1]);
                st.pop_back();
                unpack = max(unpack, pack.back());
                pack.pop_back();
            }
            st.push_back({i, a[i][j]});
            pack.push_back(unpack);
            go_le[0][i][j] = unpack;
        }
    }
    for (int j = 0; j + 1 < m; j++)
    {
        vector<pair<int, int> > st;
        st.push_back({n, INF});
        vector<int> pack;
        pack.push_back(-1);
        for (int i = n - 1; i >= 0; i--)
        {
            int unpack = -1;
            while (st.back().second < a[i][j])
            {
                unpack = max(unpack, le[st.back().first][j + 1]);
                st.pop_back();
                unpack = max(unpack, pack.back());
                pack.pop_back();
            }
            st.push_back({i, a[i][j]});
            pack.push_back(unpack);
            go_le[1][i][j] = unpack;
        }
    }
    vector<vector<int> > rect;
    int ans = 0;
    for (int i = 1; i + 1 < n; i++)
    {
        for (int j = 1; j + 1 < m; j++)
        {
            {
                int r = ri[i][j - 1] - 1;
                int u0 = up[i + 1][j] + 1;
                int u1 = up[i + 1][r] + 1;
                int d0 = down[i - 1][j] - 1;
                int d1 = down[i - 1][r] - 1;
                ans += check_rect(u0, j, i, r, a);
                if (u0 != u1) ans += check_rect(u1, j, i, r, a);
                ans += check_rect(i, j, d0, r, a);
                if (d0 != d1) ans += check_rect(i, j, d1, r, a);
            }
            {
                int l = le[i][j + 1] + 1;
                int u0 = up[i + 1][l] + 1;
                int u1 = up[i + 1][j] + 1;
                int d0 = down[i - 1][l] - 1;
                int d1 = down[i - 1][j] - 1;
                if (a[i][j + 1] != a[i][l - 1]) ans += check_rect(u0, l, i, j, a);
                if (a[i][j + 1] != a[i][l - 1] && u0 != u1) ans += check_rect(u1, l, i, j, a);
                if (a[i][j + 1] != a[i][l - 1]) ans += check_rect(i, l, d0, j, a);
                if (a[i][j + 1] != a[i][l - 1] && d0 != d1) ans += check_rect(i, l, d1, j, a);
            }
        }
    }
    return ans / 2;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1792 KB Output is correct
3 Correct 1 ms 1792 KB Output is correct
4 Correct 2 ms 1792 KB Output is correct
5 Correct 1 ms 1792 KB Output is correct
6 Correct 2 ms 1792 KB Output is correct
7 Correct 2 ms 1792 KB Output is correct
8 Correct 1 ms 896 KB Output is correct
9 Correct 2 ms 1792 KB Output is correct
10 Correct 1 ms 1792 KB Output is correct
11 Correct 2 ms 1792 KB Output is correct
12 Correct 2 ms 1792 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 2 ms 1792 KB Output is correct
20 Correct 1 ms 1792 KB Output is correct
21 Correct 1 ms 768 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1792 KB Output is correct
3 Correct 1 ms 1792 KB Output is correct
4 Correct 2 ms 1792 KB Output is correct
5 Correct 1 ms 1792 KB Output is correct
6 Correct 2 ms 1792 KB Output is correct
7 Correct 2 ms 1792 KB Output is correct
8 Correct 1 ms 896 KB Output is correct
9 Correct 2 ms 1792 KB Output is correct
10 Correct 1 ms 1792 KB Output is correct
11 Correct 2 ms 1792 KB Output is correct
12 Correct 2 ms 1792 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 4 ms 4608 KB Output is correct
18 Correct 5 ms 4608 KB Output is correct
19 Correct 4 ms 4608 KB Output is correct
20 Correct 5 ms 4480 KB Output is correct
21 Correct 5 ms 4480 KB Output is correct
22 Correct 5 ms 4608 KB Output is correct
23 Correct 5 ms 4480 KB Output is correct
24 Correct 4 ms 4340 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 2 ms 1792 KB Output is correct
28 Correct 1 ms 1792 KB Output is correct
29 Correct 1 ms 768 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1792 KB Output is correct
3 Correct 1 ms 1792 KB Output is correct
4 Correct 2 ms 1792 KB Output is correct
5 Correct 1 ms 1792 KB Output is correct
6 Correct 2 ms 1792 KB Output is correct
7 Correct 2 ms 1792 KB Output is correct
8 Correct 1 ms 896 KB Output is correct
9 Correct 2 ms 1792 KB Output is correct
10 Correct 1 ms 1792 KB Output is correct
11 Correct 2 ms 1792 KB Output is correct
12 Correct 2 ms 1792 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 4 ms 4608 KB Output is correct
18 Correct 5 ms 4608 KB Output is correct
19 Correct 4 ms 4608 KB Output is correct
20 Correct 5 ms 4480 KB Output is correct
21 Correct 5 ms 4480 KB Output is correct
22 Correct 5 ms 4608 KB Output is correct
23 Correct 5 ms 4480 KB Output is correct
24 Correct 4 ms 4340 KB Output is correct
25 Correct 17 ms 12192 KB Output is correct
26 Correct 18 ms 12124 KB Output is correct
27 Correct 17 ms 12160 KB Output is correct
28 Correct 18 ms 12160 KB Output is correct
29 Correct 20 ms 12160 KB Output is correct
30 Correct 20 ms 12152 KB Output is correct
31 Correct 22 ms 12160 KB Output is correct
32 Correct 20 ms 12032 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 2 ms 1792 KB Output is correct
36 Correct 1 ms 1792 KB Output is correct
37 Correct 1 ms 768 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1792 KB Output is correct
3 Correct 1 ms 1792 KB Output is correct
4 Correct 2 ms 1792 KB Output is correct
5 Correct 1 ms 1792 KB Output is correct
6 Correct 2 ms 1792 KB Output is correct
7 Correct 2 ms 1792 KB Output is correct
8 Correct 1 ms 896 KB Output is correct
9 Correct 2 ms 1792 KB Output is correct
10 Correct 1 ms 1792 KB Output is correct
11 Correct 2 ms 1792 KB Output is correct
12 Correct 2 ms 1792 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 4 ms 4608 KB Output is correct
18 Correct 5 ms 4608 KB Output is correct
19 Correct 4 ms 4608 KB Output is correct
20 Correct 5 ms 4480 KB Output is correct
21 Correct 5 ms 4480 KB Output is correct
22 Correct 5 ms 4608 KB Output is correct
23 Correct 5 ms 4480 KB Output is correct
24 Correct 4 ms 4340 KB Output is correct
25 Correct 17 ms 12192 KB Output is correct
26 Correct 18 ms 12124 KB Output is correct
27 Correct 17 ms 12160 KB Output is correct
28 Correct 18 ms 12160 KB Output is correct
29 Correct 20 ms 12160 KB Output is correct
30 Correct 20 ms 12152 KB Output is correct
31 Correct 22 ms 12160 KB Output is correct
32 Correct 20 ms 12032 KB Output is correct
33 Correct 173 ms 60920 KB Output is correct
34 Correct 173 ms 60920 KB Output is correct
35 Correct 180 ms 60920 KB Output is correct
36 Correct 191 ms 60920 KB Output is correct
37 Correct 191 ms 60904 KB Output is correct
38 Correct 194 ms 60976 KB Output is correct
39 Correct 209 ms 60920 KB Output is correct
40 Correct 180 ms 56952 KB Output is correct
41 Correct 178 ms 60920 KB Output is correct
42 Correct 193 ms 60896 KB Output is correct
43 Correct 230 ms 60852 KB Output is correct
44 Correct 234 ms 60920 KB Output is correct
45 Correct 126 ms 47456 KB Output is correct
46 Correct 104 ms 30584 KB Output is correct
47 Correct 225 ms 61048 KB Output is correct
48 Correct 243 ms 60988 KB Output is correct
49 Correct 0 ms 384 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 2 ms 1792 KB Output is correct
52 Correct 1 ms 1792 KB Output is correct
53 Correct 1 ms 768 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 896 KB Output is correct
2 Correct 4 ms 896 KB Output is correct
3 Correct 4 ms 896 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 5 ms 768 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 3 ms 640 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1069 ms 167928 KB Output is correct
3 Correct 2366 ms 341412 KB Output is correct
4 Correct 2395 ms 343396 KB Output is correct
5 Correct 2431 ms 343324 KB Output is correct
6 Correct 903 ms 169728 KB Output is correct
7 Correct 1715 ms 340344 KB Output is correct
8 Correct 1867 ms 343324 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 1792 KB Output is correct
12 Correct 1 ms 1792 KB Output is correct
13 Correct 1 ms 768 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1792 KB Output is correct
3 Correct 1 ms 1792 KB Output is correct
4 Correct 2 ms 1792 KB Output is correct
5 Correct 1 ms 1792 KB Output is correct
6 Correct 2 ms 1792 KB Output is correct
7 Correct 2 ms 1792 KB Output is correct
8 Correct 1 ms 896 KB Output is correct
9 Correct 2 ms 1792 KB Output is correct
10 Correct 1 ms 1792 KB Output is correct
11 Correct 2 ms 1792 KB Output is correct
12 Correct 2 ms 1792 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 4 ms 4608 KB Output is correct
18 Correct 5 ms 4608 KB Output is correct
19 Correct 4 ms 4608 KB Output is correct
20 Correct 5 ms 4480 KB Output is correct
21 Correct 5 ms 4480 KB Output is correct
22 Correct 5 ms 4608 KB Output is correct
23 Correct 5 ms 4480 KB Output is correct
24 Correct 4 ms 4340 KB Output is correct
25 Correct 17 ms 12192 KB Output is correct
26 Correct 18 ms 12124 KB Output is correct
27 Correct 17 ms 12160 KB Output is correct
28 Correct 18 ms 12160 KB Output is correct
29 Correct 20 ms 12160 KB Output is correct
30 Correct 20 ms 12152 KB Output is correct
31 Correct 22 ms 12160 KB Output is correct
32 Correct 20 ms 12032 KB Output is correct
33 Correct 173 ms 60920 KB Output is correct
34 Correct 173 ms 60920 KB Output is correct
35 Correct 180 ms 60920 KB Output is correct
36 Correct 191 ms 60920 KB Output is correct
37 Correct 191 ms 60904 KB Output is correct
38 Correct 194 ms 60976 KB Output is correct
39 Correct 209 ms 60920 KB Output is correct
40 Correct 180 ms 56952 KB Output is correct
41 Correct 178 ms 60920 KB Output is correct
42 Correct 193 ms 60896 KB Output is correct
43 Correct 230 ms 60852 KB Output is correct
44 Correct 234 ms 60920 KB Output is correct
45 Correct 126 ms 47456 KB Output is correct
46 Correct 104 ms 30584 KB Output is correct
47 Correct 225 ms 61048 KB Output is correct
48 Correct 243 ms 60988 KB Output is correct
49 Correct 4 ms 896 KB Output is correct
50 Correct 4 ms 896 KB Output is correct
51 Correct 4 ms 896 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 5 ms 768 KB Output is correct
54 Correct 5 ms 768 KB Output is correct
55 Correct 5 ms 768 KB Output is correct
56 Correct 5 ms 768 KB Output is correct
57 Correct 5 ms 768 KB Output is correct
58 Correct 2 ms 512 KB Output is correct
59 Correct 3 ms 640 KB Output is correct
60 Correct 1 ms 768 KB Output is correct
61 Correct 1069 ms 167928 KB Output is correct
62 Correct 2366 ms 341412 KB Output is correct
63 Correct 2395 ms 343396 KB Output is correct
64 Correct 2431 ms 343324 KB Output is correct
65 Correct 903 ms 169728 KB Output is correct
66 Correct 1715 ms 340344 KB Output is correct
67 Correct 1867 ms 343324 KB Output is correct
68 Correct 2411 ms 343380 KB Output is correct
69 Correct 2421 ms 343628 KB Output is correct
70 Correct 2397 ms 343296 KB Output is correct
71 Correct 2409 ms 343520 KB Output is correct
72 Correct 2610 ms 343468 KB Output is correct
73 Correct 1851 ms 206204 KB Output is correct
74 Correct 2013 ms 325368 KB Output is correct
75 Correct 3097 ms 343348 KB Output is correct
76 Correct 1899 ms 206320 KB Output is correct
77 Correct 2548 ms 333596 KB Output is correct
78 Correct 3227 ms 343264 KB Output is correct
79 Correct 1798 ms 206532 KB Output is correct
80 Correct 3149 ms 343388 KB Output is correct
81 Correct 3050 ms 334140 KB Output is correct
82 Correct 1674 ms 323716 KB Output is correct
83 Correct 2654 ms 343104 KB Output is correct
84 Correct 2643 ms 343304 KB Output is correct
85 Correct 2649 ms 343400 KB Output is correct
86 Correct 0 ms 384 KB Output is correct
87 Correct 1 ms 384 KB Output is correct
88 Correct 2 ms 1792 KB Output is correct
89 Correct 1 ms 1792 KB Output is correct
90 Correct 1 ms 768 KB Output is correct