oj.uz

답안 #875877

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
875877 2023-11-20T16:33:47 Z andrei_boaca Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 171760 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],loga[2505],dlin[2505],ulin[2505],lins[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];
int getmax(int l,int r)
{
    int lg=loga[r-l+1];
    return max(rmq[lg][l],rmq[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;
}
int getsum(int is,int js,int ij,int jj)
{
    return s[ij][jj]-s[is-1][jj]-s[ij][js-1]+s[is-1][js-1];
}
long long zerounu()
{
    ll ans=0;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+v[i][j];
    for(int i=2;i<n;i++)
    {
        pcol[i][m]=0;
        for(int j=m-1;j>=2;j--)
        {
            if(v[i][j]==1)
            {
                pcol[i][j]=0;
                continue;
            }
            if(v[i][j+1]==1)
                pcol[i][j]=j;
            else
                pcol[i][j]=pcol[i][j+1];
        }
    }
    for(int j=2;j<m;j++)
    {
        plin[n][j]=0;
        for(int i=n-1;i>=2;i--)
        {
            if(v[i][j]==1)
            {
                plin[i][j]=0;
                continue;
            }
            if(v[i+1][j]==1)
                plin[i][j]=i;
            else
                plin[i][j]=plin[i+1][j];
        }
    }
    for(int i=2;i<n;i++)
        for(int j=2;j<m;j++)
            if(plin[i][j]>=i&&pcol[i][j]>=j)
            {
                int l1=i,c1=j,l2=plin[i][j],c2=pcol[i][j];
                if(getsum(l1,c1,l2,c2)==0)
                    if(getsum(l1,c1-1,l2,c1-1)==l2-l1+1&&getsum(l1,c2+1,l2,c2+1)==l2-l1+1)
                        if(getsum(l1-1,c1,l1-1,c2)==c2-c1+1&&getsum(l2+1,c1,l2+1,c2)==c2-c1+1)
                            ans++;
            }
    return ans;
}
long long count_rectangles(vector<vector<int>> A)
{
    ll ans=0;
    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;
    bool sub6=1;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            v[i][j]=A[i-1][j-1];
            if(v[i][j]>1)
                sub6=0;
        }
    if(sub6)
        return zerounu();
    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 c1=2;c1<m;c1++)
    {
        for(int i=2;i<n;i++)
        {
            dlin[i]=1e9;
            ulin[i]=0;
            valmax[i]=-1;
        }
        for(int c2=c1;c2<m;c2++)
        {
            for(int i=2;i<n;i++)
                who[i].clear();
            for(int i=2;i<n;i++)
            {
                valmax[i]=max(valmax[i],v[i][c2]);
                dlin[i]=min(dlin[i],down[i][c2]);
                ulin[i]=max(ulin[i],up[i][c2]);
                if(valmax[i]<v[i][c1-1]&&valmax[i]<v[i][c2+1])
                    good[i]=1;
                else
                    good[i]=0;
                if(ulin[i]>=2&&ulin[i]<n&&good[i])
                    who[ulin[i]].push_back(i);
            }
            for(int i=n-1;i>=2;i--)
            {
                if(!good[i])
                {
                    last[i]=0;
                    continue;
                }
                if(good[i+1])
                    last[i]=last[i+1];
                else
                    last[i]=i;
            }
            for(int i=1;i<=n;i++)
                aib[i]=0;
            for(int i=2;i<n;i++)
            {
                for(int j:who[i])
                    update(j,1);
                if(good[i])
                {
                    int st=i;
                    int dr=min(dlin[i],last[i]);
                    if(st<=dr)
                    {
                        int val=suma(dr)-suma(st-1);
                        ans+=val;
                    }
                }
            }
        }
    }
    return ans;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6648 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12632 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6648 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12632 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 4 ms 12632 KB Output is correct
23 Correct 4 ms 12636 KB Output is correct
24 Correct 4 ms 12636 KB Output is correct
25 Correct 3 ms 12636 KB Output is correct
26 Correct 4 ms 12816 KB Output is correct
27 Correct 4 ms 12636 KB Output is correct
28 Correct 4 ms 12636 KB Output is correct
29 Correct 2 ms 12632 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6648 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12632 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 4 ms 12632 KB Output is correct
18 Correct 4 ms 12636 KB Output is correct
19 Correct 4 ms 12636 KB Output is correct
20 Correct 3 ms 12636 KB Output is correct
21 Correct 4 ms 12816 KB Output is correct
22 Correct 4 ms 12636 KB Output is correct
23 Correct 4 ms 12636 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 2 ms 14684 KB Output is correct
28 Correct 2 ms 14684 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 29 ms 12888 KB Output is correct
31 Correct 31 ms 12892 KB Output is correct
32 Correct 33 ms 12892 KB Output is correct
33 Correct 29 ms 12892 KB Output is correct
34 Correct 32 ms 12888 KB Output is correct
35 Correct 33 ms 12888 KB Output is correct
36 Correct 37 ms 12892 KB Output is correct
37 Correct 32 ms 13144 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6648 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12632 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 4 ms 12632 KB Output is correct
18 Correct 4 ms 12636 KB Output is correct
19 Correct 4 ms 12636 KB Output is correct
20 Correct 3 ms 12636 KB Output is correct
21 Correct 4 ms 12816 KB Output is correct
22 Correct 4 ms 12636 KB Output is correct
23 Correct 4 ms 12636 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct
25 Correct 29 ms 12888 KB Output is correct
26 Correct 31 ms 12892 KB Output is correct
27 Correct 33 ms 12892 KB Output is correct
28 Correct 29 ms 12892 KB Output is correct
29 Correct 32 ms 12888 KB Output is correct
30 Correct 33 ms 12888 KB Output is correct
31 Correct 37 ms 12892 KB Output is correct
32 Correct 32 ms 13144 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 2 ms 14684 KB Output is correct
36 Correct 2 ms 14684 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1179 ms 35084 KB Output is correct
39 Correct 1198 ms 35096 KB Output is correct
40 Correct 1133 ms 35156 KB Output is correct
41 Correct 1161 ms 35152 KB Output is correct
42 Correct 1169 ms 35088 KB Output is correct
43 Correct 1168 ms 35084 KB Output is correct
44 Correct 1190 ms 35084 KB Output is correct
45 Correct 1146 ms 34828 KB Output is correct
46 Correct 22 ms 42332 KB Output is correct
47 Correct 1133 ms 35108 KB Output is correct
48 Correct 1149 ms 34908 KB Output is correct
49 Correct 1178 ms 35408 KB Output is correct
50 Correct 311 ms 33416 KB Output is correct
51 Correct 574 ms 20836 KB Output is correct
52 Correct 1131 ms 34896 KB Output is correct
53 Correct 1164 ms 35108 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 6740 KB Output is correct
2 Correct 23 ms 6644 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 29 ms 6664 KB Output is correct
6 Correct 29 ms 6492 KB Output is correct
7 Correct 28 ms 6492 KB Output is correct
8 Correct 30 ms 6492 KB Output is correct
9 Correct 28 ms 6488 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 100 ms 80492 KB Output is correct
8 Correct 230 ms 161568 KB Output is correct
9 Correct 214 ms 162156 KB Output is correct
10 Correct 210 ms 162072 KB Output is correct
11 Correct 74 ms 88320 KB Output is correct
12 Correct 140 ms 158280 KB Output is correct
13 Correct 149 ms 162064 KB Output is correct

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6648 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12632 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12632 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 4 ms 12632 KB Output is correct
18 Correct 4 ms 12636 KB Output is correct
19 Correct 4 ms 12636 KB Output is correct
20 Correct 3 ms 12636 KB Output is correct
21 Correct 4 ms 12816 KB Output is correct
22 Correct 4 ms 12636 KB Output is correct
23 Correct 4 ms 12636 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct
25 Correct 29 ms 12888 KB Output is correct
26 Correct 31 ms 12892 KB Output is correct
27 Correct 33 ms 12892 KB Output is correct
28 Correct 29 ms 12892 KB Output is correct
29 Correct 32 ms 12888 KB Output is correct
30 Correct 33 ms 12888 KB Output is correct
31 Correct 37 ms 12892 KB Output is correct
32 Correct 32 ms 13144 KB Output is correct
33 Correct 1179 ms 35084 KB Output is correct
34 Correct 1198 ms 35096 KB Output is correct
35 Correct 1133 ms 35156 KB Output is correct
36 Correct 1161 ms 35152 KB Output is correct
37 Correct 1169 ms 35088 KB Output is correct
38 Correct 1168 ms 35084 KB Output is correct
39 Correct 1190 ms 35084 KB Output is correct
40 Correct 1146 ms 34828 KB Output is correct
41 Correct 22 ms 42332 KB Output is correct
42 Correct 1133 ms 35108 KB Output is correct
43 Correct 1149 ms 34908 KB Output is correct
44 Correct 1178 ms 35408 KB Output is correct
45 Correct 311 ms 33416 KB Output is correct
46 Correct 574 ms 20836 KB Output is correct
47 Correct 1131 ms 34896 KB Output is correct
48 Correct 1164 ms 35108 KB Output is correct
49 Correct 39 ms 6740 KB Output is correct
50 Correct 23 ms 6644 KB Output is correct
51 Correct 1 ms 8540 KB Output is correct
52 Correct 1 ms 4444 KB Output is correct
53 Correct 29 ms 6664 KB Output is correct
54 Correct 29 ms 6492 KB Output is correct
55 Correct 28 ms 6492 KB Output is correct
56 Correct 30 ms 6492 KB Output is correct
57 Correct 28 ms 6488 KB Output is correct
58 Correct 1 ms 4440 KB Output is correct
59 Correct 1 ms 4444 KB Output is correct
60 Correct 1 ms 8540 KB Output is correct
61 Correct 100 ms 80492 KB Output is correct
62 Correct 230 ms 161568 KB Output is correct
63 Correct 214 ms 162156 KB Output is correct
64 Correct 210 ms 162072 KB Output is correct
65 Correct 74 ms 88320 KB Output is correct
66 Correct 140 ms 158280 KB Output is correct
67 Correct 149 ms 162064 KB Output is correct
68 Correct 1 ms 4444 KB Output is correct
69 Correct 1 ms 4444 KB Output is correct
70 Correct 2 ms 14684 KB Output is correct
71 Correct 2 ms 14684 KB Output is correct
72 Correct 1 ms 4444 KB Output is correct
73 Execution timed out 5073 ms 171760 KB Time limit exceeded
74 Halted 0 ms 0 KB -