oj.uz

Submission #885394

# Submission time Handle Problem Language Result Execution time Memory
885394 2023-12-09T15:10:12 Z alexdd Bomb (IZhO17_bomb) C++17
67 / 100
 1000 ms 59404 KB 
#include<iostream>
using namespace std;
int n,m;
char mat[2505][2505];
int sump[2505][2505];
int mars[2505][2505];
bool verif(int cntx, int cnty)
{
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            mars[i][j]=0;
    for(int i=1;i+cntx-1<=n;i++)
    {
        for(int j=1;j+cnty-1<=m;j++)
        {
            if(sump[i+cntx-1][j+cnty-1] - sump[i+cntx-1][j-1] - sump[i-1][j+cnty-1] + sump[i-1][j-1] == cntx*cnty)///toate is 1
            {
                mars[i][j]++;
                mars[i][j+cnty]--;
                mars[i+cntx][j]--;
                mars[i+cntx][j+cnty]++;
            }
            mars[i][j] += mars[i-1][j] + mars[i][j-1] - mars[i-1][j-1];
            if(mars[i][j]==0 && mat[i][j]=='1')
                return 0;
        }
    }
    return 1;
}
void solve_n3_y(int minx, int miny)
{
    int poz=0, mxm=0;
    for(int i=minx;i>0;i--)
    {
        if(i*miny <= mxm)
            break;
        while(poz+1<=miny && verif(i,poz+1))
        {
            poz++;
        }
        mxm = max(mxm, i*poz);
    }
    cout<<mxm;
}
void solve_n3_x(int minx, int miny)
{
    int poz=0, mxm=0;
    for(int i=miny;i>0;i--)
    {
        if(i*minx <= mxm)
            break;
        while(poz+1<=minx && verif(poz+1,i))
        {
            poz++;
        }
        mxm = max(mxm, i*poz);
    }
    cout<<mxm;
}
void solve_bulaneala(int minx, int miny)
{
    int mxm=0,prec=1;
    for(int i=miny;i>max(0,miny-4);i--)
    {
        if(i*minx <= mxm)
            break;
        int st,dr,mij,ans=0;
        st=prec;
        dr=minx;
        while(st<=dr)
        {
            mij=(st+dr)/2;
            if(verif(mij,i))
            {
                ans = max(ans, mij);
                st=mij+1;
            }
            else
            {
                dr=mij-1;
            }
        }
        mxm = max(mxm, i*ans);
        prec=ans;
    }
    prec=1;
    for(int i=minx;i>max(0,minx-4);i--)
    {
        if(i*miny <= mxm)
            break;
        int st,dr,mij,ans=0;
        st=prec;
        dr=miny;
        while(st<=dr)
        {
            mij=(st+dr)/2;
            if(verif(i,mij))
            {
                ans = max(ans, mij);
                st=mij+1;
            }
            else
            {
                dr=mij-1;
            }
        }
        mxm = max(mxm, i*ans);
        prec=ans;
    }
    cout<<mxm;
}
signed main()
{
    cin>>n>>m;
    int minx=n,miny=m;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            cin>>mat[i][j];
            sump[i][j] = sump[i-1][j] + sump[i][j-1] - sump[i-1][j-1];
            if(mat[i][j]=='1')
                sump[i][j]++;
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(mat[i][j]=='1' && (j==m || mat[i][j+1]=='0'))
            {
                int cnt=0;
                for(int u=j;u>0;u--)
                {
                    if(mat[i][u]=='0')
                        break;
                    cnt++;
                }
                miny = min(miny, cnt);
            }
        }
    }
    for(int i=1;i<=m;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(mat[j][i]=='1' && (j==n || mat[j+1][i]=='0'))
            {
                int cnt=0;
                for(int u=j;u>0;u--)
                {
                    if(mat[u][i]=='0')
                        break;
                    cnt++;
                }
                minx = min(minx, cnt);
            }
        }
    }
    if(1LL*miny * n * m <= 170000000)
    {
        solve_n3_y(minx,miny);
        return 0;
    }
    else if(1LL*minx*n*m <= 170000000)
    {
        solve_n3_x(minx,miny);
        return 0;
    }
    else if(1)
    {
        solve_bulaneala(minx,miny);
        return 0;
    }
    else
    {
        cout<<minx*miny;
        return 0;
    }
    return 0;
}

Subtask #1
67.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4544 KB Output is correct
3 Correct 8 ms 40796 KB Output is correct
4 Correct 9 ms 40796 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2648 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 2 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 1 ms 4956 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 2 ms 4956 KB Output is correct
24 Correct 1 ms 4956 KB Output is correct
25 Correct 2 ms 4956 KB Output is correct
26 Correct 2 ms 4956 KB Output is correct
27 Correct 5 ms 11868 KB Output is correct
28 Correct 8 ms 12124 KB Output is correct
29 Incorrect 31 ms 12100 KB Output isn't correct
30 Correct 32 ms 12120 KB Output is correct
31 Correct 25 ms 12120 KB Output is correct
32 Correct 29 ms 12216 KB Output is correct
33 Correct 90 ms 14428 KB Output is correct
34 Correct 8 ms 10332 KB Output is correct
35 Correct 54 ms 14292 KB Output is correct
36 Correct 24 ms 14424 KB Output is correct
37 Correct 1 ms 4700 KB Output is correct
38 Correct 253 ms 59104 KB Output is correct
39 Correct 1 ms 4696 KB Output is correct
40 Correct 80 ms 22456 KB Output is correct
41 Correct 1 ms 4700 KB Output is correct
42 Correct 2 ms 4956 KB Output is correct
43 Correct 367 ms 58964 KB Output is correct
44 Correct 102 ms 14428 KB Output is correct
45 Incorrect 680 ms 58940 KB Output isn't correct
46 Correct 744 ms 58708 KB Output is correct
47 Incorrect 655 ms 59032 KB Output isn't correct
48 Correct 659 ms 58896 KB Output is correct
49 Correct 308 ms 58704 KB Output is correct
50 Correct 671 ms 58952 KB Output is correct
51 Correct 679 ms 58812 KB Output is correct
52 Correct 670 ms 58948 KB Output is correct
53 Correct 650 ms 58944 KB Output is correct
54 Correct 897 ms 58940 KB Output is correct
55 Correct 764 ms 59132 KB Output is correct
56 Correct 288 ms 58804 KB Output is correct
57 Correct 877 ms 58940 KB Output is correct
58 Execution timed out 1040 ms 58960 KB Time limit exceeded
59 Correct 953 ms 58900 KB Output is correct
60 Correct 339 ms 58944 KB Output is correct
61 Correct 629 ms 58948 KB Output is correct
62 Correct 374 ms 58948 KB Output is correct
63 Correct 320 ms 58768 KB Output is correct
64 Correct 360 ms 58912 KB Output is correct
65 Correct 698 ms 58948 KB Output is correct
66 Correct 403 ms 58784 KB Output is correct
67 Correct 631 ms 58708 KB Output is correct
68 Correct 622 ms 59404 KB Output is correct
69 Correct 881 ms 58940 KB Output is correct
70 Incorrect 391 ms 50872 KB Output isn't correct
71 Incorrect 774 ms 58936 KB Output isn't correct
72 Incorrect 793 ms 58940 KB Output isn't correct
73 Incorrect 691 ms 58708 KB Output isn't correct
74 Incorrect 828 ms 58904 KB Output isn't correct
75 Incorrect 801 ms 58856 KB Output isn't correct
76 Incorrect 866 ms 58944 KB Output isn't correct
77 Incorrect 900 ms 59088 KB Output isn't correct
78 Incorrect 918 ms 58812 KB Output isn't correct
79 Execution timed out 1063 ms 58944 KB Time limit exceeded
80 Execution timed out 1006 ms 58908 KB Time limit exceeded
81 Incorrect 583 ms 59040 KB Output isn't correct
82 Incorrect 885 ms 58936 KB Output isn't correct
83 Incorrect 943 ms 58900 KB Output isn't correct
84 Correct 744 ms 58940 KB Output is correct
85 Incorrect 736 ms 58948 KB Output isn't correct
86 Incorrect 497 ms 59020 KB Output isn't correct
87 Correct 718 ms 58944 KB Output is correct
88 Incorrect 771 ms 58936 KB Output isn't correct
89 Incorrect 577 ms 58896 KB Output isn't correct
90 Incorrect 517 ms 50772 KB Output isn't correct
91 Incorrect 699 ms 59200 KB Output isn't correct
92 Incorrect 654 ms 58964 KB Output isn't correct
93 Incorrect 504 ms 58952 KB Output isn't correct
94 Incorrect 604 ms 58888 KB Output isn't correct
95 Incorrect 931 ms 58936 KB Output isn't correct
96 Incorrect 826 ms 59168 KB Output isn't correct
97 Incorrect 484 ms 58892 KB Output isn't correct
98 Incorrect 935 ms 58940 KB Output isn't correct
99 Incorrect 613 ms 58948 KB Output isn't correct
100 Incorrect 486 ms 58768 KB Output isn't correct