oj.uz

Submission #1009559

# Submission time Handle Problem Language Result Execution time Memory
1009559 2024-06-27T15:43:13 Z boris_mihov Rectangles (IOI19_rect) C++17
49 / 100
 1089 ms 697684 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]);
            }
        }
    }
 
    inline short findMIN(short &l, short &r, short &val)
    {
        short lg = getLOG[r - l + 1];
        if (sparse[l][lg] < val) return false;
        if (sparse[r - (1 << lg) + 1][lg] < val) return false;
        return true;
    }
};
 
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]);
            }
        }
    }
 
    inline bool findMAX(short &l, short &r, short &val)
    {
        short lg = getLOG[r - l + 1];
        if (sparse[l][lg] > val) return false;
        if (sparse[r - (1 << lg) + 1][lg] > val) return false;
        return true;
    }
};
 
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];
 
int answer = 0;
void isOK(short &rowB, short &colB, short &rowE, short &colE)
{
    bool result = true;
    colB++; colE--;
    if (result && !sparseRD[rowB].findMIN(colB, colE, rowE)) result = false;
    if (result && !sparseRU[rowE].findMAX(colB, colE, rowB)) result = false;
    colB--; colE++;
    rowE--; rowB++;
    if (result && !sparseCL[colB].findMIN(rowB, rowE, colE)) result = false;
    if (result && !sparseCR[colE].findMAX(rowB, rowE, colB)) result = false;
    rowE++; rowB--;
    answer += result;
}
 
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)
        {
            // max = std::max(max, a[i][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 <short> 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]][j - 1].push_back(i);
            if (c[i][j] < j - 1) possibleColE[i - 1][c[i][j]].push_back(j);
        }
    }
 
    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 - 1][j - 1].empty() || possibleRowE[i - 1][j - 1].back() != b[i - 1][j])) possibleRowE[i - 1][j - 1].push_back(b[i - 1][j]);
            if (j < a[i][j - 1] && a[i][j - 1] != m + 1 && (possibleColE[i - 1][j - 1].empty() || possibleColE[i - 1][j - 1].back() != a[i][j - 1])) possibleColE[i - 1][j - 1].push_back(a[i][j - 1]);
        }
    }
    
    if (n > 700 || m > 700) exit(0);
    for (short rowB = 1 ; rowB + 1 < n ; ++rowB)
    {
        for (short colB = 1 ; colB + 1 < m ; ++colB)
        {
            for (short &rowE : possibleRowE[rowB][colB])
            {
                for (short &colE : possibleColE[rowB][colB])
                {
                    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:64:81: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   64 |                 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:132:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  132 |         while (st.size()) st.pop(); st.push(m + 1);
      |         ^~~~~
rect.cpp:132:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  132 |         while (st.size()) st.pop(); st.push(m + 1);
      |                                     ^~
rect.cpp:144:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  144 |         while (st.size()) st.pop(); st.push(0);
      |         ^~~~~
rect.cpp:144:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  144 |         while (st.size()) st.pop(); st.push(0);
      |                                     ^~
rect.cpp:159:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  159 |         while (st.size()) st.pop(); st.push(n + 1);
      |         ^~~~~
rect.cpp:159:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  159 |         while (st.size()) st.pop(); st.push(n + 1);
      |                                     ^~
rect.cpp:171:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  171 |         while (st.size()) st.pop(); st.push(0);
      |         ^~~~~
rect.cpp:171:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  171 |         while (st.size()) st.pop(); st.push(0);
      |                                     ^~
rect.cpp:187:29: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
  187 |         if ((1 << getLOG[i] + 1) < i) getLOG[i]++;
      |                   ~~~~~~~~~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 296468 KB Output is correct
2 Correct 106 ms 297556 KB Output is correct
3 Correct 106 ms 297552 KB Output is correct
4 Correct 111 ms 297468 KB Output is correct
5 Correct 112 ms 297396 KB Output is correct
6 Correct 105 ms 297608 KB Output is correct
7 Correct 116 ms 297296 KB Output is correct
8 Correct 108 ms 296784 KB Output is correct
9 Correct 117 ms 297552 KB Output is correct
10 Correct 115 ms 297524 KB Output is correct
11 Correct 128 ms 297552 KB Output is correct
12 Correct 114 ms 297552 KB Output is correct
13 Correct 104 ms 296272 KB Output is correct
14 Correct 105 ms 296516 KB Output is correct
15 Correct 123 ms 296532 KB Output is correct
16 Correct 120 ms 296276 KB Output is correct
17 Correct 122 ms 296276 KB Output is correct
18 Correct 114 ms 296272 KB Output is correct
19 Correct 115 ms 297512 KB Output is correct
20 Correct 105 ms 297292 KB Output is correct
21 Correct 110 ms 296508 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 296468 KB Output is correct
2 Correct 106 ms 297556 KB Output is correct
3 Correct 106 ms 297552 KB Output is correct
4 Correct 111 ms 297468 KB Output is correct
5 Correct 112 ms 297396 KB Output is correct
6 Correct 105 ms 297608 KB Output is correct
7 Correct 116 ms 297296 KB Output is correct
8 Correct 108 ms 296784 KB Output is correct
9 Correct 117 ms 297552 KB Output is correct
10 Correct 115 ms 297524 KB Output is correct
11 Correct 128 ms 297552 KB Output is correct
12 Correct 114 ms 297552 KB Output is correct
13 Correct 104 ms 296272 KB Output is correct
14 Correct 105 ms 296516 KB Output is correct
15 Correct 123 ms 296532 KB Output is correct
16 Correct 120 ms 296276 KB Output is correct
17 Correct 122 ms 296276 KB Output is correct
18 Correct 114 ms 296272 KB Output is correct
19 Correct 115 ms 297512 KB Output is correct
20 Correct 105 ms 297292 KB Output is correct
21 Correct 110 ms 296508 KB Output is correct
22 Correct 106 ms 300248 KB Output is correct
23 Correct 108 ms 300404 KB Output is correct
24 Correct 112 ms 300372 KB Output is correct
25 Correct 108 ms 300156 KB Output is correct
26 Correct 113 ms 300044 KB Output is correct
27 Correct 139 ms 300192 KB Output is correct
28 Correct 112 ms 300116 KB Output is correct
29 Correct 100 ms 299348 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 296468 KB Output is correct
2 Correct 106 ms 297556 KB Output is correct
3 Correct 106 ms 297552 KB Output is correct
4 Correct 111 ms 297468 KB Output is correct
5 Correct 112 ms 297396 KB Output is correct
6 Correct 105 ms 297608 KB Output is correct
7 Correct 116 ms 297296 KB Output is correct
8 Correct 108 ms 296784 KB Output is correct
9 Correct 117 ms 297552 KB Output is correct
10 Correct 115 ms 297524 KB Output is correct
11 Correct 128 ms 297552 KB Output is correct
12 Correct 114 ms 297552 KB Output is correct
13 Correct 104 ms 296272 KB Output is correct
14 Correct 105 ms 296516 KB Output is correct
15 Correct 123 ms 296532 KB Output is correct
16 Correct 120 ms 296276 KB Output is correct
17 Correct 106 ms 300248 KB Output is correct
18 Correct 108 ms 300404 KB Output is correct
19 Correct 112 ms 300372 KB Output is correct
20 Correct 108 ms 300156 KB Output is correct
21 Correct 113 ms 300044 KB Output is correct
22 Correct 139 ms 300192 KB Output is correct
23 Correct 112 ms 300116 KB Output is correct
24 Correct 100 ms 299348 KB Output is correct
25 Correct 122 ms 296276 KB Output is correct
26 Correct 114 ms 296272 KB Output is correct
27 Correct 115 ms 297512 KB Output is correct
28 Correct 105 ms 297292 KB Output is correct
29 Correct 110 ms 296508 KB Output is correct
30 Correct 124 ms 310608 KB Output is correct
31 Correct 116 ms 310488 KB Output is correct
32 Correct 121 ms 310608 KB Output is correct
33 Correct 116 ms 308816 KB Output is correct
34 Correct 120 ms 309332 KB Output is correct
35 Correct 122 ms 309456 KB Output is correct
36 Correct 126 ms 309184 KB Output is correct
37 Correct 114 ms 309076 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 296468 KB Output is correct
2 Correct 106 ms 297556 KB Output is correct
3 Correct 106 ms 297552 KB Output is correct
4 Correct 111 ms 297468 KB Output is correct
5 Correct 112 ms 297396 KB Output is correct
6 Correct 105 ms 297608 KB Output is correct
7 Correct 116 ms 297296 KB Output is correct
8 Correct 108 ms 296784 KB Output is correct
9 Correct 117 ms 297552 KB Output is correct
10 Correct 115 ms 297524 KB Output is correct
11 Correct 128 ms 297552 KB Output is correct
12 Correct 114 ms 297552 KB Output is correct
13 Correct 104 ms 296272 KB Output is correct
14 Correct 105 ms 296516 KB Output is correct
15 Correct 123 ms 296532 KB Output is correct
16 Correct 120 ms 296276 KB Output is correct
17 Correct 106 ms 300248 KB Output is correct
18 Correct 108 ms 300404 KB Output is correct
19 Correct 112 ms 300372 KB Output is correct
20 Correct 108 ms 300156 KB Output is correct
21 Correct 113 ms 300044 KB Output is correct
22 Correct 139 ms 300192 KB Output is correct
23 Correct 112 ms 300116 KB Output is correct
24 Correct 100 ms 299348 KB Output is correct
25 Correct 124 ms 310608 KB Output is correct
26 Correct 116 ms 310488 KB Output is correct
27 Correct 121 ms 310608 KB Output is correct
28 Correct 116 ms 308816 KB Output is correct
29 Correct 120 ms 309332 KB Output is correct
30 Correct 122 ms 309456 KB Output is correct
31 Correct 126 ms 309184 KB Output is correct
32 Correct 114 ms 309076 KB Output is correct
33 Correct 122 ms 296276 KB Output is correct
34 Correct 114 ms 296272 KB Output is correct
35 Correct 115 ms 297512 KB Output is correct
36 Correct 105 ms 297292 KB Output is correct
37 Correct 110 ms 296508 KB Output is correct
38 Correct 193 ms 392720 KB Output is correct
39 Correct 196 ms 385108 KB Output is correct
40 Correct 177 ms 385284 KB Output is correct
41 Correct 1089 ms 377668 KB Output is correct
42 Correct 228 ms 406612 KB Output is correct
43 Correct 217 ms 406612 KB Output is correct
44 Correct 221 ms 406612 KB Output is correct
45 Correct 212 ms 399728 KB Output is correct
46 Correct 209 ms 383856 KB Output is correct
47 Correct 211 ms 386384 KB Output is correct
48 Correct 269 ms 391252 KB Output is correct
49 Correct 273 ms 391504 KB Output is correct
50 Correct 194 ms 354388 KB Output is correct
51 Correct 204 ms 346704 KB Output is correct
52 Correct 268 ms 390124 KB Output is correct
53 Correct 297 ms 390276 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 118 ms 317824 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 296276 KB Output is correct
2 Correct 114 ms 296272 KB Output is correct
3 Correct 115 ms 297512 KB Output is correct
4 Correct 105 ms 297292 KB Output is correct
5 Correct 110 ms 296508 KB Output is correct
6 Correct 110 ms 296528 KB Output is correct
7 Incorrect 634 ms 697684 KB Unexpected end of file - token expected
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 296468 KB Output is correct
2 Correct 106 ms 297556 KB Output is correct
3 Correct 106 ms 297552 KB Output is correct
4 Correct 111 ms 297468 KB Output is correct
5 Correct 112 ms 297396 KB Output is correct
6 Correct 105 ms 297608 KB Output is correct
7 Correct 116 ms 297296 KB Output is correct
8 Correct 108 ms 296784 KB Output is correct
9 Correct 117 ms 297552 KB Output is correct
10 Correct 115 ms 297524 KB Output is correct
11 Correct 128 ms 297552 KB Output is correct
12 Correct 114 ms 297552 KB Output is correct
13 Correct 104 ms 296272 KB Output is correct
14 Correct 105 ms 296516 KB Output is correct
15 Correct 123 ms 296532 KB Output is correct
16 Correct 120 ms 296276 KB Output is correct
17 Correct 106 ms 300248 KB Output is correct
18 Correct 108 ms 300404 KB Output is correct
19 Correct 112 ms 300372 KB Output is correct
20 Correct 108 ms 300156 KB Output is correct
21 Correct 113 ms 300044 KB Output is correct
22 Correct 139 ms 300192 KB Output is correct
23 Correct 112 ms 300116 KB Output is correct
24 Correct 100 ms 299348 KB Output is correct
25 Correct 124 ms 310608 KB Output is correct
26 Correct 116 ms 310488 KB Output is correct
27 Correct 121 ms 310608 KB Output is correct
28 Correct 116 ms 308816 KB Output is correct
29 Correct 120 ms 309332 KB Output is correct
30 Correct 122 ms 309456 KB Output is correct
31 Correct 126 ms 309184 KB Output is correct
32 Correct 114 ms 309076 KB Output is correct
33 Correct 193 ms 392720 KB Output is correct
34 Correct 196 ms 385108 KB Output is correct
35 Correct 177 ms 385284 KB Output is correct
36 Correct 1089 ms 377668 KB Output is correct
37 Correct 228 ms 406612 KB Output is correct
38 Correct 217 ms 406612 KB Output is correct
39 Correct 221 ms 406612 KB Output is correct
40 Correct 212 ms 399728 KB Output is correct
41 Correct 209 ms 383856 KB Output is correct
42 Correct 211 ms 386384 KB Output is correct
43 Correct 269 ms 391252 KB Output is correct
44 Correct 273 ms 391504 KB Output is correct
45 Correct 194 ms 354388 KB Output is correct
46 Correct 204 ms 346704 KB Output is correct
47 Correct 268 ms 390124 KB Output is correct
48 Correct 297 ms 390276 KB Output is correct
49 Incorrect 118 ms 317824 KB Unexpected end of file - token expected
50 Halted 0 ms 0 KB -