oj.uz

답안 #505440

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
505440 2022-01-11T05:04:12 Z mansur Bomb (IZhO17_bomb) C++17
6 / 100
 105 ms 6420 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];
	 	}
	}
	if (n == 1) {
		int cnt = 0, mn = n * m;
		for (int i = 1; i <= m; i++) {
			if (c[1][i] == '1') cnt++;
			else {
				if (cnt)
					mn = min(mn, cnt);
				cnt = 0;
			}
		}
		if (cnt) mn = min(mn, cnt);
		cout << mn << nl;
	}else if (m == 1) {
		int cnt = 0, mn = n * m;
		for (int i = 1; i <= n; i++) {
			if (c[i][1] == '1') cnt++;
			else {
				if (cnt)
					mn = min(mn, cnt);
				cnt = 0;
			}
		}
		if (cnt) mn = min(mn, cnt);
		cout << mn << nl;
	}else cout << 1;
}

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
6.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 204 KB Output is correct
7 Incorrect 0 ms 204 KB Output isn't correct
8 Incorrect 0 ms 204 KB Output isn't correct
9 Incorrect 0 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 Incorrect 1 ms 204 KB Output isn't correct
14 Incorrect 0 ms 204 KB Output isn't correct
15 Incorrect 1 ms 204 KB Output isn't correct
16 Incorrect 1 ms 204 KB Output isn't correct
17 Incorrect 0 ms 204 KB Output isn't correct
18 Incorrect 1 ms 204 KB Output isn't correct
19 Incorrect 1 ms 204 KB Output isn't correct
20 Incorrect 1 ms 204 KB Output isn't correct
21 Incorrect 1 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 0 ms 204 KB Output isn't correct
25 Incorrect 1 ms 208 KB Output isn't correct
26 Incorrect 1 ms 204 KB Output isn't correct
27 Incorrect 1 ms 332 KB Output isn't correct
28 Incorrect 2 ms 336 KB Output isn't correct
29 Incorrect 2 ms 332 KB Output isn't correct
30 Incorrect 3 ms 488 KB Output isn't correct
31 Incorrect 3 ms 332 KB Output isn't correct
32 Incorrect 2 ms 460 KB Output isn't correct
33 Incorrect 3 ms 508 KB Output isn't correct
34 Incorrect 2 ms 332 KB Output isn't correct
35 Incorrect 3 ms 460 KB Output isn't correct
36 Incorrect 4 ms 508 KB Output isn't correct
37 Incorrect 1 ms 204 KB Output isn't correct
38 Incorrect 86 ms 6408 KB Output isn't correct
39 Incorrect 0 ms 204 KB Output isn't correct
40 Incorrect 11 ms 972 KB Output isn't correct
41 Incorrect 0 ms 204 KB Output isn't correct
42 Incorrect 0 ms 204 KB Output isn't correct
43 Incorrect 84 ms 6412 KB Output isn't correct
44 Incorrect 3 ms 460 KB Output isn't correct
45 Incorrect 78 ms 6348 KB Output isn't correct
46 Incorrect 79 ms 6408 KB Output isn't correct
47 Incorrect 78 ms 6408 KB Output isn't correct
48 Incorrect 75 ms 6408 KB Output isn't correct
49 Incorrect 97 ms 6412 KB Output isn't correct
50 Incorrect 85 ms 6404 KB Output isn't correct
51 Incorrect 83 ms 6408 KB Output isn't correct
52 Incorrect 81 ms 6404 KB Output isn't correct
53 Incorrect 81 ms 6348 KB Output isn't correct
54 Incorrect 86 ms 6348 KB Output isn't correct
55 Incorrect 76 ms 6348 KB Output isn't correct
56 Incorrect 83 ms 6348 KB Output isn't correct
57 Incorrect 77 ms 6408 KB Output isn't correct
58 Incorrect 92 ms 6404 KB Output isn't correct
59 Incorrect 81 ms 6408 KB Output isn't correct
60 Incorrect 75 ms 6348 KB Output isn't correct
61 Incorrect 76 ms 6348 KB Output isn't correct
62 Incorrect 76 ms 6408 KB Output isn't correct
63 Incorrect 82 ms 6348 KB Output isn't correct
64 Incorrect 79 ms 6348 KB Output isn't correct
65 Incorrect 81 ms 6412 KB Output isn't correct
66 Incorrect 76 ms 6348 KB Output isn't correct
67 Incorrect 81 ms 6412 KB Output isn't correct
68 Incorrect 80 ms 6404 KB Output isn't correct
69 Incorrect 88 ms 6408 KB Output isn't correct
70 Incorrect 49 ms 4208 KB Output isn't correct
71 Incorrect 80 ms 6408 KB Output isn't correct
72 Incorrect 79 ms 6412 KB Output isn't correct
73 Incorrect 77 ms 6404 KB Output isn't correct
74 Incorrect 88 ms 6408 KB Output isn't correct
75 Incorrect 78 ms 6408 KB Output isn't correct
76 Incorrect 79 ms 6348 KB Output isn't correct
77 Incorrect 79 ms 6404 KB Output isn't correct
78 Incorrect 77 ms 6404 KB Output isn't correct
79 Incorrect 90 ms 6408 KB Output isn't correct
80 Incorrect 81 ms 6408 KB Output isn't correct
81 Incorrect 77 ms 6408 KB Output isn't correct
82 Incorrect 75 ms 6404 KB Output isn't correct
83 Incorrect 80 ms 6404 KB Output isn't correct
84 Incorrect 77 ms 6412 KB Output isn't correct
85 Incorrect 79 ms 6412 KB Output isn't correct
86 Incorrect 77 ms 6348 KB Output isn't correct
87 Incorrect 77 ms 6348 KB Output isn't correct
88 Incorrect 90 ms 6404 KB Output isn't correct
89 Incorrect 83 ms 6408 KB Output isn't correct
90 Incorrect 55 ms 4172 KB Output isn't correct
91 Incorrect 105 ms 6408 KB Output isn't correct
92 Incorrect 77 ms 6420 KB Output isn't correct
93 Incorrect 76 ms 6404 KB Output isn't correct
94 Incorrect 76 ms 6404 KB Output isn't correct
95 Incorrect 85 ms 6404 KB Output isn't correct
96 Incorrect 93 ms 6412 KB Output isn't correct
97 Incorrect 92 ms 6404 KB Output isn't correct
98 Incorrect 81 ms 6348 KB Output isn't correct
99 Incorrect 87 ms 6408 KB Output isn't correct
100 Incorrect 75 ms 6408 KB Output isn't correct