oj.uz

Submission #875893

# Submission time Handle Problem Language Result Execution time Memory
875893 2023-11-20T17:28:36 Z andrei_boaca Rectangles (IOI19_rect) C++17
10 / 100
 538 ms 243184 KB 
#include "rect.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
typedef long long ll;
int v[2505][2505],n,m,up[2505][2505],down[2505][2505],rmq[15][2505],rdown[15][2505],rup[15][2505],loga[2505],dlin[2505],ulin[2505],valmax[2505];
vector<int> who[2505];
int good[2505],last[2505];
int plin[2505][2505],pcol[2505][2505],s[2505][2505];
int aib[2505];
ll ans;
struct date
{
    int poz,up,down;
};
vector<date> lins[2505][2505];
int lft[2505],rgt[2505];
int getmax(int l,int r)
{
    int lg=loga[r-l+1];
    return max(rmq[lg][l],rmq[lg][r-(1<<lg)+1]);
}
int getup(int l,int r)
{
    int lg=loga[r-l+1];
    return max(rup[lg][l],rup[lg][r-(1<<lg)+1]);
}
int getdown(int l,int r)
{
    int lg=loga[r-l+1];
    return min(rdown[lg][l],rdown[lg][r-(1<<lg)+1]);
}
int lsb(int x)
{
    return x&(-x);
}
void update(int poz,int val)
{
    for(int i=poz;i<=n;i+=lsb(i))
        aib[i]+=val;
}
int suma(int poz)
{
    int rez=0;
    for(int i=poz;i>=1;i-=lsb(i))
        rez+=aib[i];
    return rez;
}
bool comp(date a, date b)
{
    return a.up<b.up;
}
void calc(vector<date> a)
{
    vector<date> aux=a;
    sort(aux.begin(),aux.end(),comp);
    reverse(aux.begin(),aux.end());
    vector<int> toerase;
    for(int i=0;i<a.size();i++)
    {
        while(!aux.empty()&&aux.back().up<=a[i].poz)
        {
            update(aux.back().poz,1);
            toerase.push_back(aux.back().poz);
            aux.pop_back();
        }
        int l=a[i].poz;
        int r=a[i].down;
        if(l<=r)
            ans+=suma(r)-suma(l-1);
    }
    for(int i:toerase)
        update(i,-1);
}
long long count_rectangles(vector<vector<int>> A)
{
    n=A.size();
    m=A[0].size();
    for(int i=1;i<=2500;i++)
    {
        for(int bit=0;bit<=13;bit++)
            if((1<<bit)<=i)
                loga[i]=bit;
    }
    if(n<=2||m<=2)
        return 0;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            v[i][j]=A[i-1][j-1];
    for(int j=1;j<=m;j++)
    {
        for(int i=n;i>=1;i--)
        {
            rmq[0][i]=v[i][j];
            for(int k=1;k<=13;k++)
            {
                rmq[k][i]=rmq[k-1][i];
                int poz=i+(1<<(k-1));
                if(poz<=n)
                    rmq[k][i]=max(rmq[k][i],rmq[k-1][poz]);
            }
        }
        for(int i=2;i<n;i++)
        {
            up[i][j]=1e9;
            down[i][j]=0;
            int st=i;
            int dr=n-1;
            while(st<=dr)
            {
                int mij=(st+dr)/2;
                if(getmax(i,mij)<v[i-1][j])
                {
                    down[i][j]=mij;
                    st=mij+1;
                }
                else
                    dr=mij-1;
            }
            st=2;
            dr=i;
            while(st<=dr)
            {
                int mij=(st+dr)/2;
                if(getmax(mij,i)<v[i+1][j])
                {
                    up[i][j]=mij;
                    dr=mij-1;
                }
                else
                    st=mij+1;
            }
        }
    }
    for(int i=2;i<n;i++)
    {
        for(int j=m;j>=1;j--)
        {
            rup[0][j]=up[i][j];
            rdown[0][j]=down[i][j];
            for(int k=1;k<=13;k++)
            {
                rup[k][j]=rup[k-1][j];
                rdown[k][j]=rdown[k-1][j];
                int poz=j+(1<<(k-1));
                if(poz<=m)
                {
                    rup[k][j]=max(rup[k][j],rup[k-1][poz]);
                    rdown[k][j]=min(rdown[k][j],rdown[k-1][poz]);
                }
            }
        }
        deque<int> coada;
        for(int j=1;j<=m;j++)
        {
            while(!coada.empty()&&v[i][j]>=v[i][coada.back()])
                coada.pop_back();
            if(coada.empty())
                lft[j]=0;
            else
                lft[j]=coada.back()+1;
            coada.push_back(j);
        }
        coada.clear();
        for(int j=m;j>=1;j--)
        {
            while(!coada.empty()&&v[i][j]>=v[i][coada.back()])
                coada.pop_back();
            if(coada.empty())
                rgt[j]=m+1;
            else
                rgt[j]=coada.back()-1;
            coada.push_back(j);
        }
        for(int j=1;j<=m;j++)
        {
            int l=lft[j],r=rgt[j];
            if(l>=2&&r<=m-1&&l<=r)
                lins[l][r].push_back({i,getup(l,r),getdown(l,r)});
        }
    }
    for(int c1=2;c1<m;c1++)
        for(int c2=c1;c2<m;c2++)
            if(lins[c1][c2].size()>=1)
            {
                vector<date> a=lins[c1][c2];
                vector<date> vals;
                for(int i=0;i<a.size();i++)
                {
                    if(i==0||a[i].poz==a[i-1].poz+1)
                        vals.push_back(a[i]);
                    else
                    {
                        calc(vals);
                        vals.clear();
                        vals.push_back(a[i]);
                    }
                }
                if(!vals.empty())
                    calc(vals);
            }
    return ans;
}

Compilation message

rect.cpp: In function 'void calc(std::vector<date>)':
rect.cpp:59:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<date>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     for(int i=0;i<a.size();i++)
      |                 ~^~~~~~~~~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:188:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<date>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  188 |                 for(int i=0;i<a.size();i++)
      |                             ~^~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 154448 KB Output is correct
2 Correct 34 ms 160604 KB Output is correct
3 Correct 33 ms 160592 KB Output is correct
4 Correct 33 ms 160588 KB Output is correct
5 Correct 32 ms 160596 KB Output is correct
6 Correct 33 ms 160604 KB Output is correct
7 Correct 33 ms 160556 KB Output is correct
8 Correct 31 ms 154464 KB Output is correct
9 Incorrect 33 ms 160604 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 154448 KB Output is correct
2 Correct 34 ms 160604 KB Output is correct
3 Correct 33 ms 160592 KB Output is correct
4 Correct 33 ms 160588 KB Output is correct
5 Correct 32 ms 160596 KB Output is correct
6 Correct 33 ms 160604 KB Output is correct
7 Correct 33 ms 160556 KB Output is correct
8 Correct 31 ms 154464 KB Output is correct
9 Incorrect 33 ms 160604 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 154448 KB Output is correct
2 Correct 34 ms 160604 KB Output is correct
3 Correct 33 ms 160592 KB Output is correct
4 Correct 33 ms 160588 KB Output is correct
5 Correct 32 ms 160596 KB Output is correct
6 Correct 33 ms 160604 KB Output is correct
7 Correct 33 ms 160556 KB Output is correct
8 Correct 31 ms 154464 KB Output is correct
9 Incorrect 33 ms 160604 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 154448 KB Output is correct
2 Correct 34 ms 160604 KB Output is correct
3 Correct 33 ms 160592 KB Output is correct
4 Correct 33 ms 160588 KB Output is correct
5 Correct 32 ms 160596 KB Output is correct
6 Correct 33 ms 160604 KB Output is correct
7 Correct 33 ms 160556 KB Output is correct
8 Correct 31 ms 154464 KB Output is correct
9 Incorrect 33 ms 160604 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 154456 KB Output is correct
2 Correct 39 ms 154712 KB Output is correct
3 Correct 40 ms 154796 KB Output is correct
4 Correct 32 ms 152276 KB Output is correct
5 Correct 39 ms 154460 KB Output is correct
6 Correct 40 ms 154652 KB Output is correct
7 Correct 43 ms 154508 KB Output is correct
8 Correct 39 ms 154448 KB Output is correct
9 Correct 39 ms 154448 KB Output is correct
10 Correct 33 ms 152404 KB Output is correct
11 Correct 32 ms 152412 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 154476 KB Output is correct
2 Incorrect 538 ms 243184 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 154448 KB Output is correct
2 Correct 34 ms 160604 KB Output is correct
3 Correct 33 ms 160592 KB Output is correct
4 Correct 33 ms 160588 KB Output is correct
5 Correct 32 ms 160596 KB Output is correct
6 Correct 33 ms 160604 KB Output is correct
7 Correct 33 ms 160556 KB Output is correct
8 Correct 31 ms 154464 KB Output is correct
9 Incorrect 33 ms 160604 KB Output isn't correct
10 Halted 0 ms 0 KB -