Submission #340219

# Submission time Handle Problem Language Result Execution time Memory
340219 2020-12-27T10:22:42 Z Sprdalo Bomb (IZhO17_bomb) C++17
10 / 100
131 ms 49536 KB
#include <bits/stdc++.h>

using namespace std;

#define int ll
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pi> vp;
typedef vector<pl> vpl;

const int maxn = 2505;
int a[maxn][maxn], n, m;

int prvi(int ind){
    int cur = 0;
    vi t;
    for (int i = 0; i < m; ++i){
        if (a[ind][i] == 1)
            ++cur;
        else{
            if (!cur) continue;
            t.push_back(cur);
            cur = 0;
        }
    }

    if (cur)
        t.push_back(cur);

    if (t.empty())
        return 0;
    return *min_element(t.begin(), t.end());
}

int prvim(int ind){
    int cur = 0;
    vi t;
    for (int i = 0; i < n; ++i){
        if (a[i][ind] == 1)
            ++cur;
        else{
            if (!cur) continue;
            t.push_back(cur);
            cur = 0;
        }
    }

    if (cur)
        t.push_back(cur);

    if (t.empty())
        return 0;
    return *min_element(t.begin(), t.end());
}

signed main()
{
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr); 
    cout.tie(nullptr); 
    cerr.tie(nullptr);    

    cin >> n >> m;

    for (int i = 0; i < n; ++i){
        string s;
        cin >> s;

        for (int j = 0; j < m; ++j)
            a[i][j] = s[j]-'0';
    }

    if (n == 1)
        return cout << prvi(0) << '\n', 0;

    if (m == 1)
        return cout << prvim(0) << '\n', 0;

    int sol = prvi(0);
    for (int i = 0; i < n; ++i){
        int x = prvi(i);
        if (!x) continue;
        sol = min(sol, x);
    }

    int res = prvim(0);
    for (int i = 0; i < m; ++i){
        int x = prvim(i);
        if (!x) continue;
        res = min(res, x);
    }

    cout << max(sol, res) << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 5 ms 10476 KB Output is correct
4 Correct 5 ms 10476 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 0 ms 364 KB Output isn't correct
8 Incorrect 1 ms 364 KB Output isn't correct
9 Incorrect 1 ms 364 KB Output isn't correct
10 Incorrect 1 ms 364 KB Output isn't correct
11 Incorrect 1 ms 364 KB Output isn't correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Incorrect 1 ms 364 KB Output isn't correct
15 Incorrect 1 ms 364 KB Output isn't correct
16 Incorrect 1 ms 364 KB Output isn't correct
17 Incorrect 1 ms 620 KB Output isn't correct
18 Incorrect 1 ms 620 KB Output isn't correct
19 Incorrect 1 ms 748 KB Output isn't correct
20 Incorrect 1 ms 748 KB Output isn't correct
21 Incorrect 1 ms 620 KB Output isn't correct
22 Incorrect 1 ms 748 KB Output isn't correct
23 Incorrect 1 ms 876 KB Output isn't correct
24 Incorrect 1 ms 748 KB Output isn't correct
25 Incorrect 1 ms 876 KB Output isn't correct
26 Incorrect 1 ms 876 KB Output isn't correct
27 Correct 2 ms 2156 KB Output is correct
28 Incorrect 2 ms 2412 KB Output isn't correct
29 Incorrect 3 ms 2944 KB Output isn't correct
30 Incorrect 3 ms 3584 KB Output isn't correct
31 Incorrect 3 ms 2924 KB Output isn't correct
32 Incorrect 3 ms 3200 KB Output isn't correct
33 Incorrect 3 ms 3692 KB Output isn't correct
34 Incorrect 2 ms 2412 KB Output isn't correct
35 Incorrect 3 ms 3692 KB Output isn't correct
36 Incorrect 3 ms 3712 KB Output isn't correct
37 Incorrect 1 ms 364 KB Output isn't correct
38 Incorrect 119 ms 49388 KB Output isn't correct
39 Incorrect 1 ms 364 KB Output isn't correct
40 Incorrect 9 ms 9964 KB Output isn't correct
41 Incorrect 1 ms 364 KB Output isn't correct
42 Incorrect 1 ms 876 KB Output isn't correct
43 Incorrect 128 ms 49388 KB Output isn't correct
44 Incorrect 3 ms 3692 KB Output isn't correct
45 Incorrect 123 ms 49388 KB Output isn't correct
46 Incorrect 124 ms 49516 KB Output isn't correct
47 Incorrect 121 ms 49536 KB Output isn't correct
48 Incorrect 121 ms 49388 KB Output isn't correct
49 Incorrect 122 ms 49388 KB Output isn't correct
50 Incorrect 121 ms 49388 KB Output isn't correct
51 Incorrect 126 ms 49388 KB Output isn't correct
52 Incorrect 123 ms 49388 KB Output isn't correct
53 Incorrect 120 ms 49388 KB Output isn't correct
54 Incorrect 131 ms 49456 KB Output isn't correct
55 Incorrect 125 ms 49408 KB Output isn't correct
56 Incorrect 122 ms 49388 KB Output isn't correct
57 Incorrect 122 ms 49456 KB Output isn't correct
58 Incorrect 122 ms 49388 KB Output isn't correct
59 Incorrect 123 ms 49516 KB Output isn't correct
60 Incorrect 122 ms 49408 KB Output isn't correct
61 Incorrect 121 ms 49516 KB Output isn't correct
62 Incorrect 120 ms 49516 KB Output isn't correct
63 Incorrect 121 ms 49516 KB Output isn't correct
64 Incorrect 123 ms 49516 KB Output isn't correct
65 Incorrect 123 ms 49516 KB Output isn't correct
66 Incorrect 124 ms 49388 KB Output isn't correct
67 Incorrect 123 ms 49388 KB Output isn't correct
68 Incorrect 125 ms 49408 KB Output isn't correct
69 Incorrect 122 ms 49388 KB Output isn't correct
70 Incorrect 83 ms 39532 KB Output isn't correct
71 Incorrect 126 ms 49516 KB Output isn't correct
72 Incorrect 122 ms 49388 KB Output isn't correct
73 Incorrect 123 ms 49516 KB Output isn't correct
74 Incorrect 122 ms 49388 KB Output isn't correct
75 Incorrect 123 ms 49388 KB Output isn't correct
76 Incorrect 122 ms 49388 KB Output isn't correct
77 Incorrect 122 ms 49388 KB Output isn't correct
78 Incorrect 122 ms 49388 KB Output isn't correct
79 Incorrect 126 ms 49388 KB Output isn't correct
80 Incorrect 125 ms 49388 KB Output isn't correct
81 Incorrect 122 ms 49388 KB Output isn't correct
82 Incorrect 121 ms 49388 KB Output isn't correct
83 Incorrect 122 ms 49516 KB Output isn't correct
84 Incorrect 127 ms 49388 KB Output isn't correct
85 Incorrect 121 ms 49388 KB Output isn't correct
86 Incorrect 121 ms 49388 KB Output isn't correct
87 Correct 122 ms 49516 KB Output is correct
88 Incorrect 124 ms 49388 KB Output isn't correct
89 Incorrect 122 ms 49388 KB Output isn't correct
90 Incorrect 84 ms 39652 KB Output isn't correct
91 Incorrect 122 ms 49388 KB Output isn't correct
92 Incorrect 121 ms 49388 KB Output isn't correct
93 Incorrect 122 ms 49456 KB Output isn't correct
94 Incorrect 127 ms 49456 KB Output isn't correct
95 Incorrect 122 ms 49516 KB Output isn't correct
96 Incorrect 125 ms 49388 KB Output isn't correct
97 Incorrect 122 ms 49388 KB Output isn't correct
98 Incorrect 121 ms 49388 KB Output isn't correct
99 Incorrect 121 ms 49388 KB Output isn't correct
100 Incorrect 123 ms 49516 KB Output isn't correct