Submission #285532

#	Time	Username	Problem	Language	Result	Execution time	Memory
285532		MKopchev	Rectangles (IOI19_rect)	C++14	72 / 100	5067 ms	273832 KiB

rect

#include "rect.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=2500+42;

int bigger_up[nmax][nmax],bigger_down[nmax][nmax],bigger_right[nmax][nmax],bigger_left[nmax][nmax];

stack<int> active,idle;

int pointer=0;

struct rect
{
    int x1,y1,x2,y2;
};

rect to_test[nmax*nmax];

bool cmp(rect a,rect b)
{
    if(a.x1!=b.x1)return a.x1<b.x1;
    if(a.y1!=b.y1)return a.y1<b.y1;
    if(a.x2!=b.x2)return a.x2<b.x2;
    return a.y2<b.y2;
}

bool eq(rect a,rect b)
{
    return a.x1==b.x1&&a.y1==b.y1&&a.x2==b.x2&&a.y2==b.y2;
}

bool test(rect a)
{
    //cout<<"to test "<<a.x1<<" "<<a.y1<<" "<<a.x2<<" "<<a.y2<<endl;

    for(int j=a.y1;j<=a.y2;j++)
    {
        //cout<<"j= "<<j<<endl;

        if(bigger_down[a.x1-1][j]<=a.x2)return 0;
        if(bigger_up[a.x2+1][j]>=a.x1)return 0;
    }

    for(int i=a.x1;i<=a.x2;i++)
    {
        //cout<<"i= "<<i<<endl;

        if(bigger_right[i][a.y1-1]<=a.y2)return 0;
        if(bigger_left[i][a.y2+1]>=a.y1)return 0;
    }

    //cout<<"ok"<<endl;

    return 1;
}

vector< vector<int> > inp;

void eval(int type)//1=> bigger, 0=> bigger or equal
{
    int n=inp.size();
	int m=inp[0].size();

	for(int i=0;i<n;i++)
    {
        active=idle;

        for(int j=0;j<m;j++)
        {
            while(active.size()&&inp[i][active.top()]+type<=inp[i][j])active.pop();

            if(active.size())bigger_left[i][j]=active.top();
            else bigger_left[i][j]=-1;

            active.push(j);
        }
    }

    for(int i=0;i<n;i++)
    {
        active=idle;

        for(int j=m-1;j>=0;j--)
        {
            while(active.size()&&inp[i][active.top()]+type<=inp[i][j])active.pop();

            if(active.size())bigger_right[i][j]=active.top();
            else bigger_right[i][j]=m;

            active.push(j);
        }
    }

    for(int j=0;j<m;j++)
    {
        active=idle;

        for(int i=0;i<n;i++)
        {
            while(active.size()&&inp[active.top()][j]+type<=inp[i][j])active.pop();

            if(active.size())bigger_up[i][j]=active.top();
            else bigger_up[i][j]=-1;

            active.push(i);
        }
    }

    for(int j=0;j<m;j++)
    {
        active=idle;

        for(int i=n-1;i>=0;i--)
        {
            while(active.size()&&inp[active.top()][j]+type<=inp[i][j])active.pop();

            if(active.size())bigger_down[i][j]=active.top();
            else bigger_down[i][j]=n;

            active.push(i);
        }
    }
}

long long count_rectangles(std::vector<std::vector<int> > a)
{
    inp=a;

    int n=inp.size();
	int m=inp[0].size();

    eval(0);
    /*
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
        {
            cout<<i<<" "<<j<<" -> "<<bigger_up[i][j]<<" "<<bigger_right[i][j]<<" "<<bigger_down[i][j]<<" "<<bigger_left[i][j]<<endl;
        }
    */

    pointer=0;

    for(int i=1;i<n-1;i++)
        for(int j=1;j<m-1;j++)
        {
            rect cur;

            cur.x1=bigger_up[i][j]+1;
            cur.y1=bigger_left[i][j]+1;
            cur.x2=bigger_down[i][j]-1;
            cur.y2=bigger_right[i][j]-1;

            //cout<<i<<" "<<j<<" -> "<<cur.x1<<" "<<cur.y1<<" "<<cur.x2<<" "<<cur.y2<<endl;

            if(1<=cur.x1&&cur.x2<=n-2&&1<=cur.y1&&cur.y2<=m-2)
            {
                pointer++;

                to_test[pointer]=cur;
            }
        }

    sort(to_test+1,to_test+pointer+1,cmp);

    eval(1);

    int outp=0;

    for(int i=1;i<=pointer;i++)
    {
        if(eq(to_test[i-1],to_test[i]))continue;

        outp+=test(to_test[i]);
    }

    return outp;
}

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