oj.uz

Submission #291124

# Submission time Handle Problem Language Result Execution time Memory
291124 2020-09-04T17:32:58 Z IgorI Rectangles (IOI19_rect) C++17
37 / 100
 5000 ms 168488 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 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];

bool check_rect(int x1, int y1, int x2, int y2, vector<vector<int> > &a)
{
    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];
    }
    return (x2 < D && U < x1 && y2 < R && L < y1);
}

long long count_rectangles(vector<vector<int> > a)
{
    int n = a.size(), m = a[0].size();
    for (int i = 0; i < n; i++)
    {
        vector<pair<int, int> > st;
        st.push_back({-1, INF});
        for (int j = 0; j < m; j++)
        {
            while (st.back().second < a[i][j]) st.pop_back();
            le[i][j] = st.back().first;
            st.push_back({j, a[i][j]});
        }
    }
    for (int i = 0; i < n; i++)
    {
        vector<pair<int, int> > st;
        st.push_back({m, INF});
        for (int j = m - 1; j >= 0; j--)
        {
            while (st.back().second < a[i][j]) st.pop_back();
            ri[i][j] = st.back().first;
            st.push_back({j, a[i][j]});
        }
    }
    for (int j = 0; j < m; j++)
    {
        vector<pair<int, int> > st;
        st.push_back({-1, INF});
        for (int i = 0; i < n; i++)
        {
            while (st.back().second < a[i][j]) st.pop_back();
            up[i][j] = st.back().first;
            st.push_back({i, a[i][j]});
        }
    }
    for (int j = 0; j < m; j++)
    {
        vector<pair<int, int> > st;
        st.push_back({n, INF});
        for (int i = n - 1; i >= 0; i--)
        {
            while (st.back().second < a[i][j]) st.pop_back();
            down[i][j] = st.back().first;
            st.push_back({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;
        }
    }
    int ans = 0;
    for (int x1 = 1; x1 <= n - 2; x1++)
    {
        for (int x2 = x1; x2 <= n - 2; x2++)
        {
            for (int y1 = 1; y1 <= m - 2; y1++)
            {
                for (int y2 = y1; y2 <= m - 2; y2++)
                {
                    ans += (int)check_rect(x1, y1, x2, y2, a);
                }
            }
        }
    }
    return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1792 KB Output is correct
3 Correct 2 ms 1792 KB Output is correct
4 Correct 2 ms 1792 KB Output is correct
5 Correct 2 ms 1792 KB Output is correct
6 Correct 2 ms 1792 KB Output is correct
7 Correct 1 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 3 ms 1792 KB Output is correct
11 Correct 3 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 0 ms 384 KB Output is correct
19 Correct 2 ms 1792 KB Output is correct
20 Correct 2 ms 1792 KB Output is correct
21 Correct 1 ms 768 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1792 KB Output is correct
3 Correct 2 ms 1792 KB Output is correct
4 Correct 2 ms 1792 KB Output is correct
5 Correct 2 ms 1792 KB Output is correct
6 Correct 2 ms 1792 KB Output is correct
7 Correct 1 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 3 ms 1792 KB Output is correct
11 Correct 3 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 45 ms 4608 KB Output is correct
18 Correct 45 ms 4600 KB Output is correct
19 Correct 46 ms 4604 KB Output is correct
20 Correct 48 ms 4600 KB Output is correct
21 Correct 44 ms 4480 KB Output is correct
22 Correct 44 ms 4600 KB Output is correct
23 Correct 46 ms 4608 KB Output is correct
24 Correct 14 ms 4480 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 2 ms 1792 KB Output is correct
28 Correct 2 ms 1792 KB Output is correct
29 Correct 1 ms 768 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1792 KB Output is correct
3 Correct 2 ms 1792 KB Output is correct
4 Correct 2 ms 1792 KB Output is correct
5 Correct 2 ms 1792 KB Output is correct
6 Correct 2 ms 1792 KB Output is correct
7 Correct 1 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 3 ms 1792 KB Output is correct
11 Correct 3 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 45 ms 4608 KB Output is correct
18 Correct 45 ms 4600 KB Output is correct
19 Correct 46 ms 4604 KB Output is correct
20 Correct 48 ms 4600 KB Output is correct
21 Correct 44 ms 4480 KB Output is correct
22 Correct 44 ms 4600 KB Output is correct
23 Correct 46 ms 4608 KB Output is correct
24 Correct 14 ms 4480 KB Output is correct
25 Correct 1608 ms 12288 KB Output is correct
26 Correct 1611 ms 12408 KB Output is correct
27 Correct 1612 ms 12416 KB Output is correct
28 Correct 1626 ms 12408 KB Output is correct
29 Correct 1621 ms 12408 KB Output is correct
30 Correct 1628 ms 12536 KB Output is correct
31 Correct 1620 ms 12536 KB Output is correct
32 Correct 1576 ms 12536 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 2 ms 1792 KB Output is correct
36 Correct 2 ms 1792 KB Output is correct
37 Correct 1 ms 768 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1792 KB Output is correct
3 Correct 2 ms 1792 KB Output is correct
4 Correct 2 ms 1792 KB Output is correct
5 Correct 2 ms 1792 KB Output is correct
6 Correct 2 ms 1792 KB Output is correct
7 Correct 1 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 3 ms 1792 KB Output is correct
11 Correct 3 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 45 ms 4608 KB Output is correct
18 Correct 45 ms 4600 KB Output is correct
19 Correct 46 ms 4604 KB Output is correct
20 Correct 48 ms 4600 KB Output is correct
21 Correct 44 ms 4480 KB Output is correct
22 Correct 44 ms 4600 KB Output is correct
23 Correct 46 ms 4608 KB Output is correct
24 Correct 14 ms 4480 KB Output is correct
25 Correct 1608 ms 12288 KB Output is correct
26 Correct 1611 ms 12408 KB Output is correct
27 Correct 1612 ms 12416 KB Output is correct
28 Correct 1626 ms 12408 KB Output is correct
29 Correct 1621 ms 12408 KB Output is correct
30 Correct 1628 ms 12536 KB Output is correct
31 Correct 1620 ms 12536 KB Output is correct
32 Correct 1576 ms 12536 KB Output is correct
33 Execution timed out 5060 ms 62328 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 896 KB Output is correct
2 Correct 17 ms 768 KB Output is correct
3 Correct 23 ms 896 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 23 ms 896 KB Output is correct
6 Correct 24 ms 896 KB Output is correct
7 Correct 23 ms 896 KB Output is correct
8 Correct 22 ms 768 KB Output is correct
9 Correct 22 ms 896 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 4 ms 640 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Execution timed out 5041 ms 168488 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1792 KB Output is correct
3 Correct 2 ms 1792 KB Output is correct
4 Correct 2 ms 1792 KB Output is correct
5 Correct 2 ms 1792 KB Output is correct
6 Correct 2 ms 1792 KB Output is correct
7 Correct 1 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 3 ms 1792 KB Output is correct
11 Correct 3 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 45 ms 4608 KB Output is correct
18 Correct 45 ms 4600 KB Output is correct
19 Correct 46 ms 4604 KB Output is correct
20 Correct 48 ms 4600 KB Output is correct
21 Correct 44 ms 4480 KB Output is correct
22 Correct 44 ms 4600 KB Output is correct
23 Correct 46 ms 4608 KB Output is correct
24 Correct 14 ms 4480 KB Output is correct
25 Correct 1608 ms 12288 KB Output is correct
26 Correct 1611 ms 12408 KB Output is correct
27 Correct 1612 ms 12416 KB Output is correct
28 Correct 1626 ms 12408 KB Output is correct
29 Correct 1621 ms 12408 KB Output is correct
30 Correct 1628 ms 12536 KB Output is correct
31 Correct 1620 ms 12536 KB Output is correct
32 Correct 1576 ms 12536 KB Output is correct
33 Execution timed out 5060 ms 62328 KB Time limit exceeded
34 Halted 0 ms 0 KB -