oj.uz

Submission #1009536

# Submission time Handle Problem Language Result Execution time Memory
1009536 2024-06-27T15:34:06 Z boris_mihov Rectangles (IOI19_rect) C++17
25 / 100
 656 ms 697680 KB 
#include "rect.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <stack>
 
typedef long long llong;
const short MAXLOG = 12;
const short MAXN = 2500 + 10;
const int INF  = 1e8;
 
short n, m;
short getLOG[MAXN];
struct SparseMIN
{
    short sparse[MAXN][MAXLOG];
    short len;
 
    void build(short a[], short length)
    {
        len = length;
        for (short i = 1 ; i <= len ; ++i)
        {
            sparse[i][0] = a[i]; 
        }
 
        for (short lg = 1 ; (1 << lg) <= len ; ++lg)
        {
            for (short i = 1 ; i + (1 << lg) - 1 <= len ; ++i)
            {
                sparse[i][lg] = std::min(sparse[i][lg - 1], sparse[i + (1 << lg - 1)][lg - 1]);
            }
        }
    }
 
    short findMIN(short l, short r)
    {
        short lg = getLOG[r - l + 1];
        return std::min(sparse[l][lg], sparse[r - (1 << lg) + 1][lg]);
    }
};
 
struct SparseMAX
{
    short sparse[MAXN][MAXLOG];
    short len;
 
    void build(short a[], short length)
    {
        len = length;
        for (short i = 1 ; i <= len ; ++i)
        {
            sparse[i][0] = a[i]; 
        }
 
        for (short lg = 1 ; (1 << lg) <= len ; ++lg)
        {
            for (short i = 1 ; i + (1 << lg) - 1 <= len ; ++i)
            {
                sparse[i][lg] = std::max(sparse[i][lg - 1], sparse[i + (1 << lg - 1)][lg - 1]);
            }
        }
    }
 
    short findMAX(short l, short r)
    {
        short lg = getLOG[r - l + 1];
        return std::max(sparse[l][lg], sparse[r - (1 << lg) + 1][lg]);
    }
};
 
short a[MAXN][MAXN]; // >
short b[MAXN][MAXN]; // v
short c[MAXN][MAXN]; // <
short d[MAXN][MAXN]; // ^
int t[MAXN][MAXN];
short cpy[MAXN];
 
SparseMIN sparseRD[MAXN];
SparseMAX sparseRU[MAXN];
SparseMIN sparseCL[MAXN];
SparseMAX sparseCR[MAXN];
std::vector <short> possibleColE[MAXN][MAXN];
std::vector <short> possibleRowE[MAXN][MAXN];
 
bool isOK(short rowB, short colB, short rowE, short 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 (short i = 0 ; i < n ; ++i)
    {
        for (short j = 0 ; j < m ; ++j)
        {
            t[i + 1][j + 1] = _a[i][j];
        }
    }
 
    for (short i = 0 ; i <= n + 1 ; ++i)
    {
        t[i][0] = t[i][m + 1] = INF;
    }
 
    for (short i = 0 ; i <= m + 1 ; ++i)
    {
        t[0][i] = t[n + 1][i] = INF;
    }
 
    std::stack <int> st;
    for (short i = 1 ; i <= n ; ++i)
    {
        while (st.size()) st.pop(); st.push(m + 1);
        for (short 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 (short j = 1 ; j <= m ; ++j)
        {
            while (t[i][j] > t[i][st.top()])
            {
                st.pop();
            }
 
            c[i][j] = st.top();
            st.push(j);
        }
    }
 
    for (short i = 1 ; i <= m ; ++i)
    {
        while (st.size()) st.pop(); st.push(n + 1);
        for (short 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 (short j = 1 ; j <= n ; ++j)
        {
            while (t[j][i] > t[st.top()][i])
            {
                st.pop();
            }
 
            d[j][i] = st.top();
            st.push(j);
        }
    }
 
    for (short i = 1 ; i <= std::max(n, m) ; ++i)
    {
        getLOG[i] = getLOG[i - 1];
        if ((1 << getLOG[i] + 1) < i) getLOG[i]++;
    }
 
    for (short i = 1 ; i <= n ; ++i)
    {
        sparseRD[i].build(b[i], m);
        sparseRU[i].build(d[i], m);
    }
 
    for (short i = 1 ; i <= m ; ++i)
    {
        for (short j = 1 ; j <= n ; ++j)
        {
            cpy[j] = a[j][i];
        }
 
        sparseCL[i].build(cpy, n);
 
        for (short j = 1 ; j <= n ; ++j)
        {
            cpy[j] = c[j][i];
        }
 
        sparseCR[i].build(cpy, n);
    }
 
    for (short i = 2 ; i <= n ; ++i)
    {
        for (short 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 (short i = 2 ; i <= n ; ++i)
    {
        for (short 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);
        }
    }
 
    short answer = 0;
    for (short rowB = 2 ; rowB < n ; ++rowB)
    {
        for (short colB = 2 ; colB < m ; ++colB)
        {
            for (const short &rowE : possibleRowE[rowB][colB])
            {
                for (const short &colE : possibleColE[rowB][colB])
                {
                    answer += isOK(rowB, colB, rowE, colE);
                }
            }
        }
    }
 
    return answer;
}

Compilation message

rect.cpp: In member function 'void SparseMIN::build(short int*, short 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(short int*, short 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 100 ms 296532 KB Output is correct
2 Correct 102 ms 297620 KB Output is correct
3 Correct 96 ms 297640 KB Output is correct
4 Correct 103 ms 297556 KB Output is correct
5 Correct 111 ms 297552 KB Output is correct
6 Correct 109 ms 297552 KB Output is correct
7 Correct 98 ms 297300 KB Output is correct
8 Correct 108 ms 296788 KB Output is correct
9 Correct 116 ms 297552 KB Output is correct
10 Correct 111 ms 297500 KB Output is correct
11 Correct 102 ms 297556 KB Output is correct
12 Correct 100 ms 297388 KB Output is correct
13 Correct 103 ms 296276 KB Output is correct
14 Correct 107 ms 296532 KB Output is correct
15 Correct 103 ms 296532 KB Output is correct
16 Correct 106 ms 296272 KB Output is correct
17 Correct 107 ms 296372 KB Output is correct
18 Correct 101 ms 296268 KB Output is correct
19 Correct 101 ms 297552 KB Output is correct
20 Correct 96 ms 297156 KB Output is correct
21 Correct 101 ms 296532 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 296532 KB Output is correct
2 Correct 102 ms 297620 KB Output is correct
3 Correct 96 ms 297640 KB Output is correct
4 Correct 103 ms 297556 KB Output is correct
5 Correct 111 ms 297552 KB Output is correct
6 Correct 109 ms 297552 KB Output is correct
7 Correct 98 ms 297300 KB Output is correct
8 Correct 108 ms 296788 KB Output is correct
9 Correct 116 ms 297552 KB Output is correct
10 Correct 111 ms 297500 KB Output is correct
11 Correct 102 ms 297556 KB Output is correct
12 Correct 100 ms 297388 KB Output is correct
13 Correct 103 ms 296276 KB Output is correct
14 Correct 107 ms 296532 KB Output is correct
15 Correct 103 ms 296532 KB Output is correct
16 Correct 106 ms 296272 KB Output is correct
17 Correct 107 ms 296372 KB Output is correct
18 Correct 101 ms 296268 KB Output is correct
19 Correct 101 ms 297552 KB Output is correct
20 Correct 96 ms 297156 KB Output is correct
21 Correct 101 ms 296532 KB Output is correct
22 Correct 115 ms 300368 KB Output is correct
23 Correct 129 ms 300372 KB Output is correct
24 Correct 120 ms 300184 KB Output is correct
25 Correct 116 ms 300108 KB Output is correct
26 Correct 115 ms 300080 KB Output is correct
27 Correct 109 ms 300112 KB Output is correct
28 Correct 113 ms 300108 KB Output is correct
29 Correct 111 ms 299344 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 296532 KB Output is correct
2 Correct 102 ms 297620 KB Output is correct
3 Correct 96 ms 297640 KB Output is correct
4 Correct 103 ms 297556 KB Output is correct
5 Correct 111 ms 297552 KB Output is correct
6 Correct 109 ms 297552 KB Output is correct
7 Correct 98 ms 297300 KB Output is correct
8 Correct 108 ms 296788 KB Output is correct
9 Correct 116 ms 297552 KB Output is correct
10 Correct 111 ms 297500 KB Output is correct
11 Correct 102 ms 297556 KB Output is correct
12 Correct 100 ms 297388 KB Output is correct
13 Correct 103 ms 296276 KB Output is correct
14 Correct 107 ms 296532 KB Output is correct
15 Correct 103 ms 296532 KB Output is correct
16 Correct 106 ms 296272 KB Output is correct
17 Correct 115 ms 300368 KB Output is correct
18 Correct 129 ms 300372 KB Output is correct
19 Correct 120 ms 300184 KB Output is correct
20 Correct 116 ms 300108 KB Output is correct
21 Correct 115 ms 300080 KB Output is correct
22 Correct 109 ms 300112 KB Output is correct
23 Correct 113 ms 300108 KB Output is correct
24 Correct 111 ms 299344 KB Output is correct
25 Correct 107 ms 296372 KB Output is correct
26 Correct 101 ms 296268 KB Output is correct
27 Correct 101 ms 297552 KB Output is correct
28 Correct 96 ms 297156 KB Output is correct
29 Correct 101 ms 296532 KB Output is correct
30 Incorrect 127 ms 310692 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 296532 KB Output is correct
2 Correct 102 ms 297620 KB Output is correct
3 Correct 96 ms 297640 KB Output is correct
4 Correct 103 ms 297556 KB Output is correct
5 Correct 111 ms 297552 KB Output is correct
6 Correct 109 ms 297552 KB Output is correct
7 Correct 98 ms 297300 KB Output is correct
8 Correct 108 ms 296788 KB Output is correct
9 Correct 116 ms 297552 KB Output is correct
10 Correct 111 ms 297500 KB Output is correct
11 Correct 102 ms 297556 KB Output is correct
12 Correct 100 ms 297388 KB Output is correct
13 Correct 103 ms 296276 KB Output is correct
14 Correct 107 ms 296532 KB Output is correct
15 Correct 103 ms 296532 KB Output is correct
16 Correct 106 ms 296272 KB Output is correct
17 Correct 115 ms 300368 KB Output is correct
18 Correct 129 ms 300372 KB Output is correct
19 Correct 120 ms 300184 KB Output is correct
20 Correct 116 ms 300108 KB Output is correct
21 Correct 115 ms 300080 KB Output is correct
22 Correct 109 ms 300112 KB Output is correct
23 Correct 113 ms 300108 KB Output is correct
24 Correct 111 ms 299344 KB Output is correct
25 Incorrect 127 ms 310692 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 318036 KB Output is correct
2 Correct 120 ms 314728 KB Output is correct
3 Correct 120 ms 317828 KB Output is correct
4 Correct 113 ms 296272 KB Output is correct
5 Correct 115 ms 317856 KB Output is correct
6 Correct 114 ms 317780 KB Output is correct
7 Correct 130 ms 317776 KB Output is correct
8 Correct 112 ms 317780 KB Output is correct
9 Correct 100 ms 317776 KB Output is correct
10 Correct 102 ms 317268 KB Output is correct
11 Correct 124 ms 317584 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 296372 KB Output is correct
2 Correct 101 ms 296268 KB Output is correct
3 Correct 101 ms 297552 KB Output is correct
4 Correct 96 ms 297156 KB Output is correct
5 Correct 101 ms 296532 KB Output is correct
6 Correct 94 ms 296768 KB Output is correct
7 Incorrect 656 ms 697680 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 296532 KB Output is correct
2 Correct 102 ms 297620 KB Output is correct
3 Correct 96 ms 297640 KB Output is correct
4 Correct 103 ms 297556 KB Output is correct
5 Correct 111 ms 297552 KB Output is correct
6 Correct 109 ms 297552 KB Output is correct
7 Correct 98 ms 297300 KB Output is correct
8 Correct 108 ms 296788 KB Output is correct
9 Correct 116 ms 297552 KB Output is correct
10 Correct 111 ms 297500 KB Output is correct
11 Correct 102 ms 297556 KB Output is correct
12 Correct 100 ms 297388 KB Output is correct
13 Correct 103 ms 296276 KB Output is correct
14 Correct 107 ms 296532 KB Output is correct
15 Correct 103 ms 296532 KB Output is correct
16 Correct 106 ms 296272 KB Output is correct
17 Correct 115 ms 300368 KB Output is correct
18 Correct 129 ms 300372 KB Output is correct
19 Correct 120 ms 300184 KB Output is correct
20 Correct 116 ms 300108 KB Output is correct
21 Correct 115 ms 300080 KB Output is correct
22 Correct 109 ms 300112 KB Output is correct
23 Correct 113 ms 300108 KB Output is correct
24 Correct 111 ms 299344 KB Output is correct
25 Incorrect 127 ms 310692 KB Output isn't correct
26 Halted 0 ms 0 KB -