oj.uz

답안 #1009544

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1009544 2024-06-27T15:37:58 Z boris_mihov Rectangles (IOI19_rect) C++17
59 / 100
 1374 ms 1048576 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 &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]);
            }
        }
    }
 
    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];
 
bool isOK(short rowB, short colB, short rowE, short colE)
{
    rowB--; colB--; rowE++; 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--;
    return 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)
        {
            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] + 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);
        }
    }
 
    int 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: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

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 296528 KB Output is correct
2 Correct 103 ms 297552 KB Output is correct
3 Correct 105 ms 297552 KB Output is correct
4 Correct 107 ms 297552 KB Output is correct
5 Correct 102 ms 297552 KB Output is correct
6 Correct 112 ms 297552 KB Output is correct
7 Correct 100 ms 297300 KB Output is correct
8 Correct 102 ms 296784 KB Output is correct
9 Correct 108 ms 297584 KB Output is correct
10 Correct 111 ms 297488 KB Output is correct
11 Correct 100 ms 297480 KB Output is correct
12 Correct 107 ms 297556 KB Output is correct
13 Correct 97 ms 296276 KB Output is correct
14 Correct 99 ms 296440 KB Output is correct
15 Correct 99 ms 296528 KB Output is correct
16 Correct 97 ms 296272 KB Output is correct
17 Correct 99 ms 296308 KB Output is correct
18 Correct 101 ms 296272 KB Output is correct
19 Correct 102 ms 297436 KB Output is correct
20 Correct 99 ms 297296 KB Output is correct
21 Correct 98 ms 296668 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 296528 KB Output is correct
2 Correct 103 ms 297552 KB Output is correct
3 Correct 105 ms 297552 KB Output is correct
4 Correct 107 ms 297552 KB Output is correct
5 Correct 102 ms 297552 KB Output is correct
6 Correct 112 ms 297552 KB Output is correct
7 Correct 100 ms 297300 KB Output is correct
8 Correct 102 ms 296784 KB Output is correct
9 Correct 108 ms 297584 KB Output is correct
10 Correct 111 ms 297488 KB Output is correct
11 Correct 100 ms 297480 KB Output is correct
12 Correct 107 ms 297556 KB Output is correct
13 Correct 97 ms 296276 KB Output is correct
14 Correct 99 ms 296440 KB Output is correct
15 Correct 99 ms 296528 KB Output is correct
16 Correct 97 ms 296272 KB Output is correct
17 Correct 99 ms 296308 KB Output is correct
18 Correct 101 ms 296272 KB Output is correct
19 Correct 102 ms 297436 KB Output is correct
20 Correct 99 ms 297296 KB Output is correct
21 Correct 98 ms 296668 KB Output is correct
22 Correct 119 ms 300256 KB Output is correct
23 Correct 102 ms 300368 KB Output is correct
24 Correct 104 ms 300368 KB Output is correct
25 Correct 104 ms 300112 KB Output is correct
26 Correct 110 ms 300112 KB Output is correct
27 Correct 100 ms 300012 KB Output is correct
28 Correct 106 ms 300116 KB Output is correct
29 Correct 95 ms 299348 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 296528 KB Output is correct
2 Correct 103 ms 297552 KB Output is correct
3 Correct 105 ms 297552 KB Output is correct
4 Correct 107 ms 297552 KB Output is correct
5 Correct 102 ms 297552 KB Output is correct
6 Correct 112 ms 297552 KB Output is correct
7 Correct 100 ms 297300 KB Output is correct
8 Correct 102 ms 296784 KB Output is correct
9 Correct 108 ms 297584 KB Output is correct
10 Correct 111 ms 297488 KB Output is correct
11 Correct 100 ms 297480 KB Output is correct
12 Correct 107 ms 297556 KB Output is correct
13 Correct 97 ms 296276 KB Output is correct
14 Correct 99 ms 296440 KB Output is correct
15 Correct 99 ms 296528 KB Output is correct
16 Correct 97 ms 296272 KB Output is correct
17 Correct 119 ms 300256 KB Output is correct
18 Correct 102 ms 300368 KB Output is correct
19 Correct 104 ms 300368 KB Output is correct
20 Correct 104 ms 300112 KB Output is correct
21 Correct 110 ms 300112 KB Output is correct
22 Correct 100 ms 300012 KB Output is correct
23 Correct 106 ms 300116 KB Output is correct
24 Correct 95 ms 299348 KB Output is correct
25 Correct 99 ms 296308 KB Output is correct
26 Correct 101 ms 296272 KB Output is correct
27 Correct 102 ms 297436 KB Output is correct
28 Correct 99 ms 297296 KB Output is correct
29 Correct 98 ms 296668 KB Output is correct
30 Correct 108 ms 310608 KB Output is correct
31 Correct 109 ms 310632 KB Output is correct
32 Correct 114 ms 310612 KB Output is correct
33 Correct 107 ms 308816 KB Output is correct
34 Correct 115 ms 309324 KB Output is correct
35 Correct 125 ms 309412 KB Output is correct
36 Correct 126 ms 309332 KB Output is correct
37 Correct 114 ms 309076 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 296528 KB Output is correct
2 Correct 103 ms 297552 KB Output is correct
3 Correct 105 ms 297552 KB Output is correct
4 Correct 107 ms 297552 KB Output is correct
5 Correct 102 ms 297552 KB Output is correct
6 Correct 112 ms 297552 KB Output is correct
7 Correct 100 ms 297300 KB Output is correct
8 Correct 102 ms 296784 KB Output is correct
9 Correct 108 ms 297584 KB Output is correct
10 Correct 111 ms 297488 KB Output is correct
11 Correct 100 ms 297480 KB Output is correct
12 Correct 107 ms 297556 KB Output is correct
13 Correct 97 ms 296276 KB Output is correct
14 Correct 99 ms 296440 KB Output is correct
15 Correct 99 ms 296528 KB Output is correct
16 Correct 97 ms 296272 KB Output is correct
17 Correct 119 ms 300256 KB Output is correct
18 Correct 102 ms 300368 KB Output is correct
19 Correct 104 ms 300368 KB Output is correct
20 Correct 104 ms 300112 KB Output is correct
21 Correct 110 ms 300112 KB Output is correct
22 Correct 100 ms 300012 KB Output is correct
23 Correct 106 ms 300116 KB Output is correct
24 Correct 95 ms 299348 KB Output is correct
25 Correct 108 ms 310608 KB Output is correct
26 Correct 109 ms 310632 KB Output is correct
27 Correct 114 ms 310612 KB Output is correct
28 Correct 107 ms 308816 KB Output is correct
29 Correct 115 ms 309324 KB Output is correct
30 Correct 125 ms 309412 KB Output is correct
31 Correct 126 ms 309332 KB Output is correct
32 Correct 114 ms 309076 KB Output is correct
33 Correct 99 ms 296308 KB Output is correct
34 Correct 101 ms 296272 KB Output is correct
35 Correct 102 ms 297436 KB Output is correct
36 Correct 99 ms 297296 KB Output is correct
37 Correct 98 ms 296668 KB Output is correct
38 Correct 202 ms 392784 KB Output is correct
39 Correct 202 ms 385228 KB Output is correct
40 Correct 189 ms 385084 KB Output is correct
41 Correct 639 ms 377684 KB Output is correct
42 Correct 222 ms 406744 KB Output is correct
43 Correct 238 ms 406868 KB Output is correct
44 Correct 215 ms 406616 KB Output is correct
45 Correct 219 ms 399696 KB Output is correct
46 Correct 220 ms 383664 KB Output is correct
47 Correct 214 ms 386384 KB Output is correct
48 Correct 272 ms 391504 KB Output is correct
49 Correct 261 ms 391508 KB Output is correct
50 Correct 184 ms 354316 KB Output is correct
51 Correct 182 ms 346640 KB Output is correct
52 Correct 262 ms 390068 KB Output is correct
53 Correct 267 ms 390136 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 317920 KB Output is correct
2 Correct 105 ms 314640 KB Output is correct
3 Correct 111 ms 317708 KB Output is correct
4 Correct 108 ms 296232 KB Output is correct
5 Correct 108 ms 317960 KB Output is correct
6 Correct 106 ms 317780 KB Output is correct
7 Correct 120 ms 317808 KB Output is correct
8 Correct 113 ms 317776 KB Output is correct
9 Correct 120 ms 317824 KB Output is correct
10 Correct 113 ms 317264 KB Output is correct
11 Correct 138 ms 317520 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 296308 KB Output is correct
2 Correct 101 ms 296272 KB Output is correct
3 Correct 102 ms 297436 KB Output is correct
4 Correct 99 ms 297296 KB Output is correct
5 Correct 98 ms 296668 KB Output is correct
6 Correct 122 ms 296532 KB Output is correct
7 Correct 955 ms 697684 KB Output is correct
8 Runtime error 1374 ms 1048576 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 296528 KB Output is correct
2 Correct 103 ms 297552 KB Output is correct
3 Correct 105 ms 297552 KB Output is correct
4 Correct 107 ms 297552 KB Output is correct
5 Correct 102 ms 297552 KB Output is correct
6 Correct 112 ms 297552 KB Output is correct
7 Correct 100 ms 297300 KB Output is correct
8 Correct 102 ms 296784 KB Output is correct
9 Correct 108 ms 297584 KB Output is correct
10 Correct 111 ms 297488 KB Output is correct
11 Correct 100 ms 297480 KB Output is correct
12 Correct 107 ms 297556 KB Output is correct
13 Correct 97 ms 296276 KB Output is correct
14 Correct 99 ms 296440 KB Output is correct
15 Correct 99 ms 296528 KB Output is correct
16 Correct 97 ms 296272 KB Output is correct
17 Correct 119 ms 300256 KB Output is correct
18 Correct 102 ms 300368 KB Output is correct
19 Correct 104 ms 300368 KB Output is correct
20 Correct 104 ms 300112 KB Output is correct
21 Correct 110 ms 300112 KB Output is correct
22 Correct 100 ms 300012 KB Output is correct
23 Correct 106 ms 300116 KB Output is correct
24 Correct 95 ms 299348 KB Output is correct
25 Correct 108 ms 310608 KB Output is correct
26 Correct 109 ms 310632 KB Output is correct
27 Correct 114 ms 310612 KB Output is correct
28 Correct 107 ms 308816 KB Output is correct
29 Correct 115 ms 309324 KB Output is correct
30 Correct 125 ms 309412 KB Output is correct
31 Correct 126 ms 309332 KB Output is correct
32 Correct 114 ms 309076 KB Output is correct
33 Correct 202 ms 392784 KB Output is correct
34 Correct 202 ms 385228 KB Output is correct
35 Correct 189 ms 385084 KB Output is correct
36 Correct 639 ms 377684 KB Output is correct
37 Correct 222 ms 406744 KB Output is correct
38 Correct 238 ms 406868 KB Output is correct
39 Correct 215 ms 406616 KB Output is correct
40 Correct 219 ms 399696 KB Output is correct
41 Correct 220 ms 383664 KB Output is correct
42 Correct 214 ms 386384 KB Output is correct
43 Correct 272 ms 391504 KB Output is correct
44 Correct 261 ms 391508 KB Output is correct
45 Correct 184 ms 354316 KB Output is correct
46 Correct 182 ms 346640 KB Output is correct
47 Correct 262 ms 390068 KB Output is correct
48 Correct 267 ms 390136 KB Output is correct
49 Correct 114 ms 317920 KB Output is correct
50 Correct 105 ms 314640 KB Output is correct
51 Correct 111 ms 317708 KB Output is correct
52 Correct 108 ms 296232 KB Output is correct
53 Correct 108 ms 317960 KB Output is correct
54 Correct 106 ms 317780 KB Output is correct
55 Correct 120 ms 317808 KB Output is correct
56 Correct 113 ms 317776 KB Output is correct
57 Correct 120 ms 317824 KB Output is correct
58 Correct 113 ms 317264 KB Output is correct
59 Correct 138 ms 317520 KB Output is correct
60 Correct 122 ms 296532 KB Output is correct
61 Correct 955 ms 697684 KB Output is correct
62 Runtime error 1374 ms 1048576 KB Execution killed with signal 9
63 Halted 0 ms 0 KB -