oj.uz

답안 #885312

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885312 2023-12-09T12:53:49 Z alexdd Bomb (IZhO17_bomb) C++17
43 / 100
 1000 ms 55840 KB 
#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;
}
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(minx * miny > 100000000)
    {
        cout<<minx*miny;
        return 0;
    }
    //minx=n;miny=m;
    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;
    return 0;
}

Subtask #1
43.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 40808 KB Output is correct
4 Correct 8 ms 40812 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 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 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2652 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 2 ms 5004 KB Output is correct
24 Correct 1 ms 4952 KB Output is correct
25 Correct 3 ms 4956 KB Output is correct
26 Correct 2 ms 4956 KB Output is correct
27 Correct 5 ms 10328 KB Output is correct
28 Correct 9 ms 10312 KB Output is correct
29 Correct 48 ms 10588 KB Output is correct
30 Correct 52 ms 11200 KB Output is correct
31 Correct 35 ms 10588 KB Output is correct
32 Correct 47 ms 11096 KB Output is correct
33 Correct 131 ms 13404 KB Output is correct
34 Correct 8 ms 10484 KB Output is correct
35 Correct 65 ms 13404 KB Output is correct
36 Correct 37 ms 13392 KB Output is correct
37 Correct 1 ms 4696 KB Output is correct
38 Execution timed out 1050 ms 55468 KB Time limit exceeded
39 Correct 1 ms 4700 KB Output is correct
40 Execution timed out 1089 ms 22388 KB Time limit exceeded
41 Correct 1 ms 4700 KB Output is correct
42 Correct 4 ms 4952 KB Output is correct
43 Execution timed out 1084 ms 55468 KB Time limit exceeded
44 Correct 192 ms 13388 KB Output is correct
45 Execution timed out 1098 ms 55484 KB Time limit exceeded
46 Correct 937 ms 55424 KB Output is correct
47 Execution timed out 1073 ms 55484 KB Time limit exceeded
48 Execution timed out 1056 ms 55536 KB Time limit exceeded
49 Correct 336 ms 55476 KB Output is correct
50 Execution timed out 1073 ms 55484 KB Time limit exceeded
51 Execution timed out 1066 ms 55416 KB Time limit exceeded
52 Execution timed out 1027 ms 55616 KB Time limit exceeded
53 Execution timed out 1055 ms 55484 KB Time limit exceeded
54 Execution timed out 1061 ms 55476 KB Time limit exceeded
55 Execution timed out 1063 ms 55472 KB Time limit exceeded
56 Execution timed out 1039 ms 55380 KB Time limit exceeded
57 Execution timed out 1036 ms 55484 KB Time limit exceeded
58 Execution timed out 1047 ms 55492 KB Time limit exceeded
59 Execution timed out 1018 ms 55484 KB Time limit exceeded
60 Execution timed out 1049 ms 55616 KB Time limit exceeded
61 Execution timed out 1045 ms 55616 KB Time limit exceeded
62 Execution timed out 1080 ms 55400 KB Time limit exceeded
63 Execution timed out 1055 ms 55472 KB Time limit exceeded
64 Execution timed out 1035 ms 55516 KB Time limit exceeded
65 Execution timed out 1084 ms 55468 KB Time limit exceeded
66 Execution timed out 1083 ms 55676 KB Time limit exceeded
67 Execution timed out 1073 ms 55464 KB Time limit exceeded
68 Execution timed out 1083 ms 55460 KB Time limit exceeded
69 Execution timed out 1078 ms 55476 KB Time limit exceeded
70 Execution timed out 1047 ms 47280 KB Time limit exceeded
71 Execution timed out 1073 ms 55840 KB Time limit exceeded
72 Execution timed out 1046 ms 55380 KB Time limit exceeded
73 Execution timed out 1061 ms 55488 KB Time limit exceeded
74 Execution timed out 1036 ms 55528 KB Time limit exceeded
75 Execution timed out 1075 ms 55380 KB Time limit exceeded
76 Execution timed out 1079 ms 55492 KB Time limit exceeded
77 Execution timed out 1065 ms 55740 KB Time limit exceeded
78 Execution timed out 1020 ms 55384 KB Time limit exceeded
79 Execution timed out 1063 ms 55488 KB Time limit exceeded
80 Execution timed out 1087 ms 55464 KB Time limit exceeded
81 Execution timed out 1020 ms 55376 KB Time limit exceeded
82 Execution timed out 1067 ms 55464 KB Time limit exceeded
83 Execution timed out 1028 ms 55432 KB Time limit exceeded
84 Execution timed out 1025 ms 55440 KB Time limit exceeded
85 Execution timed out 1033 ms 55484 KB Time limit exceeded
86 Execution timed out 1016 ms 55732 KB Time limit exceeded
87 Execution timed out 1056 ms 55476 KB Time limit exceeded
88 Execution timed out 1074 ms 55408 KB Time limit exceeded
89 Execution timed out 1065 ms 55536 KB Time limit exceeded
90 Execution timed out 1039 ms 47276 KB Time limit exceeded
91 Execution timed out 1050 ms 55472 KB Time limit exceeded
92 Execution timed out 1082 ms 55376 KB Time limit exceeded
93 Execution timed out 1056 ms 55380 KB Time limit exceeded
94 Execution timed out 1062 ms 55484 KB Time limit exceeded
95 Execution timed out 1071 ms 55380 KB Time limit exceeded
96 Execution timed out 1061 ms 55384 KB Time limit exceeded
97 Execution timed out 1072 ms 55468 KB Time limit exceeded
98 Execution timed out 1044 ms 55380 KB Time limit exceeded
99 Execution timed out 1075 ms 55476 KB Time limit exceeded
100 Execution timed out 1034 ms 55488 KB Time limit exceeded