oj.uz

Submission #1009498

# Submission time Handle Problem Language Result Execution time Memory
1009498 2024-06-27T15:08:43 Z boris_mihov Rectangles (IOI19_rect) C++17
59 / 100
 728 ms 1048576 KB 
#include "rect.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <stack>

typedef long long llong;
const int MAXLOG = 12;
const int MAXN = 2500 + 10;
const int INF  = 1e8;

int n, m;
int getLOG[MAXN];
struct SparseMIN
{
    int sparse[MAXN][MAXLOG];
    int len;

    void build(int a[], int length)
    {
        len = length;
        for (int i = 1 ; i <= len ; ++i)
        {
            sparse[i][0] = a[i]; 
        }

        for (int lg = 1 ; (1 << lg) <= len ; ++lg)
        {
            for (int i = 1 ; i + (1 << lg) - 1 <= len ; ++i)
            {
                sparse[i][lg] = std::min(sparse[i][lg - 1], sparse[i + (1 << lg - 1)][lg - 1]);
            }
        }
    }

    int findMIN(int l, int r)
    {
        int lg = getLOG[r - l + 1];
        return std::min(sparse[l][lg], sparse[r - (1 << lg) + 1][lg]);
    }
};

struct SparseMAX
{
    int sparse[MAXN][MAXLOG];
    int len;

    void build(int a[], int length)
    {
        len = length;
        for (int i = 1 ; i <= len ; ++i)
        {
            sparse[i][0] = a[i]; 
        }

        for (int lg = 1 ; (1 << lg) <= len ; ++lg)
        {
            for (int i = 1 ; i + (1 << lg) - 1 <= len ; ++i)
            {
                sparse[i][lg] = std::max(sparse[i][lg - 1], sparse[i + (1 << lg - 1)][lg - 1]);
            }
        }
    }

    int findMAX(int l, int r)
    {
        int lg = getLOG[r - l + 1];
        return std::max(sparse[l][lg], sparse[r - (1 << lg) + 1][lg]);
    }
};

int a[MAXN][MAXN]; // >
int b[MAXN][MAXN]; // v
int c[MAXN][MAXN]; // <
int d[MAXN][MAXN]; // ^
int t[MAXN][MAXN];
int cpy[MAXN];

SparseMIN sparseRD[MAXN];
SparseMAX sparseRU[MAXN];
SparseMIN sparseCL[MAXN];
SparseMAX sparseCR[MAXN];
std::vector <int> possibleColE[MAXN][MAXN];
std::vector <int> possibleRowE[MAXN][MAXN];

bool isOK(int rowB, int colB, int rowE, int colE)
{
    rowB--; colB--; rowE++; colE++;
    if (sparseRD[rowB].findMIN(colB + 1, colE - 1) < rowE) return false;
    if (sparseRU[rowE].findMAX(colB + 1, colE - 1) > rowB) return false;
    if (sparseCL[colB].findMIN(rowB + 1, rowE - 1) < colE) return false;
    if (sparseCR[colE].findMAX(rowB + 1, rowE - 1) > colB) return false;
    return true;
}

llong count_rectangles(std::vector <std::vector<int>> _a)
{
    n = _a.size(); m = _a[0].size();
    for (int i = 0 ; i < n ; ++i)
    {
        for (int j = 0 ; j < m ; ++j)
        {
            t[i + 1][j + 1] = _a[i][j];
        }
    }

    for (int i = 0 ; i <= n + 1 ; ++i)
    {
        t[i][0] = t[i][m + 1] = INF;
    }

    for (int i = 0 ; i <= m + 1 ; ++i)
    {
        t[0][i] = t[n + 1][i] = INF;
    }

    std::stack <int> st;
    for (int i = 1 ; i <= n ; ++i)
    {
        while (st.size()) st.pop(); st.push(m + 1);
        for (int j = m ; j >= 1 ; --j)
        {
            while (t[i][j] > t[i][st.top()])
            {
                st.pop();
            }

            a[i][j] = st.top();
            st.push(j);
        }

        while (st.size()) st.pop(); st.push(0);
        for (int j = 1 ; j <= m ; ++j)
        {
            while (t[i][j] > t[i][st.top()])
            {
                st.pop();
            }

            c[i][j] = st.top();
            st.push(j);
        }
    }

    for (int i = 1 ; i <= m ; ++i)
    {
        while (st.size()) st.pop(); st.push(n + 1);
        for (int j = n ; j >= 1 ; --j)
        {
            while (t[j][i] > t[st.top()][i])
            {
                st.pop();
            }

            b[j][i] = st.top();
            st.push(j);
        }

        while (st.size()) st.pop(); st.push(0);
        for (int j = 1 ; j <= n ; ++j)
        {
            while (t[j][i] > t[st.top()][i])
            {
                st.pop();
            }

            d[j][i] = st.top();
            st.push(j);
        }
    }

    for (int i = 1 ; i <= std::max(n, m) ; ++i)
    {
        getLOG[i] = getLOG[i - 1];
        if ((1 << getLOG[i] + 1) < i) getLOG[i]++;
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        sparseRD[i].build(b[i], m);
        sparseRU[i].build(d[i], m);
    }

    for (int i = 1 ; i <= m ; ++i)
    {
        for (int j = 1 ; j <= n ; ++j)
        {
            cpy[j] = a[j][i];
        }

        sparseCL[i].build(cpy, n);

        for (int j = 1 ; j <= n ; ++j)
        {
            cpy[j] = c[j][i];
        }

        sparseCR[i].build(cpy, n);
    }

    for (int i = 2 ; i <= n ; ++i)
    {
        for (int j = 2 ; j <= m ; ++j)
        {
            if (d[i][j] < i - 1) possibleRowE[d[i][j] + 1][j].push_back(i - 1);
            if (c[i][j] < j - 1) possibleColE[i][c[i][j] + 1].push_back(j - 1);
        }
    }

    for (int i = 2 ; i <= n ; ++i)
    {
        for (int j = 2 ; j <= m ; ++j)
        {
            if (i < b[i - 1][j] && b[i - 1][j] != n + 1 && (possibleRowE[i][j].empty() || possibleRowE[i][j].back() != b[i - 1][j] - 1)) possibleRowE[i][j].push_back(b[i - 1][j] - 1);
            if (j < a[i][j - 1] && a[i][j - 1] != m + 1 && (possibleColE[i][j].empty() || possibleColE[i][j].back() != a[i][j - 1] - 1)) possibleColE[i][j].push_back(a[i][j - 1] - 1);
        }
    }

    int answer = 0;
    for (int rowB = 2 ; rowB < n ; ++rowB)
    {
        for (int colB = 2 ; colB < m ; ++colB)
        {
            for (const int &rowE : possibleRowE[rowB][colB])
            {
                for (const int &colE : possibleColE[rowB][colB])
                {
                    answer += isOK(rowB, colB, rowE, colE);
                }
            }
        }
    }

    return answer;
}

Compilation message

rect.cpp: In member function 'void SparseMIN::build(int*, int)':
rect.cpp:33:81: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   33 |                 sparse[i][lg] = std::min(sparse[i][lg - 1], sparse[i + (1 << lg - 1)][lg - 1]);
      |                                                                              ~~~^~~
rect.cpp: In member function 'void SparseMAX::build(int*, int)':
rect.cpp:62:81: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   62 |                 sparse[i][lg] = std::max(sparse[i][lg - 1], sparse[i + (1 << lg - 1)][lg - 1]);
      |                                                                              ~~~^~~
rect.cpp: In function 'llong count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:122:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  122 |         while (st.size()) st.pop(); st.push(m + 1);
      |         ^~~~~
rect.cpp:122:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  122 |         while (st.size()) st.pop(); st.push(m + 1);
      |                                     ^~
rect.cpp:134:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  134 |         while (st.size()) st.pop(); st.push(0);
      |         ^~~~~
rect.cpp:134:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  134 |         while (st.size()) st.pop(); st.push(0);
      |                                     ^~
rect.cpp:149:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  149 |         while (st.size()) st.pop(); st.push(n + 1);
      |         ^~~~~
rect.cpp:149:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  149 |         while (st.size()) st.pop(); st.push(n + 1);
      |                                     ^~
rect.cpp:161:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  161 |         while (st.size()) st.pop(); st.push(0);
      |         ^~~~~
rect.cpp:161:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  161 |         while (st.size()) st.pop(); st.push(0);
      |                                     ^~
rect.cpp:177:29: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
  177 |         if ((1 << getLOG[i] + 1) < i) getLOG[i]++;
      |                   ~~~~~~~~~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 296488 KB Output is correct
2 Correct 101 ms 297556 KB Output is correct
3 Correct 99 ms 297540 KB Output is correct
4 Correct 100 ms 297624 KB Output is correct
5 Correct 107 ms 297516 KB Output is correct
6 Correct 106 ms 297500 KB Output is correct
7 Correct 120 ms 297296 KB Output is correct
8 Correct 123 ms 297040 KB Output is correct
9 Correct 111 ms 297552 KB Output is correct
10 Correct 142 ms 297552 KB Output is correct
11 Correct 109 ms 297668 KB Output is correct
12 Correct 113 ms 297556 KB Output is correct
13 Correct 112 ms 296224 KB Output is correct
14 Correct 113 ms 296528 KB Output is correct
15 Correct 130 ms 296532 KB Output is correct
16 Correct 99 ms 296472 KB Output is correct
17 Correct 103 ms 296272 KB Output is correct
18 Correct 110 ms 296276 KB Output is correct
19 Correct 125 ms 297556 KB Output is correct
20 Correct 101 ms 297260 KB Output is correct
21 Correct 104 ms 296532 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 296488 KB Output is correct
2 Correct 101 ms 297556 KB Output is correct
3 Correct 99 ms 297540 KB Output is correct
4 Correct 100 ms 297624 KB Output is correct
5 Correct 107 ms 297516 KB Output is correct
6 Correct 106 ms 297500 KB Output is correct
7 Correct 120 ms 297296 KB Output is correct
8 Correct 123 ms 297040 KB Output is correct
9 Correct 111 ms 297552 KB Output is correct
10 Correct 142 ms 297552 KB Output is correct
11 Correct 109 ms 297668 KB Output is correct
12 Correct 113 ms 297556 KB Output is correct
13 Correct 112 ms 296224 KB Output is correct
14 Correct 113 ms 296528 KB Output is correct
15 Correct 130 ms 296532 KB Output is correct
16 Correct 99 ms 296472 KB Output is correct
17 Correct 103 ms 296272 KB Output is correct
18 Correct 110 ms 296276 KB Output is correct
19 Correct 125 ms 297556 KB Output is correct
20 Correct 101 ms 297260 KB Output is correct
21 Correct 104 ms 296532 KB Output is correct
22 Correct 113 ms 300884 KB Output is correct
23 Correct 106 ms 300984 KB Output is correct
24 Correct 116 ms 300880 KB Output is correct
25 Correct 129 ms 300860 KB Output is correct
26 Correct 134 ms 300728 KB Output is correct
27 Correct 112 ms 300876 KB Output is correct
28 Correct 122 ms 300880 KB Output is correct
29 Correct 101 ms 299600 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 296488 KB Output is correct
2 Correct 101 ms 297556 KB Output is correct
3 Correct 99 ms 297540 KB Output is correct
4 Correct 100 ms 297624 KB Output is correct
5 Correct 107 ms 297516 KB Output is correct
6 Correct 106 ms 297500 KB Output is correct
7 Correct 120 ms 297296 KB Output is correct
8 Correct 123 ms 297040 KB Output is correct
9 Correct 111 ms 297552 KB Output is correct
10 Correct 142 ms 297552 KB Output is correct
11 Correct 109 ms 297668 KB Output is correct
12 Correct 113 ms 297556 KB Output is correct
13 Correct 112 ms 296224 KB Output is correct
14 Correct 113 ms 296528 KB Output is correct
15 Correct 130 ms 296532 KB Output is correct
16 Correct 99 ms 296472 KB Output is correct
17 Correct 113 ms 300884 KB Output is correct
18 Correct 106 ms 300984 KB Output is correct
19 Correct 116 ms 300880 KB Output is correct
20 Correct 129 ms 300860 KB Output is correct
21 Correct 134 ms 300728 KB Output is correct
22 Correct 112 ms 300876 KB Output is correct
23 Correct 122 ms 300880 KB Output is correct
24 Correct 101 ms 299600 KB Output is correct
25 Correct 103 ms 296272 KB Output is correct
26 Correct 110 ms 296276 KB Output is correct
27 Correct 125 ms 297556 KB Output is correct
28 Correct 101 ms 297260 KB Output is correct
29 Correct 104 ms 296532 KB Output is correct
30 Correct 118 ms 314708 KB Output is correct
31 Correct 114 ms 314708 KB Output is correct
32 Correct 132 ms 314788 KB Output is correct
33 Correct 134 ms 312996 KB Output is correct
34 Correct 136 ms 313428 KB Output is correct
35 Correct 121 ms 313524 KB Output is correct
36 Correct 114 ms 313428 KB Output is correct
37 Correct 117 ms 313168 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 296488 KB Output is correct
2 Correct 101 ms 297556 KB Output is correct
3 Correct 99 ms 297540 KB Output is correct
4 Correct 100 ms 297624 KB Output is correct
5 Correct 107 ms 297516 KB Output is correct
6 Correct 106 ms 297500 KB Output is correct
7 Correct 120 ms 297296 KB Output is correct
8 Correct 123 ms 297040 KB Output is correct
9 Correct 111 ms 297552 KB Output is correct
10 Correct 142 ms 297552 KB Output is correct
11 Correct 109 ms 297668 KB Output is correct
12 Correct 113 ms 297556 KB Output is correct
13 Correct 112 ms 296224 KB Output is correct
14 Correct 113 ms 296528 KB Output is correct
15 Correct 130 ms 296532 KB Output is correct
16 Correct 99 ms 296472 KB Output is correct
17 Correct 113 ms 300884 KB Output is correct
18 Correct 106 ms 300984 KB Output is correct
19 Correct 116 ms 300880 KB Output is correct
20 Correct 129 ms 300860 KB Output is correct
21 Correct 134 ms 300728 KB Output is correct
22 Correct 112 ms 300876 KB Output is correct
23 Correct 122 ms 300880 KB Output is correct
24 Correct 101 ms 299600 KB Output is correct
25 Correct 118 ms 314708 KB Output is correct
26 Correct 114 ms 314708 KB Output is correct
27 Correct 132 ms 314788 KB Output is correct
28 Correct 134 ms 312996 KB Output is correct
29 Correct 136 ms 313428 KB Output is correct
30 Correct 121 ms 313524 KB Output is correct
31 Correct 114 ms 313428 KB Output is correct
32 Correct 117 ms 313168 KB Output is correct
33 Correct 103 ms 296272 KB Output is correct
34 Correct 110 ms 296276 KB Output is correct
35 Correct 125 ms 297556 KB Output is correct
36 Correct 101 ms 297260 KB Output is correct
37 Correct 104 ms 296532 KB Output is correct
38 Correct 211 ms 445644 KB Output is correct
39 Correct 186 ms 438096 KB Output is correct
40 Correct 191 ms 438100 KB Output is correct
41 Correct 728 ms 430516 KB Output is correct
42 Correct 199 ms 458068 KB Output is correct
43 Correct 210 ms 457808 KB Output is correct
44 Correct 209 ms 458068 KB Output is correct
45 Correct 196 ms 447908 KB Output is correct
46 Correct 240 ms 435204 KB Output is correct
47 Correct 209 ms 437708 KB Output is correct
48 Correct 269 ms 443220 KB Output is correct
49 Correct 270 ms 443220 KB Output is correct
50 Correct 181 ms 379732 KB Output is correct
51 Correct 190 ms 372816 KB Output is correct
52 Correct 261 ms 442148 KB Output is correct
53 Correct 267 ms 442196 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 319316 KB Output is correct
2 Correct 112 ms 315988 KB Output is correct
3 Correct 111 ms 319056 KB Output is correct
4 Correct 108 ms 296320 KB Output is correct
5 Correct 107 ms 319100 KB Output is correct
6 Correct 109 ms 319352 KB Output is correct
7 Correct 121 ms 319252 KB Output is correct
8 Correct 107 ms 319268 KB Output is correct
9 Correct 114 ms 319176 KB Output is correct
10 Correct 105 ms 318032 KB Output is correct
11 Correct 103 ms 318544 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 296272 KB Output is correct
2 Correct 110 ms 296276 KB Output is correct
3 Correct 125 ms 297556 KB Output is correct
4 Correct 101 ms 297260 KB Output is correct
5 Correct 104 ms 296532 KB Output is correct
6 Correct 105 ms 296784 KB Output is correct
7 Correct 705 ms 994280 KB Output is correct
8 Runtime error 684 ms 1048576 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 296488 KB Output is correct
2 Correct 101 ms 297556 KB Output is correct
3 Correct 99 ms 297540 KB Output is correct
4 Correct 100 ms 297624 KB Output is correct
5 Correct 107 ms 297516 KB Output is correct
6 Correct 106 ms 297500 KB Output is correct
7 Correct 120 ms 297296 KB Output is correct
8 Correct 123 ms 297040 KB Output is correct
9 Correct 111 ms 297552 KB Output is correct
10 Correct 142 ms 297552 KB Output is correct
11 Correct 109 ms 297668 KB Output is correct
12 Correct 113 ms 297556 KB Output is correct
13 Correct 112 ms 296224 KB Output is correct
14 Correct 113 ms 296528 KB Output is correct
15 Correct 130 ms 296532 KB Output is correct
16 Correct 99 ms 296472 KB Output is correct
17 Correct 113 ms 300884 KB Output is correct
18 Correct 106 ms 300984 KB Output is correct
19 Correct 116 ms 300880 KB Output is correct
20 Correct 129 ms 300860 KB Output is correct
21 Correct 134 ms 300728 KB Output is correct
22 Correct 112 ms 300876 KB Output is correct
23 Correct 122 ms 300880 KB Output is correct
24 Correct 101 ms 299600 KB Output is correct
25 Correct 118 ms 314708 KB Output is correct
26 Correct 114 ms 314708 KB Output is correct
27 Correct 132 ms 314788 KB Output is correct
28 Correct 134 ms 312996 KB Output is correct
29 Correct 136 ms 313428 KB Output is correct
30 Correct 121 ms 313524 KB Output is correct
31 Correct 114 ms 313428 KB Output is correct
32 Correct 117 ms 313168 KB Output is correct
33 Correct 211 ms 445644 KB Output is correct
34 Correct 186 ms 438096 KB Output is correct
35 Correct 191 ms 438100 KB Output is correct
36 Correct 728 ms 430516 KB Output is correct
37 Correct 199 ms 458068 KB Output is correct
38 Correct 210 ms 457808 KB Output is correct
39 Correct 209 ms 458068 KB Output is correct
40 Correct 196 ms 447908 KB Output is correct
41 Correct 240 ms 435204 KB Output is correct
42 Correct 209 ms 437708 KB Output is correct
43 Correct 269 ms 443220 KB Output is correct
44 Correct 270 ms 443220 KB Output is correct
45 Correct 181 ms 379732 KB Output is correct
46 Correct 190 ms 372816 KB Output is correct
47 Correct 261 ms 442148 KB Output is correct
48 Correct 267 ms 442196 KB Output is correct
49 Correct 114 ms 319316 KB Output is correct
50 Correct 112 ms 315988 KB Output is correct
51 Correct 111 ms 319056 KB Output is correct
52 Correct 108 ms 296320 KB Output is correct
53 Correct 107 ms 319100 KB Output is correct
54 Correct 109 ms 319352 KB Output is correct
55 Correct 121 ms 319252 KB Output is correct
56 Correct 107 ms 319268 KB Output is correct
57 Correct 114 ms 319176 KB Output is correct
58 Correct 105 ms 318032 KB Output is correct
59 Correct 103 ms 318544 KB Output is correct
60 Correct 105 ms 296784 KB Output is correct
61 Correct 705 ms 994280 KB Output is correct
62 Runtime error 684 ms 1048576 KB Execution killed with signal 9
63 Halted 0 ms 0 KB -