답안 #885335

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
885335	2023-12-09T13:18:26 Z	alexdd	Bomb (IZhO17_bomb)	C++17	53 / 100	1000 ms	55832 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-5);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-5);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	2392 KB	Output is correct
2	Correct	1 ms	4700 KB	Output is correct
3	Correct	8 ms	41044 KB	Output is correct
4	Correct	9 ms	40792 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2504 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	4492 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	2 ms	4956 KB	Output is correct
23	Correct	2 ms	4956 KB	Output is correct
24	Correct	1 ms	4760 KB	Output is correct
25	Correct	2 ms	4956 KB	Output is correct
26	Correct	2 ms	4956 KB	Output is correct
27	Correct	7 ms	11868 KB	Output is correct
28	Correct	9 ms	11868 KB	Output is correct
29	Correct	48 ms	11868 KB	Output is correct
30	Correct	52 ms	12124 KB	Output is correct
31	Correct	35 ms	12124 KB	Output is correct
32	Correct	43 ms	11868 KB	Output is correct
33	Correct	135 ms	14232 KB	Output is correct
34	Correct	8 ms	10328 KB	Output is correct
35	Correct	62 ms	14168 KB	Output is correct
36	Correct	30 ms	14168 KB	Output is correct
37	Correct	1 ms	4700 KB	Output is correct
38	Correct	456 ms	55612 KB	Output is correct
39	Correct	1 ms	4696 KB	Output is correct
40	Correct	175 ms	21936 KB	Output is correct
41	Correct	1 ms	4696 KB	Output is correct
42	Correct	4 ms	4956 KB	Output is correct
43	Correct	449 ms	55616 KB	Output is correct
44	Correct	178 ms	14168 KB	Output is correct
45	Execution timed out	1059 ms	55636 KB	Time limit exceeded
46	Correct	908 ms	55620 KB	Output is correct
47	Execution timed out	1065 ms	55380 KB	Time limit exceeded
48	Execution timed out	1004 ms	55376 KB	Time limit exceeded
49	Correct	364 ms	55636 KB	Output is correct
50	Execution timed out	1051 ms	55456 KB	Time limit exceeded
51	Execution timed out	1035 ms	55364 KB	Time limit exceeded
52	Execution timed out	1025 ms	55376 KB	Time limit exceeded
53	Execution timed out	1071 ms	55380 KB	Time limit exceeded
54	Execution timed out	1051 ms	55416 KB	Time limit exceeded
55	Execution timed out	1037 ms	55456 KB	Time limit exceeded
56	Correct	470 ms	55456 KB	Output is correct
57	Execution timed out	1047 ms	55484 KB	Time limit exceeded
58	Execution timed out	1054 ms	55748 KB	Time limit exceeded
59	Execution timed out	1031 ms	55372 KB	Time limit exceeded
60	Correct	359 ms	55620 KB	Output is correct
61	Correct	738 ms	55712 KB	Output is correct
62	Correct	451 ms	55632 KB	Output is correct
63	Correct	456 ms	55472 KB	Output is correct
64	Correct	428 ms	55812 KB	Output is correct
65	Execution timed out	1071 ms	55464 KB	Time limit exceeded
66	Correct	535 ms	55632 KB	Output is correct
67	Execution timed out	1084 ms	55376 KB	Time limit exceeded
68	Execution timed out	1062 ms	55468 KB	Time limit exceeded
69	Execution timed out	1068 ms	55504 KB	Time limit exceeded
70	Incorrect	784 ms	48728 KB	Output isn't correct
71	Execution timed out	1054 ms	55376 KB	Time limit exceeded
72	Execution timed out	1054 ms	55636 KB	Time limit exceeded
73	Execution timed out	1063 ms	55484 KB	Time limit exceeded
74	Execution timed out	1008 ms	55376 KB	Time limit exceeded
75	Execution timed out	1060 ms	55476 KB	Time limit exceeded
76	Execution timed out	1066 ms	55380 KB	Time limit exceeded
77	Execution timed out	1022 ms	55376 KB	Time limit exceeded
78	Execution timed out	1054 ms	55832 KB	Time limit exceeded
79	Execution timed out	1040 ms	55380 KB	Time limit exceeded
80	Execution timed out	1053 ms	55432 KB	Time limit exceeded
81	Execution timed out	1062 ms	55556 KB	Time limit exceeded
82	Execution timed out	1026 ms	55376 KB	Time limit exceeded
83	Execution timed out	1062 ms	55380 KB	Time limit exceeded
84	Execution timed out	1047 ms	55632 KB	Time limit exceeded
85	Execution timed out	1044 ms	55380 KB	Time limit exceeded
86	Incorrect	978 ms	55620 KB	Output isn't correct
87	Execution timed out	1040 ms	55376 KB	Time limit exceeded
88	Execution timed out	1065 ms	55460 KB	Time limit exceeded
89	Execution timed out	1084 ms	55716 KB	Time limit exceeded
90	Execution timed out	1014 ms	48520 KB	Time limit exceeded
91	Execution timed out	1020 ms	55612 KB	Time limit exceeded
92	Execution timed out	1052 ms	55488 KB	Time limit exceeded
93	Execution timed out	1048 ms	55376 KB	Time limit exceeded
94	Execution timed out	1063 ms	55656 KB	Time limit exceeded
95	Execution timed out	1034 ms	55376 KB	Time limit exceeded
96	Execution timed out	1030 ms	55376 KB	Time limit exceeded
97	Execution timed out	1016 ms	55732 KB	Time limit exceeded
98	Execution timed out	1068 ms	55464 KB	Time limit exceeded
99	Execution timed out	1082 ms	55460 KB	Time limit exceeded
100	Execution timed out	1047 ms	55620 KB	Time limit exceeded