제출 #855367

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
855367		Alfraganus	Bomb (IZhO17_bomb)	C++17	1 / 100	61 ms	6744 KiB

bomb

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ll long long
#define fs first
#define ss second
#define all(a) a.begin(), a.end()
#define print(a)          \
    for (auto x : a)      \
        cout << x << ' '; \
    cout << endl;

#define printmp(a)   \
    for (auto x : a) \
        cout << x.fs << ' ' << x.ss << endl;

void solve(){
    int n, m;
    cin >> n >> m;
    vector<vector<char>> a(n, vector<char> (m));
    for(int i = 0; i < n; i ++)
        for(int j = 0; j < m; j ++)
            cin >> a[i][j];
    if(n == 1){
        int r = 0, ans = 0, l = 0;
        while(r < m){
            while(r < m and a[0][r] == '0')
                r ++;
            l = r;
            while(r < m and a[0][r] == '1')
                r ++;
            ans += (r != l);
        }
        cout << ans;
    }
    else if(m == 1){
        int r = 0, ans = 0, l = 0;
        while (r < n)
        {
            while (r < n and a[r][0] == '0')
                r++;
            l = r;
            while (r < n and a[r][0] == '1')
                r++;
            ans += (r != l);
        }
        cout << ans;
    }
    else{
        cout << 1 << endl;
    }
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    // freopen("bomb.in", "r", stdin);
    // freopen("bomb.out", "w", stdout);
    int t = 1;
    // cin >> t;
    while(t --){
        solve();
        cout << endl;
    }
}

• Subtask 1: 1 / 100