답안 #885628

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
885628	2023-12-10T10:30:44 Z	alexdd	Bomb (IZhO17_bomb)	C++17	50 / 100	1000 ms	59636 KB

bomb

#include<iostream>
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-4);i--)
    {
        if(i*minx <= mxm)
            break;
        int st,dr,mij,ans=0;
        st=max(prec, (mxm-1)/i+1);
        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=max(prec, (mxm-1)/i+1);
        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 || 1)
    {
        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

50.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	10 ms	42844 KB	Output is correct
4	Correct	8 ms	42872 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	4444 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	6748 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	7004 KB	Output is correct
24	Correct	1 ms	7004 KB	Output is correct
25	Correct	2 ms	7004 KB	Output is correct
26	Correct	2 ms	7004 KB	Output is correct
27	Correct	6 ms	12124 KB	Output is correct
28	Correct	7 ms	12376 KB	Output is correct
29	Incorrect	29 ms	12636 KB	Output isn't correct
30	Correct	44 ms	13752 KB	Output is correct
31	Correct	31 ms	12892 KB	Output is correct
32	Correct	40 ms	13336 KB	Output is correct
33	Correct	109 ms	15792 KB	Output is correct
34	Correct	7 ms	12380 KB	Output is correct
35	Correct	45 ms	15412 KB	Output is correct
36	Correct	26 ms	15704 KB	Output is correct
37	Correct	1 ms	4444 KB	Output is correct
38	Execution timed out	1062 ms	59636 KB	Time limit exceeded
39	Correct	1 ms	4440 KB	Output is correct
40	Correct	548 ms	25156 KB	Output is correct
41	Correct	1 ms	4444 KB	Output is correct
42	Correct	2 ms	7004 KB	Output is correct
43	Execution timed out	1070 ms	57584 KB	Time limit exceeded
44	Correct	81 ms	15964 KB	Output is correct
45	Execution timed out	1060 ms	57680 KB	Time limit exceeded
46	Correct	732 ms	57660 KB	Output is correct
47	Execution timed out	1049 ms	57632 KB	Time limit exceeded
48	Execution timed out	1058 ms	57552 KB	Time limit exceeded
49	Correct	286 ms	57308 KB	Output is correct
50	Execution timed out	1049 ms	57684 KB	Time limit exceeded
51	Execution timed out	1039 ms	57728 KB	Time limit exceeded
52	Execution timed out	1056 ms	57600 KB	Time limit exceeded
53	Execution timed out	1056 ms	57800 KB	Time limit exceeded
54	Execution timed out	1047 ms	57544 KB	Time limit exceeded
55	Execution timed out	1044 ms	58004 KB	Time limit exceeded
56	Execution timed out	1072 ms	57740 KB	Time limit exceeded
57	Execution timed out	1064 ms	57696 KB	Time limit exceeded
58	Execution timed out	1054 ms	57636 KB	Time limit exceeded
59	Execution timed out	1057 ms	57512 KB	Time limit exceeded
60	Correct	848 ms	57684 KB	Output is correct
61	Correct	604 ms	57428 KB	Output is correct
62	Execution timed out	1073 ms	57568 KB	Time limit exceeded
63	Execution timed out	1064 ms	57832 KB	Time limit exceeded
64	Execution timed out	1034 ms	57892 KB	Time limit exceeded
65	Execution timed out	1038 ms	57748 KB	Time limit exceeded
66	Correct	381 ms	57944 KB	Output is correct
67	Execution timed out	1073 ms	57684 KB	Time limit exceeded
68	Execution timed out	1049 ms	57684 KB	Time limit exceeded
69	Execution timed out	1022 ms	57936 KB	Time limit exceeded
70	Execution timed out	1058 ms	50516 KB	Time limit exceeded
71	Execution timed out	1008 ms	57424 KB	Time limit exceeded
72	Execution timed out	1026 ms	57444 KB	Time limit exceeded
73	Execution timed out	1072 ms	57440 KB	Time limit exceeded
74	Execution timed out	1101 ms	57424 KB	Time limit exceeded
75	Execution timed out	1072 ms	57684 KB	Time limit exceeded
76	Execution timed out	1069 ms	57648 KB	Time limit exceeded
77	Execution timed out	1055 ms	57228 KB	Time limit exceeded
78	Execution timed out	1060 ms	57692 KB	Time limit exceeded
79	Execution timed out	1062 ms	58248 KB	Time limit exceeded
80	Execution timed out	1053 ms	57952 KB	Time limit exceeded
81	Execution timed out	1056 ms	57428 KB	Time limit exceeded
82	Execution timed out	1050 ms	57556 KB	Time limit exceeded
83	Execution timed out	1033 ms	57316 KB	Time limit exceeded
84	Execution timed out	1068 ms	57584 KB	Time limit exceeded
85	Execution timed out	1031 ms	57424 KB	Time limit exceeded
86	Correct	580 ms	57448 KB	Output is correct
87	Execution timed out	1058 ms	57356 KB	Time limit exceeded
88	Execution timed out	1008 ms	57424 KB	Time limit exceeded
89	Execution timed out	1070 ms	57684 KB	Time limit exceeded
90	Execution timed out	1046 ms	50256 KB	Time limit exceeded
91	Execution timed out	1075 ms	57324 KB	Time limit exceeded
92	Execution timed out	1046 ms	57708 KB	Time limit exceeded
93	Correct	779 ms	57792 KB	Output is correct
94	Execution timed out	1049 ms	57320 KB	Time limit exceeded
95	Execution timed out	1064 ms	57336 KB	Time limit exceeded
96	Execution timed out	1047 ms	57428 KB	Time limit exceeded
97	Correct	622 ms	57568 KB	Output is correct
98	Execution timed out	1065 ms	57428 KB	Time limit exceeded
99	Execution timed out	1035 ms	57316 KB	Time limit exceeded
100	Correct	582 ms	57424 KB	Output is correct