제출 #340216

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
340216		Sprdalo	Bomb (IZhO17_bomb)	C++17	6 / 100	42 ms	50540 KiB

bomb

#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(){
    if (n == 1){
        int cur = 0;
        vi t;
        for (int i = 0; i < m; ++i){
            if (a[0][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());
    } else {
        int cur = 0;
        vi t;
        for (int i = 0; i < n; ++i){
            if (a[i][0] == 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 || m == 1)
        return cout << prvi() << '\n', 0;
    cout << "0\n";
}

• Subtask 1: 6 / 100