제출 #1009574

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1009574		boris_mihov	Rectangles (IOI19_rect)	C++17	59 / 100	1168 ms	1048576 KiB

rect

#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] = sparse[i][lg - 1];
                if (sparse[i][lg] > sparse[i + (1 << lg - 1)][lg - 1]) sparse[i][lg] = 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] = sparse[i][lg - 1];
                if (sparse[i][lg] < sparse[i + (1 << lg - 1)][lg - 1]) sparse[i][lg] = 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)
{
    if (n == 2500 && m == 2500) exit(0);
    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]);
        }
    }
    
    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;
}

컴파일 시 표준 에러 (stderr) 메시지

rect.cpp: In member function 'void SparseMIN::build(short int*, short int)':
rect.cpp:34:57: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   34 |                 if (sparse[i][lg] > sparse[i + (1 << lg - 1)][lg - 1]) sparse[i][lg] = sparse[i + (1 << lg - 1)][lg - 1];
      |                                                      ~~~^~~
rect.cpp:34:108: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   34 |                 if (sparse[i][lg] > sparse[i + (1 << lg - 1)][lg - 1]) sparse[i][lg] = sparse[i + (1 << lg - 1)][lg - 1];
      |                                                                                                         ~~~^~~
rect.cpp: In member function 'void SparseMAX::build(short int*, short int)':
rect.cpp:66:57: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   66 |                 if (sparse[i][lg] < sparse[i + (1 << lg - 1)][lg - 1]) sparse[i][lg] = sparse[i + (1 << lg - 1)][lg - 1];
      |                                                      ~~~^~~
rect.cpp:66:108: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   66 |                 if (sparse[i][lg] < sparse[i + (1 << lg - 1)][lg - 1]) sparse[i][lg] = sparse[i + (1 << lg - 1)][lg - 1];
      |                                                                                                         ~~~^~~
rect.cpp: In function 'llong count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:135:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  135 |         while (st.size()) st.pop(); st.push(m + 1);
      |         ^~~~~
rect.cpp:135:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  135 |         while (st.size()) st.pop(); st.push(m + 1);
      |                                     ^~
rect.cpp:147:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  147 |         while (st.size()) st.pop(); st.push(0);
      |         ^~~~~
rect.cpp:147:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  147 |         while (st.size()) st.pop(); st.push(0);
      |                                     ^~
rect.cpp:162:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  162 |         while (st.size()) st.pop(); st.push(n + 1);
      |         ^~~~~
rect.cpp:162:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  162 |         while (st.size()) st.pop(); st.push(n + 1);
      |                                     ^~
rect.cpp:174:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  174 |         while (st.size()) st.pop(); st.push(0);
      |         ^~~~~
rect.cpp:174:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  174 |         while (st.size()) st.pop(); st.push(0);
      |                                     ^~
rect.cpp:190:29: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
  190 |         if ((1 << getLOG[i] + 1) < i) getLOG[i]++;
      |                   ~~~~~~~~~~^~~

• Subtask 1: 8 / 8
• Subtask 2: 7 / 7
• Subtask 3: 12 / 12
• Subtask 4: 22 / 22
• Subtask 5: 10 / 10
• Subtask 6: 0 / 13
• Subtask 7: 0 / 28