Buzzwords

input/code.cpp: In function 'void task2()':
input/code.cpp:52:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |         for(ll j = m + 1; j < combined.length(); j++) {
      |                           ~~^~~~~~~~~~~~~~~~~~~

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <climits>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void zArray(string s, vector<ll>& z) {
    ll n = s.size();
    ll x = 0, y = 0;
    z[0] = n;
    for (int i = 1; i < n; i++) {
        z[i] = max(0ll, min(z[i-x], y-i+1));
        while (i+z[i] < n && s[z[i]] == s[i+z[i]]) {
            x = i; y = i+z[i]; z[i]++;
        }
    }
}

void task2(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    string s;
    getline(cin, s);
    
    ll n;
    cin >> n;
    cin.ignore();
    
    vector<string> words(n);
    for(ll i = 0; i < n; i++) {
        getline(cin, words[i]);
    }
    
    ll total = 0;
    
    for(ll i = 0; i < n; i++) {
        string& buzz = words[i];
        ll m = buzz.length();
        
        string combined = buzz + "$" + s;
        vector<ll> z(combined.length());
        zArray(combined, z);
        
        for(ll j = m + 1; j < combined.length(); j++) {
            if(z[j] >= m) {
                total++;
            }
        }
    }
    
    cout << total << "\n";
}

void task1(){
ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n, m;
    cin >> n >> m;
    

    if((n * m) % 2 == 1) {
        cout << "-1\n";
        return;
    }
    
    string path;
    
    
    if(n % 2 == 0) {
        for(ll row = 1; row <= n; row += 2) {
            for(ll col = 1; col < m; col++) {
                path += 'R';
            }
            if(row < n) {
                path += 'D';
            }
            for(ll col = 1; col < m; col++) {
                path += 'L';
            }
            if(row + 1 < n) {
                path += 'D';
            }
        }
        for(ll row = 1; row < n; row++) {
            path += 'U';
        }
    }
    else if(m % 2 == 0) {

        for(ll col = 1; col <= m; col += 2) {
            for(ll row = 1; row < n; row++) {
                path += 'D';
            }
            if(col < m) {
                path += 'R';
            }
            for(ll row = 1; row < n; row++) {
                path += 'U';
            }
            if(col + 1 < m) {
                path += 'R';
            }
        }
        for(ll col = 1; col < m; col++) {
            path += 'L';
        }
    }
    cout << path << "\n";

    
}

int main() {
    task2();
    
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED