답안 #38430

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
38430	2018-01-04T06:06:14 Z	Talant	Bomb (IZhO17_bomb)	C++14	40 / 100	1000 ms	131072 KB

bomb

#include <bits/stdc++.h>

#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair

using namespace std;

typedef long long ll;

const int inf = (int)1e9 + 7;
const int N = (int)1e6 + 10;

int n,m;
char a[2502][2502];
int c[2502][2502];

int mx,mn = inf,mn1 = inf;
vector <pair<int,int> > v;

bool check (int h,int w) {
        vector <pair<int,int> > t;

        for (int l = 0; l < v.size(); l ++) {
                int f = 0;
                for (int i = max(v[l].fr,h); i <= min(n,v[l].fr + h - 1); i ++) {
                        for (int j = max(w,v[l].sc); j <= min(m,v[l].sc + w - 1); j ++) {
                                if (i - h < 0)
                                        continue;
                                if (j - w < 0)
                                        continue;
                                if (c[i][j] - c[i - h][j] - c[i][j - w] + c[i - h][j - w] == (h * w)) {
                                        t.pb(mk(i,j));
                                        f = 1;
                                        break;
                                }
                        }
                        if (f == 1)
                                break;
                }
                if (!f)
                        return false;
        }
        return true;
}
int main () {
        cin >> n >> m;

        for (int i = 1; i <= n; i ++)
                scanf ("%s", a[i] + 1);

        for (int i = 1; i <= n; i ++) {
                int cnt = 0;
                for (int j = 1; j <= m; j ++) {
                        c[i][j] = int(a[i][j] - '0');
                        if (c[i][j] == 1)
                                v.pb(mk(i,j));
                        if (c[i][j] == 1)
                                cnt ++;
                        else {
                                if (cnt > 0)
                                mn = min(mn,cnt);
                        cnt = 0;
                        }
                }
                if (cnt > 0)
                        mn = min(mn,cnt);
        }
        for (int i = 1; i <= m; i ++) {
                int cnt = 0;
                for (int j = 1; j <= n; j ++) {
                        if (c[j][i] == 1)
                                cnt ++;
                        else {
                                if (cnt > 0)
                                mn1 = min(mn1,cnt);
                        cnt = 0;
                        }
                }
                if (cnt > 0)
                        mn1 = min(mn1,cnt);
        }
        if (mn == inf)
                mn = 0;
        if (mn1 == inf)
                mn1 = 0;

        if (mn * mn1 == 0) {
                cout << 0;
                return 0;
        }

        if (check(mn1,mn)) {
                cout << mn1 * mn;
                return 0;
        }

        for (int i = 1; i <= n; i ++)
                for (int j = 2; j <= m; j ++)
                        c[i][j] += c[i][j - 1];

        for (int i = 2; i <= n; i ++)
                for (int j = 1; j <= m; j ++)
                        c[i][j] += c[i - 1][j];


        for (int i = mn * mn1; i >= 1; i --) {
                for (int l = 1; l <= sqrt(i); l ++) {
                        if ((i) % l == 0 && (check((i) / l,l) || check(l,i / l))) {
                                cout << i << endl;
                                return 0;
                        }
                }
        }
        cout << 0 << endl;
}

Compilation message

bomb.cpp: In function 'bool check(int, int)':
bomb.cpp:26:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int l = 0; l < v.size(); l ++) {
                           ^
bomb.cpp: In function 'int main()':
bomb.cpp:52:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf ("%s", a[i] + 1);
                                       ^

Subtask #1

40.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	32592 KB	Output is correct
2	Correct	0 ms	32592 KB	Output is correct
3	Correct	3 ms	32732 KB	Output is correct
4	Correct	9 ms	32732 KB	Output is correct
5	Correct	0 ms	32732 KB	Output is correct
6	Correct	0 ms	32592 KB	Output is correct
7	Correct	0 ms	32592 KB	Output is correct
8	Correct	0 ms	32592 KB	Output is correct
9	Correct	0 ms	32592 KB	Output is correct
10	Correct	0 ms	32592 KB	Output is correct
11	Correct	0 ms	32592 KB	Output is correct
12	Correct	0 ms	32592 KB	Output is correct
13	Correct	0 ms	32592 KB	Output is correct
14	Correct	0 ms	32592 KB	Output is correct
15	Correct	0 ms	32592 KB	Output is correct
16	Correct	0 ms	32592 KB	Output is correct
17	Correct	0 ms	32592 KB	Output is correct
18	Correct	0 ms	32592 KB	Output is correct
19	Correct	0 ms	32592 KB	Output is correct
20	Correct	3 ms	32592 KB	Output is correct
21	Correct	0 ms	32592 KB	Output is correct
22	Correct	0 ms	32592 KB	Output is correct
23	Correct	6 ms	32732 KB	Output is correct
24	Correct	0 ms	32592 KB	Output is correct
25	Correct	26 ms	32732 KB	Output is correct
26	Correct	0 ms	32932 KB	Output is correct
27	Correct	3 ms	35748 KB	Output is correct
28	Correct	3 ms	32592 KB	Output is correct
29	Execution timed out	1000 ms	34212 KB	Execution timed out
30	Execution timed out	1000 ms	33696 KB	Execution timed out
31	Execution timed out	1000 ms	33184 KB	Execution timed out
32	Correct	896 ms	33444 KB	Output is correct
33	Execution timed out	1000 ms	33696 KB	Execution timed out
34	Correct	3 ms	32592 KB	Output is correct
35	Correct	156 ms	32932 KB	Output is correct
36	Correct	13 ms	38820 KB	Output is correct
37	Correct	0 ms	32592 KB	Output is correct
38	Memory limit exceeded	243 ms	131072 KB	Memory limit exceeded
39	Correct	0 ms	32592 KB	Output is correct
40	Execution timed out	1000 ms	49056 KB	Execution timed out
41	Correct	0 ms	32592 KB	Output is correct
42	Correct	146 ms	32732 KB	Output is correct
43	Execution timed out	1000 ms	130980 KB	Execution timed out
44	Execution timed out	1000 ms	34212 KB	Execution timed out
45	Execution timed out	1000 ms	81828 KB	Execution timed out
46	Execution timed out	1000 ms	130980 KB	Execution timed out
47	Execution timed out	1000 ms	81828 KB	Execution timed out
48	Execution timed out	1000 ms	81828 KB	Execution timed out
49	Memory limit exceeded	306 ms	131072 KB	Memory limit exceeded
50	Execution timed out	1000 ms	81828 KB	Execution timed out
51	Execution timed out	1000 ms	81828 KB	Execution timed out
52	Execution timed out	1000 ms	81828 KB	Execution timed out
53	Execution timed out	1000 ms	81828 KB	Execution timed out
54	Execution timed out	1000 ms	57252 KB	Execution timed out
55	Execution timed out	1000 ms	57252 KB	Execution timed out
56	Memory limit exceeded	439 ms	131072 KB	Memory limit exceeded
57	Execution timed out	1000 ms	81828 KB	Execution timed out
58	Execution timed out	1000 ms	81828 KB	Execution timed out
59	Execution timed out	1000 ms	81828 KB	Execution timed out
60	Correct	249 ms	130980 KB	Output is correct
61	Memory limit exceeded	359 ms	131072 KB	Memory limit exceeded
62	Execution timed out	1000 ms	130980 KB	Execution timed out
63	Memory limit exceeded	263 ms	131072 KB	Memory limit exceeded
64	Correct	373 ms	81828 KB	Output is correct
65	Execution timed out	1000 ms	81828 KB	Execution timed out
66	Execution timed out	1000 ms	98208 KB	Execution timed out
67	Execution timed out	1000 ms	81828 KB	Execution timed out
68	Execution timed out	1000 ms	130980 KB	Execution timed out
69	Execution timed out	1000 ms	81828 KB	Execution timed out
70	Execution timed out	1000 ms	38820 KB	Execution timed out
71	Execution timed out	1000 ms	44964 KB	Execution timed out
72	Execution timed out	1000 ms	57252 KB	Execution timed out
73	Execution timed out	1000 ms	57252 KB	Execution timed out
74	Execution timed out	1000 ms	57252 KB	Execution timed out
75	Execution timed out	1000 ms	57252 KB	Execution timed out
76	Execution timed out	1000 ms	57252 KB	Execution timed out
77	Execution timed out	1000 ms	57252 KB	Execution timed out
78	Execution timed out	1000 ms	65440 KB	Execution timed out
79	Correct	513 ms	33444 KB	Output is correct
80	Execution timed out	1000 ms	33444 KB	Execution timed out
81	Execution timed out	1000 ms	35748 KB	Execution timed out
82	Execution timed out	1000 ms	57252 KB	Execution timed out
83	Execution timed out	1000 ms	57252 KB	Execution timed out
84	Correct	713 ms	33056 KB	Output is correct
85	Execution timed out	1000 ms	57252 KB	Execution timed out
86	Memory limit exceeded	373 ms	131072 KB	Memory limit exceeded
87	Execution timed out	1000 ms	57252 KB	Execution timed out
88	Execution timed out	1000 ms	57252 KB	Execution timed out
89	Execution timed out	1000 ms	81828 KB	Execution timed out
90	Execution timed out	1000 ms	44964 KB	Execution timed out
91	Execution timed out	1000 ms	81828 KB	Execution timed out
92	Execution timed out	1000 ms	81828 KB	Execution timed out
93	Memory limit exceeded	536 ms	131072 KB	Memory limit exceeded
94	Execution timed out	1000 ms	81828 KB	Execution timed out
95	Execution timed out	1000 ms	65440 KB	Execution timed out
96	Execution timed out	1000 ms	57252 KB	Execution timed out
97	Memory limit exceeded	389 ms	131072 KB	Memory limit exceeded
98	Execution timed out	1000 ms	65440 KB	Execution timed out
99	Execution timed out	1000 ms	81828 KB	Execution timed out
100	Memory limit exceeded	753 ms	131072 KB	Memory limit exceeded