Cod sursa(job #1418387)

Utilizator EpictetStamatin Cristian Epictet Data 12 aprilie 2015 22:09:28
Problema Abc2 Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.57 kb
#include <fstream>
#include <algorithm>
#include <string>
#include <vector>
#define MOD 666013
#define ui unsigned int
using namespace std;
ifstream fin ("abc2.in");
ofstream fout ("abc2.out");
vector < ui > H[MOD + 10];
string T, C;
ui N, aux, sol, P3[25];

bool Caut(ui val)
{
    ui l = val % MOD;
    int st = 0, dr = H[l].size() - 1, mij;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        if (H[l][mij] < val) st = mij + 1;
        else if (H[l][mij] > val) dr = mij - 1;
        else return 1;
    }
    return 0;
}

int main()
{
    P3[1] = 1;
    for (int i = 2; i <= 20; i++) {
        P3[i] = P3[i - 1] * 3;
    }

    fin >> T;
    while (fin >> C)
    {
        N = C.size();
        aux = 0;
        for (int i = 0; i < N; i++)
        {
            if (C[i] == 'b') {
                aux = aux + P3[i + 1];
            }
            else if (C[i] == 'c') {
                aux = aux + P3[i + 1] * 2;
            }
        }

        H[aux % MOD].push_back(aux);
    }

    aux = 0;
    for (int i = 0; i < N; i++)
    {
        if (T[i] == 'b') {
            aux = aux + P3[i + 1];
        }
        else if (T[i] == 'c') {
            aux = aux + P3[i + 1] * 2;
        }
    }

    for (int i = 0; i < MOD; i++) {
        sort (H[i].begin(), H[i].end());
    }

    sol = Caut(aux);
    for (ui i = N; i < T.size(); i++)
    {
        aux /= 3;
        if (T[i] == 'b') {
            aux = aux + P3[N];
        }
        else if (T[i] == 'c') {
            aux = aux + P3[N] * 2;
        }
        sol += Caut(aux);
    }

    fout << sol << '\n';
    fout.close();
    return 0;
}