Плюсы минусы

#pragma once
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>
#include <math.h>
#include <queue>
#include <stack>
#include <climits>
#include <deque>
#include <ctime>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <fstream>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;

#define mh() make_heap()
#define poph() pop_heap()
#define pushh() push_heap()
#define sor(n) n.begin(), n.end()
#define rsor(n) n.rbegin(), n.rend()
#define mp make_pair
#define files freopen("input.txt", "rt", stdin); freopen("output.txt", "wt", stdout)
#define p(T) pair<T,T>
#define toch(x) cout.precision(x), cout.setf(ios::fixed)
#define znac(l) abs(l)/l
#define IOS ios::sync_with_stdio(false)
#define IOSB cin.tie(0), cout.tie(0);
const ll ok = ll(1e9 + 7);
string pol[1001];
ll scp=0, scmin=0;
void fix(ll i, ll j, ll sizei, ll sizej)
{
    for (int i1 = i; i1 < sizei; i1++)
    {
        for (int j1 = j; j1 < sizej; j1++)
            pol[i1][j1] = '0';
    }
}
ll findzn(ll i, ll j, ll n, ll m)
{
    ll starti = i;
    ll startj = j;
    ll s = 0;
    while (j < m&&pol[i][j] == '1')
    {
        s++;
        j++;
    }
    ll s2 = 0;
    while (i < n&&pol[i][startj] == '1'&&s2<s)
    {
        s2++;
        i++;
    }
    if (s2 == s)
    {
        if (j != 0 && pol[i][j-1] == '1')
        {
            fix(starti, startj - s, starti + 3 * s, startj + 2 * s);
            scp++;
            return startj + 2 * s;
        }
    }
    while (i < m&&pol[starti][i] == '1')
    {
        s2++;
        i++;
    }
    fix(starti, startj, starti + s2, startj + 3*s2);
    scmin++;
    return starti;
}

int main()
{
    IOSB;
    IOS;
#ifdef TheCompiler
    files;
#endif
    ll n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++)
    {
            cin >> pol[i];
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (pol[i][j] == '1')
            {
                j=findzn(i, j, n, m);
            }
        }
    }
    cout << scp << " " << scmin;
    return 0;
}