oj.uz

Submission #280519

# Submission time Handle Problem Language Result Execution time Memory
280519 2020-08-22T21:22:42 Z stoyan_malinin Rectangles (IOI19_rect) C++14
59 / 100
 5000 ms 518392 KB 
#include "rect.h"
//#include "grader.cpp"

#include <stack>
#include <deque>
#include <vector>
#include <assert.h>
#include <iostream>

using namespace std;

const int MAXN = 2505;
const int MAXLog = 15;

struct FenwickTree
{
    vector <int> tree;

    FenwickTree(){}
    FenwickTree(int n)
    {
        this->tree.assign(n+5, 0);
    }

    void update(int ind, int val)
    {
        ind++;
        while(ind<tree.size())
        {
            tree[ind] += val;
            ind += ind&(-ind);
        }
    }

    int query(int ind)
    {
        ind++;
        int sum = 0;

        while(ind>0)
        {
            sum += tree[ind];
            ind -= ind&(-ind);
        }

        return sum;
    }
};

int n, m;
int a[MAXN][MAXN];

int helpRotate[MAXN][MAXN];
void rotate90()
{
    for(int j = 0;j<m;j++)
        for(int i = n-1;i>=0;i--)
            helpRotate[j][n - 1 - i] = a[i][j];

    swap(n, m);
    for(int i = 0;i<n;i++)
        for(int j = 0;j<m;j++)
        a[i][j] = helpRotate[i][j];
}

int rightBad[MAXN][MAXN], leftBad[MAXN][MAXN];
int downBad[MAXN][MAXN][20], upBad[MAXN][MAXN][20];

int logVal[MAXN];

void initSparse(int sparse[MAXN][MAXN][20], int row, int mode)
{
    for(int step = 1;step<=MAXLog;step++)
    {
        for(int j = 0;j<m;j++)
        {
            if(j+(1<<(step-1))<m)
            {
                if(mode==0)
                    sparse[row][j][step] = min(sparse[row][j][step-1], sparse[row][j+(1<<(step-1))][step-1]);
                else
                    sparse[row][j][step] = max(sparse[row][j][step-1], sparse[row][j+(1<<(step-1))][step-1]);
            }
            else
            {
                sparse[row][j][step] = sparse[row][j][step-1];
            }
        }
    }
}

void init()
{
    //if(n<m) rotate90();

    logVal[0] = logVal[1] = 0;
    for(int i = 2;i<=max(n, m)+2;i++)
    {
        logVal[i] = logVal[i/2] + 1;
    }

    for(int i = 0;i<n;i++)
    {
        stack <int> st;
        for(int j = 0;j<m;j++)
        {
            while(st.empty()==false && a[i][st.top()]<a[i][j]) st.pop();
            leftBad[i][j] = ((st.empty()==true)?-1:st.top());

            st.push(j);
        }

        while(st.empty()==false) st.pop();
        for(int j = m-1;j>=0;j--)
        {
            while(st.empty()==false && a[i][st.top()]<a[i][j]) st.pop();
            rightBad[i][j] = ((st.empty()==true)?m-1:st.top());

            st.push(j);
        }
    }

    for(int j = 0;j<m;j++)
    {
        stack <int> st;
        for(int i = 0;i<n;i++)
        {
            while(st.empty()==false && a[st.top()][j]<a[i][j]) st.pop();
            upBad[i][j][0] = ((st.empty()==true)?-1:st.top());

            st.push(i);
        }

        while(st.empty()==false) st.pop();
        for(int i = n-1;i>=0;i--)
        {
            while(st.empty()==false && a[st.top()][j]<a[i][j]) st.pop();
            downBad[i][j][0] = ((st.empty()==true)?n-1:st.top());

            st.push(i);
        }
    }

    for(int row = 0;row<n;row++)
    {
        initSparse(downBad, row, 0);
        initSparse(upBad, row, 1);
    }
}

int getVal(int row, int l, int r, int sparse[MAXN][MAXN][20], int mode)
{
    int log2 = logVal[r-l+1];

    if(mode==0)
    {
        if(l>r) return n;
        return min(sparse[row][l][log2], sparse[row][r-(1<<log2)+1][log2]);
    }
    else
    {
        if(l>r) return -1;
        return max(sparse[row][l][log2], sparse[row][r-(1<<log2)+1][log2]);
    }
}

vector <int> toRemove[MAXN];
long long evalRowSeq(int lRow, int rRow, int c1, int c2)
{
    if(lRow>rRow) return 0;

    FenwickTree T(n);
    for(int row = rRow;row>=lRow;row--)
    {
        toRemove[row].clear();
    }

    int ans = 0;
    for(int row = rRow;row>=lRow;row--)
    {
        int maxRow = getVal(row-1, c1+1, c2-1, downBad, 0);

        T.update(row, +1);
        toRemove[getVal(row+1, c1+1, c2-1, upBad, 1)].push_back(row);

        for(int x: toRemove[row]) T.update(x, -1);

        ans += T.query(min(maxRow-1, rRow));
        //if(c1==0 && c2==2) cout << "add " << row << " until " << getVal(row+1, c1+1, c2-1, upBad, 1) << '\n';
    }

    return ans;
}

long long evalN3log()
{
    long long answer = 0;
    for(int c1 = 0;c1<m;c1++)
    {
        for(int c2 = c1+2;c2<m;c2++)
        {
            int ind = 1;
            while(ind<n-1)
            {
                int l = ind;
                while(ind<n-1 && rightBad[ind][c1]>=c2 && leftBad[ind][c2]<=c1) ind++;

                answer += evalRowSeq(l, ind-1, c1, c2);
                ind++;
            }
        }
    }

    return answer;
}

long long count_rectangles(vector<vector<int>> _a)
{
    n = _a.size();
    m = _a[0].size();
    for(int i = 0;i<n;i++)
        for(int j = 0;j<m;j++)
            a[i][j] = _a[i][j];

    init();
    return evalN3log();

    /*
    cout << '\n';
    for(int i = 0;i<n;i++)
    {
        for(int j = 0;j<m;j++) cout << a[i][j] << " ";
        cout << '\n';
    }
    cout << '\n';

    cout << '\n';
    for(int i = 0;i<n;i++)
    {
        for(int j = 0;j<m;j++) cout << downBad[i][j][0] << " ";
        cout << '\n';
    }
    cout << '\n';
    */


}
/*
6 5
4 8 7 5 6
7 4 10 3 5
9 7 20 14 2
9 14 7 3 6
5 7 5 2 7
4 5 13 5 6
*/

Compilation message

rect.cpp: In member function 'void FenwickTree::update(int, int)':
rect.cpp:28:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         while(ind<tree.size())
      |               ~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 2 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 640 KB Output is correct
15 Correct 1 ms 640 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 1208 KB Output is correct
20 Correct 1 ms 1152 KB Output is correct
21 Correct 1 ms 640 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 2 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 640 KB Output is correct
15 Correct 1 ms 640 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 5 ms 3200 KB Output is correct
18 Correct 5 ms 3200 KB Output is correct
19 Correct 5 ms 3200 KB Output is correct
20 Correct 5 ms 3200 KB Output is correct
21 Correct 6 ms 3200 KB Output is correct
22 Correct 6 ms 3200 KB Output is correct
23 Correct 6 ms 3272 KB Output is correct
24 Correct 3 ms 2688 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 1208 KB Output is correct
28 Correct 1 ms 1152 KB Output is correct
29 Correct 1 ms 640 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 2 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 640 KB Output is correct
15 Correct 1 ms 640 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 5 ms 3200 KB Output is correct
18 Correct 5 ms 3200 KB Output is correct
19 Correct 5 ms 3200 KB Output is correct
20 Correct 5 ms 3200 KB Output is correct
21 Correct 6 ms 3200 KB Output is correct
22 Correct 6 ms 3200 KB Output is correct
23 Correct 6 ms 3272 KB Output is correct
24 Correct 3 ms 2688 KB Output is correct
25 Correct 48 ms 11852 KB Output is correct
26 Correct 48 ms 11776 KB Output is correct
27 Correct 50 ms 11904 KB Output is correct
28 Correct 44 ms 11648 KB Output is correct
29 Correct 51 ms 11792 KB Output is correct
30 Correct 59 ms 12032 KB Output is correct
31 Correct 58 ms 11896 KB Output is correct
32 Correct 50 ms 11776 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 1208 KB Output is correct
36 Correct 1 ms 1152 KB Output is correct
37 Correct 1 ms 640 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 2 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 640 KB Output is correct
15 Correct 1 ms 640 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 5 ms 3200 KB Output is correct
18 Correct 5 ms 3200 KB Output is correct
19 Correct 5 ms 3200 KB Output is correct
20 Correct 5 ms 3200 KB Output is correct
21 Correct 6 ms 3200 KB Output is correct
22 Correct 6 ms 3200 KB Output is correct
23 Correct 6 ms 3272 KB Output is correct
24 Correct 3 ms 2688 KB Output is correct
25 Correct 48 ms 11852 KB Output is correct
26 Correct 48 ms 11776 KB Output is correct
27 Correct 50 ms 11904 KB Output is correct
28 Correct 44 ms 11648 KB Output is correct
29 Correct 51 ms 11792 KB Output is correct
30 Correct 59 ms 12032 KB Output is correct
31 Correct 58 ms 11896 KB Output is correct
32 Correct 50 ms 11776 KB Output is correct
33 Correct 2231 ms 103060 KB Output is correct
34 Correct 2621 ms 102952 KB Output is correct
35 Correct 1971 ms 101736 KB Output is correct
36 Correct 2763 ms 101752 KB Output is correct
37 Correct 3488 ms 101880 KB Output is correct
38 Correct 3437 ms 101832 KB Output is correct
39 Correct 3549 ms 101992 KB Output is correct
40 Correct 3064 ms 95244 KB Output is correct
41 Correct 1582 ms 101880 KB Output is correct
42 Correct 1606 ms 101788 KB Output is correct
43 Correct 1824 ms 101880 KB Output is correct
44 Correct 1827 ms 101884 KB Output is correct
45 Correct 579 ms 58872 KB Output is correct
46 Correct 843 ms 51448 KB Output is correct
47 Correct 1741 ms 102072 KB Output is correct
48 Correct 1802 ms 102124 KB Output is correct
49 Correct 0 ms 384 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 1 ms 1208 KB Output is correct
52 Correct 1 ms 1152 KB Output is correct
53 Correct 1 ms 640 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 1792 KB Output is correct
2 Correct 17 ms 1664 KB Output is correct
3 Correct 22 ms 1792 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 23 ms 1792 KB Output is correct
6 Correct 23 ms 1792 KB Output is correct
7 Correct 23 ms 1792 KB Output is correct
8 Correct 27 ms 1792 KB Output is correct
9 Correct 27 ms 1860 KB Output is correct
10 Correct 5 ms 896 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Execution timed out 5118 ms 518392 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 2 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 640 KB Output is correct
15 Correct 1 ms 640 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 5 ms 3200 KB Output is correct
18 Correct 5 ms 3200 KB Output is correct
19 Correct 5 ms 3200 KB Output is correct
20 Correct 5 ms 3200 KB Output is correct
21 Correct 6 ms 3200 KB Output is correct
22 Correct 6 ms 3200 KB Output is correct
23 Correct 6 ms 3272 KB Output is correct
24 Correct 3 ms 2688 KB Output is correct
25 Correct 48 ms 11852 KB Output is correct
26 Correct 48 ms 11776 KB Output is correct
27 Correct 50 ms 11904 KB Output is correct
28 Correct 44 ms 11648 KB Output is correct
29 Correct 51 ms 11792 KB Output is correct
30 Correct 59 ms 12032 KB Output is correct
31 Correct 58 ms 11896 KB Output is correct
32 Correct 50 ms 11776 KB Output is correct
33 Correct 2231 ms 103060 KB Output is correct
34 Correct 2621 ms 102952 KB Output is correct
35 Correct 1971 ms 101736 KB Output is correct
36 Correct 2763 ms 101752 KB Output is correct
37 Correct 3488 ms 101880 KB Output is correct
38 Correct 3437 ms 101832 KB Output is correct
39 Correct 3549 ms 101992 KB Output is correct
40 Correct 3064 ms 95244 KB Output is correct
41 Correct 1582 ms 101880 KB Output is correct
42 Correct 1606 ms 101788 KB Output is correct
43 Correct 1824 ms 101880 KB Output is correct
44 Correct 1827 ms 101884 KB Output is correct
45 Correct 579 ms 58872 KB Output is correct
46 Correct 843 ms 51448 KB Output is correct
47 Correct 1741 ms 102072 KB Output is correct
48 Correct 1802 ms 102124 KB Output is correct
49 Correct 28 ms 1792 KB Output is correct
50 Correct 17 ms 1664 KB Output is correct
51 Correct 22 ms 1792 KB Output is correct
52 Correct 1 ms 512 KB Output is correct
53 Correct 23 ms 1792 KB Output is correct
54 Correct 23 ms 1792 KB Output is correct
55 Correct 23 ms 1792 KB Output is correct
56 Correct 27 ms 1792 KB Output is correct
57 Correct 27 ms 1860 KB Output is correct
58 Correct 5 ms 896 KB Output is correct
59 Correct 5 ms 1280 KB Output is correct
60 Correct 1 ms 640 KB Output is correct
61 Execution timed out 5118 ms 518392 KB Time limit exceeded
62 Halted 0 ms 0 KB -