답안 #936240

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
936240	2024-03-01T13:02:32 Z	guagua0407	Bomb (IZhO17_bomb)	C++17	90 / 100	131 ms	79196 KB

bomb

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int mxn=2505;
const int inf=1e9;
int c[mxn][mxn];
int up[mxn][mxn];
int down[mxn][mxn];
int n,m;
int ans[mxn];

void sir(){
    for(int i=1;i<=n;i++){
        for(int l=1;l<=m;l++){
            if(!c[i][l]) continue;
            int r=l;
            while(r<=m and c[i][r]) r++;
            int a=inf,b=inf;
            for(int x=l;x<r;x++){
                a=min(a,up[i][x]);
                b=min(b,down[i][x]);
                ans[x-l+1]=min(ans[x-l+1],a+b-1);
            }
            //cout<<i<<' '<<l<<' '<<r-1<<' '<<a<<' '<<b<<'\n';
            l=r-1;
        }
    }
}

int main() {_
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            char cur;
            cin>>cur;
            c[i][j]=(cur=='1');
            //cout<<c[i][j];
        }
        //cout<<'\n';
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(c[i][j]) up[i][j]=up[i-1][j]+1;
        }
    }
    for(int i=n;i>=1;i--){
        for(int j=1;j<=m;j++){
            if(c[i][j]) down[i][j]=down[i+1][j]+1;
        }
    }
    for(int i=1;i<=m;i++){
        ans[i]=inf;
    }
    sir();
    for(int i=1;i<=n;i++){
        reverse(c[i]+1,c[i]+m+1);
        reverse(up[i]+1,up[i]+m+1);
        reverse(down[i]+1,down[i]+m+1);
    }
    sir();
    int mn=inf;
    for(int i=1;i<=n;i++){
        for(int l=1;l<=m;l++){
            if(!c[i][l]) continue;
            int r=l;
            while(r<=m and c[i][r]) r++;
            mn=min(mn,r-l);
            l=r-1;
        }
    }
    int mx=0;
    for(int i=1;i<=mn;i++){
        mx=max(mx,i*ans[i]);
    }
    cout<<mx<<'\n';
    return 0;
}
//maybe its multiset not set
//yeeorz
//laborz

Compilation message

bomb.cpp: In function 'void setIO(std::string)':
bomb.cpp:15:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bomb.cpp:16:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

90.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	24 ms	71772 KB	Output is correct
4	Correct	9 ms	70488 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	2 ms	2396 KB	Output is correct
7	Incorrect	1 ms	2396 KB	Output isn't correct
8	Correct	1 ms	2652 KB	Output is correct
9	Correct	1 ms	2652 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2652 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	2 ms	2652 KB	Output is correct
15	Correct	1 ms	2648 KB	Output is correct
16	Correct	1 ms	2652 KB	Output is correct
17	Correct	1 ms	6868 KB	Output is correct
18	Correct	1 ms	7004 KB	Output is correct
19	Correct	1 ms	7004 KB	Output is correct
20	Correct	1 ms	7004 KB	Output is correct
21	Correct	1 ms	4956 KB	Output is correct
22	Correct	1 ms	7004 KB	Output is correct
23	Correct	1 ms	7004 KB	Output is correct
24	Correct	2 ms	7004 KB	Output is correct
25	Correct	1 ms	7004 KB	Output is correct
26	Incorrect	2 ms	7000 KB	Output isn't correct
27	Incorrect	4 ms	13404 KB	Output isn't correct
28	Correct	4 ms	10676 KB	Output is correct
29	Correct	4 ms	13772 KB	Output is correct
30	Correct	5 ms	14168 KB	Output is correct
31	Correct	4 ms	11340 KB	Output is correct
32	Correct	4 ms	13916 KB	Output is correct
33	Correct	6 ms	16412 KB	Output is correct
34	Correct	3 ms	11100 KB	Output is correct
35	Correct	5 ms	14680 KB	Output is correct
36	Incorrect	6 ms	19292 KB	Output isn't correct
37	Correct	1 ms	2652 KB	Output is correct
38	Correct	114 ms	78744 KB	Output is correct
39	Correct	1 ms	2652 KB	Output is correct
40	Correct	18 ms	32220 KB	Output is correct
41	Correct	1 ms	2652 KB	Output is correct
42	Correct	1 ms	7004 KB	Output is correct
43	Correct	117 ms	78828 KB	Output is correct
44	Correct	7 ms	19368 KB	Output is correct
45	Correct	131 ms	78672 KB	Output is correct
46	Correct	103 ms	78892 KB	Output is correct
47	Correct	109 ms	78880 KB	Output is correct
48	Correct	110 ms	78688 KB	Output is correct
49	Incorrect	117 ms	78796 KB	Output isn't correct
50	Correct	109 ms	78724 KB	Output is correct
51	Correct	107 ms	78792 KB	Output is correct
52	Correct	111 ms	78892 KB	Output is correct
53	Correct	109 ms	78672 KB	Output is correct
54	Correct	102 ms	78796 KB	Output is correct
55	Correct	129 ms	78824 KB	Output is correct
56	Correct	117 ms	79040 KB	Output is correct
57	Correct	102 ms	78788 KB	Output is correct
58	Correct	102 ms	78652 KB	Output is correct
59	Correct	104 ms	78668 KB	Output is correct
60	Incorrect	110 ms	79040 KB	Output isn't correct
61	Incorrect	113 ms	78896 KB	Output isn't correct
62	Incorrect	121 ms	78672 KB	Output isn't correct
63	Incorrect	127 ms	78792 KB	Output isn't correct
64	Incorrect	106 ms	78924 KB	Output isn't correct
65	Correct	111 ms	78788 KB	Output is correct
66	Correct	108 ms	78796 KB	Output is correct
67	Correct	112 ms	78672 KB	Output is correct
68	Correct	114 ms	78828 KB	Output is correct
69	Correct	104 ms	78672 KB	Output is correct
70	Correct	72 ms	65532 KB	Output is correct
71	Correct	101 ms	78684 KB	Output is correct
72	Correct	121 ms	78808 KB	Output is correct
73	Correct	124 ms	78676 KB	Output is correct
74	Correct	103 ms	78676 KB	Output is correct
75	Correct	116 ms	78672 KB	Output is correct
76	Correct	111 ms	78928 KB	Output is correct
77	Correct	112 ms	78668 KB	Output is correct
78	Correct	103 ms	78676 KB	Output is correct
79	Correct	129 ms	78788 KB	Output is correct
80	Correct	112 ms	78832 KB	Output is correct
81	Correct	122 ms	78676 KB	Output is correct
82	Correct	103 ms	78672 KB	Output is correct
83	Correct	122 ms	78856 KB	Output is correct
84	Correct	122 ms	79196 KB	Output is correct
85	Correct	103 ms	78672 KB	Output is correct
86	Correct	125 ms	78680 KB	Output is correct
87	Correct	124 ms	78892 KB	Output is correct
88	Correct	112 ms	78900 KB	Output is correct
89	Correct	108 ms	78904 KB	Output is correct
90	Correct	76 ms	66644 KB	Output is correct
91	Correct	107 ms	78900 KB	Output is correct
92	Correct	109 ms	78716 KB	Output is correct
93	Correct	113 ms	78672 KB	Output is correct
94	Correct	114 ms	78856 KB	Output is correct
95	Correct	109 ms	79152 KB	Output is correct
96	Correct	127 ms	78832 KB	Output is correct
97	Correct	112 ms	78672 KB	Output is correct
98	Correct	106 ms	78832 KB	Output is correct
99	Correct	122 ms	79080 KB	Output is correct
100	Correct	122 ms	78896 KB	Output is correct