답안 #885653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
885653	2023-12-10T11:24:47 Z	alexdd	Bomb (IZhO17_bomb)	C++17	67 / 100	1000 ms	58152 KB

bomb

#include<iostream>
#pragma GCC optimize("O3,unroll-loops")
using namespace std;
int n,m;
char mat[2505][2505];
int sump[2505][2505];
int mars[2505][2505];
int pver[2505][2505];
bool verif(int cntx, int cnty)
{
    if(pver[cntx][cnty]!=0)
    {
        if(pver[cntx][cnty]==-1)
            return 0;
        else
            return 1;
    }
    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')
            {
                pver[cntx][cnty]=-1;
                return 0;
            }
        }
    }
    pver[cntx][cnty]=1;
    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;
        poz = max(poz, (mxm-1)/i+1);
        while(poz+1<=miny && verif(i,poz+1))
        {
            poz++;
        }
        if(verif(i,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;
        poz = max(poz, (mxm-1)/i+1);
        while(poz+1<=minx && verif(poz+1,i))
        {
            poz++;
        }
        if(verif(poz,i)) 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-3);i--)
    {
        if(i*minx <= mxm)
            break;
        int st,dr,mij,ans=0;
        st=max(prec, (mxm-1)/i+1);
        dr=minx;
        if(!verif(st,i))
            continue;
        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-3);i--)
    {
        if(i*miny <= mxm)
            break;
        int st,dr,mij,ans=0;
        st=max(prec, (mxm-1)/i+1);
        dr=miny;
        if(!verif(st,i))
            continue;
        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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4696 KB	Output is correct
3	Correct	8 ms	42844 KB	Output is correct
4	Correct	7 ms	42748 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4440 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4444 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	4444 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	6744 KB	Output is correct
18	Correct	1 ms	6748 KB	Output is correct
19	Correct	2 ms	7004 KB	Output is correct
20	Correct	2 ms	7004 KB	Output is correct
21	Correct	1 ms	6748 KB	Output is correct
22	Correct	1 ms	6748 KB	Output is correct
23	Correct	2 ms	7028 KB	Output is correct
24	Correct	2 ms	7004 KB	Output is correct
25	Correct	3 ms	7004 KB	Output is correct
26	Correct	2 ms	7004 KB	Output is correct
27	Correct	5 ms	12164 KB	Output is correct
28	Correct	7 ms	12124 KB	Output is correct
29	Incorrect	29 ms	12636 KB	Output isn't correct
30	Correct	45 ms	13404 KB	Output is correct
31	Correct	32 ms	12852 KB	Output is correct
32	Correct	40 ms	13136 KB	Output is correct
33	Correct	110 ms	15696 KB	Output is correct
34	Correct	7 ms	12376 KB	Output is correct
35	Correct	45 ms	15192 KB	Output is correct
36	Correct	24 ms	15196 KB	Output is correct
37	Correct	1 ms	4444 KB	Output is correct
38	Correct	242 ms	57320 KB	Output is correct
39	Correct	1 ms	4444 KB	Output is correct
40	Correct	43 ms	25896 KB	Output is correct
41	Correct	1 ms	4444 KB	Output is correct
42	Correct	2 ms	7004 KB	Output is correct
43	Correct	383 ms	57324 KB	Output is correct
44	Correct	80 ms	15928 KB	Output is correct
45	Incorrect	506 ms	57496 KB	Output isn't correct
46	Correct	719 ms	57680 KB	Output is correct
47	Incorrect	492 ms	57428 KB	Output isn't correct
48	Correct	455 ms	57716 KB	Output is correct
49	Correct	290 ms	57424 KB	Output is correct
50	Correct	458 ms	57808 KB	Output is correct
51	Correct	468 ms	57428 KB	Output is correct
52	Correct	444 ms	57428 KB	Output is correct
53	Correct	439 ms	57568 KB	Output is correct
54	Correct	494 ms	57404 KB	Output is correct
55	Correct	495 ms	57432 KB	Output is correct
56	Correct	285 ms	57428 KB	Output is correct
57	Correct	594 ms	57768 KB	Output is correct
58	Correct	648 ms	57696 KB	Output is correct
59	Correct	608 ms	57596 KB	Output is correct
60	Correct	350 ms	57312 KB	Output is correct
61	Correct	603 ms	57720 KB	Output is correct
62	Correct	393 ms	57472 KB	Output is correct
63	Correct	312 ms	57840 KB	Output is correct
64	Correct	375 ms	57424 KB	Output is correct
65	Correct	410 ms	57684 KB	Output is correct
66	Correct	382 ms	57320 KB	Output is correct
67	Correct	460 ms	57428 KB	Output is correct
68	Correct	456 ms	57496 KB	Output is correct
69	Correct	589 ms	57492 KB	Output is correct
70	Incorrect	186 ms	50256 KB	Output isn't correct
71	Incorrect	322 ms	57428 KB	Output isn't correct
72	Incorrect	341 ms	57464 KB	Output isn't correct
73	Incorrect	337 ms	57296 KB	Output isn't correct
74	Incorrect	346 ms	57432 KB	Output isn't correct
75	Incorrect	351 ms	57428 KB	Output isn't correct
76	Incorrect	345 ms	57312 KB	Output isn't correct
77	Incorrect	365 ms	57720 KB	Output isn't correct
78	Incorrect	370 ms	57476 KB	Output isn't correct
79	Execution timed out	1046 ms	58096 KB	Time limit exceeded
80	Execution timed out	1040 ms	58152 KB	Time limit exceeded
81	Incorrect	279 ms	57324 KB	Output isn't correct
82	Incorrect	401 ms	57424 KB	Output isn't correct
83	Incorrect	351 ms	57428 KB	Output isn't correct
84	Execution timed out	1085 ms	57596 KB	Time limit exceeded
85	Incorrect	356 ms	57568 KB	Output isn't correct
86	Incorrect	257 ms	57424 KB	Output isn't correct
87	Correct	307 ms	57456 KB	Output is correct
88	Incorrect	342 ms	57316 KB	Output isn't correct
89	Incorrect	290 ms	57472 KB	Output isn't correct
90	Incorrect	218 ms	50668 KB	Output isn't correct
91	Incorrect	316 ms	57480 KB	Output isn't correct
92	Incorrect	299 ms	57428 KB	Output isn't correct
93	Incorrect	269 ms	57248 KB	Output isn't correct
94	Incorrect	299 ms	57412 KB	Output isn't correct
95	Incorrect	349 ms	57304 KB	Output isn't correct
96	Incorrect	347 ms	57456 KB	Output isn't correct
97	Incorrect	271 ms	57432 KB	Output isn't correct
98	Incorrect	338 ms	57448 KB	Output isn't correct
99	Incorrect	299 ms	57684 KB	Output isn't correct
100	Incorrect	264 ms	57312 KB	Output isn't correct