D. Determine the Photo Position (简单找子串)(2021牛客暑期多校训练营1)

传送门

 

 题意：在 n*n 的字符矩阵中的每一行找出能把 m 长由 '2' 组成的字符串放入的位置数( '0' 的位置表示空缺可填补)。

思路： 简单遍历每一行记录一下即可。

代码实现：

#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int  inf = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll   mod = 1e9+7;
const int  N = 2e3 + 5;

inline void read(int &x){
    char t=getchar();
    while(!isdigit(t)) t=getchar();
    for(x=t^48,t=getchar();isdigit(t);t=getchar()) x=x*10+(t^48);
}

int T = 1;
int n, m, ans;
char s[N][N];
string t;


signed main()
{
    IOS;

//    cin >> T;

    while(T --){
        cin >> n >> m;
        for(int i = 0; i < n; i ++) cin >> s[i];
        cin >> t;
        int x = t.size();
//        cout << "x: " << x << endl;
        for(int i = 0; i < n; i ++){
            int cnt = 0;
            for(int j = 0; j < n; j ++){
                if(s[i][j]=='0') cnt ++;
                if(j==n-1||s[i][j]=='1'){
                    if(cnt>=x) ans += cnt-x+1;
                    cnt = 0;
                }
//              cout << "cnt: " << cnt << endl;
            }
        }
        cout << ans << endl;
    }

    return 0;
}