답안 #885333

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
885333	2023-12-09T13:16:26 Z	alexdd	Bomb (IZhO17_bomb)	C++17	53 / 100	1000 ms	55856 KB

bomb

#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]++;
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            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;
    for(int i=miny;i>max(0,miny-10);i--)
    {
        if(i*minx <= mxm)
            break;
        int st,dr,mij,ans=0;
        st=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);
    }
    for(int i=minx;i>max(0,minx-10);i--)
    {
        if(i*miny <= mxm)
            break;
        int st,dr,mij,ans=0;
        st=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);
    }
    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

53.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	4700 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	1 ms	2396 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	2396 KB	Output is correct
16	Correct	1 ms	4700 KB	Output is correct
17	Correct	1 ms	4700 KB	Output is correct
18	Correct	1 ms	4700 KB	Output is correct
19	Correct	2 ms	4956 KB	Output is correct
20	Correct	2 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	3 ms	4956 KB	Output is correct
24	Correct	2 ms	4956 KB	Output is correct
25	Correct	2 ms	4952 KB	Output is correct
26	Correct	2 ms	4956 KB	Output is correct
27	Correct	5 ms	11868 KB	Output is correct
28	Correct	9 ms	12088 KB	Output is correct
29	Correct	48 ms	11968 KB	Output is correct
30	Correct	49 ms	12120 KB	Output is correct
31	Correct	36 ms	12136 KB	Output is correct
32	Correct	46 ms	11868 KB	Output is correct
33	Correct	131 ms	14236 KB	Output is correct
34	Correct	9 ms	10328 KB	Output is correct
35	Correct	63 ms	14168 KB	Output is correct
36	Correct	32 ms	14232 KB	Output is correct
37	Correct	1 ms	4700 KB	Output is correct
38	Correct	465 ms	55712 KB	Output is correct
39	Correct	1 ms	4696 KB	Output is correct
40	Correct	331 ms	21940 KB	Output is correct
41	Correct	1 ms	4952 KB	Output is correct
42	Correct	3 ms	4956 KB	Output is correct
43	Correct	453 ms	55460 KB	Output is correct
44	Correct	184 ms	14232 KB	Output is correct
45	Execution timed out	1070 ms	55464 KB	Time limit exceeded
46	Correct	904 ms	55608 KB	Output is correct
47	Execution timed out	1029 ms	55376 KB	Time limit exceeded
48	Execution timed out	1067 ms	55608 KB	Time limit exceeded
49	Correct	354 ms	55460 KB	Output is correct
50	Execution timed out	1053 ms	55636 KB	Time limit exceeded
51	Execution timed out	1020 ms	55456 KB	Time limit exceeded
52	Execution timed out	1064 ms	55376 KB	Time limit exceeded
53	Execution timed out	1032 ms	55456 KB	Time limit exceeded
54	Execution timed out	1016 ms	55408 KB	Time limit exceeded
55	Execution timed out	1038 ms	55376 KB	Time limit exceeded
56	Correct	487 ms	55376 KB	Output is correct
57	Execution timed out	1078 ms	55452 KB	Time limit exceeded
58	Execution timed out	1048 ms	55420 KB	Time limit exceeded
59	Execution timed out	1028 ms	55456 KB	Time limit exceeded
60	Correct	364 ms	55460 KB	Output is correct
61	Correct	755 ms	55468 KB	Output is correct
62	Correct	459 ms	55732 KB	Output is correct
63	Correct	460 ms	55380 KB	Output is correct
64	Correct	416 ms	55612 KB	Output is correct
65	Execution timed out	1098 ms	55460 KB	Time limit exceeded
66	Correct	549 ms	55616 KB	Output is correct
67	Execution timed out	1079 ms	55456 KB	Time limit exceeded
68	Execution timed out	1077 ms	55484 KB	Time limit exceeded
69	Execution timed out	1068 ms	55448 KB	Time limit exceeded
70	Execution timed out	1031 ms	48300 KB	Time limit exceeded
71	Execution timed out	1047 ms	55420 KB	Time limit exceeded
72	Execution timed out	1063 ms	55468 KB	Time limit exceeded
73	Execution timed out	1039 ms	55380 KB	Time limit exceeded
74	Execution timed out	1032 ms	55460 KB	Time limit exceeded
75	Execution timed out	1024 ms	55376 KB	Time limit exceeded
76	Execution timed out	1012 ms	55652 KB	Time limit exceeded
77	Execution timed out	1102 ms	55480 KB	Time limit exceeded
78	Execution timed out	1036 ms	55856 KB	Time limit exceeded
79	Execution timed out	1068 ms	55380 KB	Time limit exceeded
80	Execution timed out	1040 ms	55464 KB	Time limit exceeded
81	Execution timed out	1020 ms	55532 KB	Time limit exceeded
82	Execution timed out	1073 ms	55500 KB	Time limit exceeded
83	Execution timed out	1020 ms	55380 KB	Time limit exceeded
84	Execution timed out	1018 ms	55452 KB	Time limit exceeded
85	Execution timed out	1043 ms	55660 KB	Time limit exceeded
86	Execution timed out	1010 ms	55376 KB	Time limit exceeded
87	Execution timed out	1073 ms	55580 KB	Time limit exceeded
88	Execution timed out	1038 ms	55428 KB	Time limit exceeded
89	Execution timed out	1068 ms	55468 KB	Time limit exceeded
90	Execution timed out	1052 ms	48416 KB	Time limit exceeded
91	Execution timed out	1043 ms	55432 KB	Time limit exceeded
92	Execution timed out	1056 ms	55380 KB	Time limit exceeded
93	Execution timed out	1062 ms	55500 KB	Time limit exceeded
94	Execution timed out	1066 ms	55448 KB	Time limit exceeded
95	Execution timed out	1038 ms	55596 KB	Time limit exceeded
96	Execution timed out	1039 ms	55492 KB	Time limit exceeded
97	Execution timed out	1046 ms	55380 KB	Time limit exceeded
98	Execution timed out	1064 ms	55528 KB	Time limit exceeded
99	Execution timed out	1054 ms	55460 KB	Time limit exceeded
100	Execution timed out	1052 ms	55380 KB	Time limit exceeded