oj.uz

답안 #505465

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
505465 2022-01-11T05:15:21 Z mansur Bomb (IZhO17_bomb) C++17
24 / 100
 130 ms 6480 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")

//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e9, N = 1e6 + 1, mod = 998244353;                    

vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);  
	int n, m;
	cin >> n >> m;
	char c[n + 1][m + 1];
	for (int i = 1; i <= n; i++) {
	 	for (int j = 1; j <= m; j++) {
	 	 	cin >> c[i][j];
	 	}
	}
	int h = n, w = m;
	for (int i = 1; i <= n; i++) {
		int cnt = 0;
		for (int j = 1; j <= m; j++) {
			if (c[i][j] == '1') cnt++;
			else {
				if (cnt) w = min(w, cnt);
				cnt = 0;
			}
		}
		if (cnt) w = min(w, 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) h = min(h, cnt);
				cnt = 0;
			}
		}
		if (cnt) h = min(h, cnt);
	}
	cout << h * w;
}

Compilation message

bomb.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
bomb.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
bomb.cpp:35:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   35 | main() {
      | ^~~~

Subtask #1
24.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Incorrect 1 ms 256 KB Output isn't correct
9 Incorrect 1 ms 204 KB Output isn't correct
10 Incorrect 0 ms 204 KB Output isn't correct
11 Incorrect 0 ms 204 KB Output isn't correct
12 Incorrect 0 ms 204 KB Output isn't correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Incorrect 0 ms 204 KB Output isn't correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Incorrect 1 ms 204 KB Output isn't correct
19 Incorrect 1 ms 204 KB Output isn't correct
20 Incorrect 0 ms 204 KB Output isn't correct
21 Incorrect 0 ms 204 KB Output isn't correct
22 Incorrect 1 ms 204 KB Output isn't correct
23 Incorrect 1 ms 204 KB Output isn't correct
24 Incorrect 1 ms 204 KB Output isn't correct
25 Incorrect 1 ms 204 KB Output isn't correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Incorrect 2 ms 332 KB Output isn't correct
29 Incorrect 2 ms 332 KB Output isn't correct
30 Incorrect 3 ms 492 KB Output isn't correct
31 Incorrect 3 ms 332 KB Output isn't correct
32 Incorrect 3 ms 332 KB Output isn't correct
33 Incorrect 5 ms 460 KB Output isn't correct
34 Incorrect 2 ms 332 KB Output isn't correct
35 Incorrect 5 ms 508 KB Output isn't correct
36 Correct 4 ms 460 KB Output is correct
37 Incorrect 0 ms 204 KB Output isn't correct
38 Correct 100 ms 6408 KB Output is correct
39 Incorrect 0 ms 204 KB Output isn't correct
40 Incorrect 13 ms 972 KB Output isn't correct
41 Incorrect 1 ms 204 KB Output isn't correct
42 Incorrect 1 ms 204 KB Output isn't correct
43 Correct 104 ms 6408 KB Output is correct
44 Incorrect 3 ms 460 KB Output isn't correct
45 Incorrect 127 ms 6348 KB Output isn't correct
46 Correct 98 ms 6468 KB Output is correct
47 Incorrect 101 ms 6404 KB Output isn't correct
48 Incorrect 104 ms 6404 KB Output isn't correct
49 Correct 106 ms 6404 KB Output is correct
50 Incorrect 95 ms 6348 KB Output isn't correct
51 Incorrect 86 ms 6404 KB Output isn't correct
52 Incorrect 97 ms 6408 KB Output isn't correct
53 Incorrect 93 ms 6408 KB Output isn't correct
54 Incorrect 99 ms 6408 KB Output isn't correct
55 Incorrect 93 ms 6412 KB Output isn't correct
56 Correct 109 ms 6404 KB Output is correct
57 Incorrect 104 ms 6408 KB Output isn't correct
58 Incorrect 94 ms 6348 KB Output isn't correct
59 Incorrect 105 ms 6348 KB Output isn't correct
60 Correct 94 ms 6348 KB Output is correct
61 Correct 102 ms 6408 KB Output is correct
62 Correct 112 ms 6412 KB Output is correct
63 Correct 122 ms 6348 KB Output is correct
64 Correct 85 ms 6408 KB Output is correct
65 Incorrect 105 ms 6408 KB Output isn't correct
66 Incorrect 99 ms 6404 KB Output isn't correct
67 Incorrect 99 ms 6404 KB Output isn't correct
68 Incorrect 90 ms 6468 KB Output isn't correct
69 Incorrect 96 ms 6408 KB Output isn't correct
70 Incorrect 65 ms 4200 KB Output isn't correct
71 Incorrect 93 ms 6348 KB Output isn't correct
72 Incorrect 96 ms 6348 KB Output isn't correct
73 Incorrect 89 ms 6348 KB Output isn't correct
74 Incorrect 98 ms 6480 KB Output isn't correct
75 Incorrect 130 ms 6408 KB Output isn't correct
76 Incorrect 95 ms 6412 KB Output isn't correct
77 Incorrect 86 ms 6408 KB Output isn't correct
78 Incorrect 97 ms 6348 KB Output isn't correct
79 Incorrect 103 ms 6404 KB Output isn't correct
80 Incorrect 100 ms 6408 KB Output isn't correct
81 Incorrect 89 ms 6420 KB Output isn't correct
82 Incorrect 86 ms 6348 KB Output isn't correct
83 Incorrect 93 ms 6404 KB Output isn't correct
84 Incorrect 94 ms 6412 KB Output isn't correct
85 Incorrect 93 ms 6348 KB Output isn't correct
86 Incorrect 95 ms 6412 KB Output isn't correct
87 Incorrect 96 ms 6404 KB Output isn't correct
88 Incorrect 95 ms 6408 KB Output isn't correct
89 Incorrect 103 ms 6408 KB Output isn't correct
90 Incorrect 54 ms 4220 KB Output isn't correct
91 Incorrect 85 ms 6408 KB Output isn't correct
92 Incorrect 98 ms 6412 KB Output isn't correct
93 Incorrect 94 ms 6348 KB Output isn't correct
94 Incorrect 94 ms 6404 KB Output isn't correct
95 Incorrect 102 ms 6416 KB Output isn't correct
96 Incorrect 101 ms 6412 KB Output isn't correct
97 Incorrect 96 ms 6408 KB Output isn't correct
98 Incorrect 99 ms 6404 KB Output isn't correct
99 Incorrect 101 ms 6348 KB Output isn't correct
100 Incorrect 98 ms 6348 KB Output isn't correct