답안 #885325

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
885325	2023-12-09T13:08:52 Z	alexdd	Bomb (IZhO17_bomb)	C++17	45 / 100	1000 ms	55792 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 poz=0, mxm=0;
    for(int i=miny;i>max(0,miny-10);i--)
    {
        if(i*minx <= mxm)
            break;
        while(poz+1<=minx && verif(poz+1,i))
        {
            poz++;
        }
        mxm = max(mxm, i*poz);
    }
    poz=0;
    mxm=0;
    for(int i=minx;i>max(0,minx-10);i--)
    {
        if(i*miny <= mxm)
            break;
        while(poz+1<=miny && verif(i,poz+1))
        {
            poz++;
        }
        mxm = max(mxm, i*poz);
    }
    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

45.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2552 KB	Output is correct
2	Correct	1 ms	4700 KB	Output is correct
3	Correct	10 ms	40796 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	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	2648 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	3 ms	4956 KB	Output is correct
24	Correct	2 ms	4956 KB	Output is correct
25	Correct	3 ms	4956 KB	Output is correct
26	Correct	3 ms	4956 KB	Output is correct
27	Correct	8 ms	11868 KB	Output is correct
28	Correct	12 ms	11868 KB	Output is correct
29	Correct	51 ms	11868 KB	Output is correct
30	Correct	53 ms	12124 KB	Output is correct
31	Correct	35 ms	12124 KB	Output is correct
32	Correct	44 ms	11864 KB	Output is correct
33	Correct	131 ms	14168 KB	Output is correct
34	Correct	8 ms	10328 KB	Output is correct
35	Correct	66 ms	14172 KB	Output is correct
36	Correct	31 ms	14172 KB	Output is correct
37	Correct	1 ms	4700 KB	Output is correct
38	Execution timed out	1062 ms	55460 KB	Time limit exceeded
39	Correct	1 ms	4700 KB	Output is correct
40	Execution timed out	1069 ms	21844 KB	Time limit exceeded
41	Correct	1 ms	4696 KB	Output is correct
42	Correct	4 ms	4956 KB	Output is correct
43	Execution timed out	1084 ms	55456 KB	Time limit exceeded
44	Correct	182 ms	14236 KB	Output is correct
45	Execution timed out	1018 ms	55616 KB	Time limit exceeded
46	Correct	925 ms	55624 KB	Output is correct
47	Execution timed out	1050 ms	55716 KB	Time limit exceeded
48	Execution timed out	1070 ms	55468 KB	Time limit exceeded
49	Correct	332 ms	55620 KB	Output is correct
50	Execution timed out	1031 ms	55456 KB	Time limit exceeded
51	Execution timed out	1022 ms	55488 KB	Time limit exceeded
52	Execution timed out	1029 ms	55460 KB	Time limit exceeded
53	Execution timed out	1022 ms	55424 KB	Time limit exceeded
54	Execution timed out	1046 ms	55464 KB	Time limit exceeded
55	Execution timed out	1064 ms	55456 KB	Time limit exceeded
56	Execution timed out	1044 ms	55468 KB	Time limit exceeded
57	Execution timed out	1060 ms	55484 KB	Time limit exceeded
58	Execution timed out	1064 ms	55364 KB	Time limit exceeded
59	Execution timed out	1096 ms	55468 KB	Time limit exceeded
60	Execution timed out	1022 ms	55480 KB	Time limit exceeded
61	Correct	741 ms	55472 KB	Output is correct
62	Execution timed out	1057 ms	55448 KB	Time limit exceeded
63	Execution timed out	1033 ms	55384 KB	Time limit exceeded
64	Execution timed out	1081 ms	55464 KB	Time limit exceeded
65	Execution timed out	1057 ms	55380 KB	Time limit exceeded
66	Correct	535 ms	55620 KB	Output is correct
67	Execution timed out	1060 ms	55420 KB	Time limit exceeded
68	Execution timed out	1059 ms	55380 KB	Time limit exceeded
69	Execution timed out	1038 ms	55420 KB	Time limit exceeded
70	Incorrect	305 ms	48468 KB	Output isn't correct
71	Incorrect	505 ms	55468 KB	Output isn't correct
72	Incorrect	504 ms	55624 KB	Output isn't correct
73	Incorrect	469 ms	55612 KB	Output isn't correct
74	Incorrect	520 ms	55376 KB	Output isn't correct
75	Incorrect	524 ms	55636 KB	Output isn't correct
76	Incorrect	529 ms	55452 KB	Output isn't correct
77	Incorrect	526 ms	55380 KB	Output isn't correct
78	Incorrect	539 ms	55636 KB	Output isn't correct
79	Execution timed out	1063 ms	55476 KB	Time limit exceeded
80	Execution timed out	1054 ms	55380 KB	Time limit exceeded
81	Incorrect	458 ms	55608 KB	Output isn't correct
82	Incorrect	532 ms	55380 KB	Output isn't correct
83	Incorrect	556 ms	55724 KB	Output isn't correct
84	Execution timed out	1052 ms	55380 KB	Time limit exceeded
85	Incorrect	499 ms	55792 KB	Output isn't correct
86	Incorrect	483 ms	55472 KB	Output isn't correct
87	Incorrect	492 ms	55460 KB	Output isn't correct
88	Incorrect	498 ms	55376 KB	Output isn't correct
89	Incorrect	502 ms	55632 KB	Output isn't correct
90	Incorrect	358 ms	48596 KB	Output isn't correct
91	Incorrect	499 ms	55460 KB	Output isn't correct
92	Incorrect	501 ms	55384 KB	Output isn't correct
93	Incorrect	492 ms	55620 KB	Output isn't correct
94	Incorrect	494 ms	55460 KB	Output isn't correct
95	Incorrect	583 ms	55612 KB	Output isn't correct
96	Incorrect	518 ms	55452 KB	Output isn't correct
97	Incorrect	481 ms	55464 KB	Output isn't correct
98	Incorrect	560 ms	55676 KB	Output isn't correct
99	Incorrect	502 ms	55616 KB	Output isn't correct
100	Incorrect	506 ms	55480 KB	Output isn't correct