Cod sursa(job #2675215)

Utilizator George_CristianGeorge Dan-Cristian George_Cristian Data 21 noiembrie 2020 11:21:24
Problema Potrivirea sirurilor Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.29 kb
#include <fstream>
#include <cstring>

using namespace std;

ifstream f("strmatch.in");
ofstream g("strmatch.out");

#define MAXLENGTH 2000001

char text[MAXLENGTH], pattern[MAXLENGTH];
int t, p;
int n, result[MAXLENGTH], lps[MAXLENGTH];


void calculateLPSArray() {
    int lenght = 0;
    lps[0] = 0;
    for (int i = 1; i < p; ++i) {
        if (pattern[lenght] == pattern[i])
            lps[i] = ++lenght;
        else if (lenght)
            lenght = lps[lenght - 1], i--;
        else
            lps[i] = 0;
    }
}

void printLPSArray() {
    for (int i = 0; i < p; i++)
        g << lps[i] << " ";
    g << endl;
}

void findPatternMatches() {
    calculateLPSArray();
    int j = 0;
    for (int i = 0; i < t;) {
        if (pattern[j] == text[i])
            j++, i++;
        else if (j == p)
            result[n++] = i - p, j = lps[j - 1];
        else if (j)
            j = lps[j - 1];
        else
            i++;
    }
    if (j == p)
        result[n++] = t - p;
}

void printResult() {
    g << n << endl;
    if (n > 1000)
        n = 1000;
    for (int i = 0; i < n; i++)
        g << result[i] << " ";
}

int main() {
    f.getline(pattern, MAXLENGTH);
    f.getline(text, MAXLENGTH);
    p = strlen(pattern);
    t = strlen(text);

    findPatternMatches();
    printResult();

    return 0;
}