Cod sursa(job #837525)

Utilizator szabibibiOrban Szabolcs szabibibi Data 18 decembrie 2012 02:37:43
Problema Abc2 Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.7 kb
#include <stdio.h>
#include <vector>
#include <string.h>

#define CMAX 10000002
#define NMAX 50000
#define LMAX 22
#define P 666013

using namespace std;

char cuv[CMAX];
vector <unsigned long> hash[P];
unsigned long harr;
long l, c;
long count;

unsigned long val(char *s)
{
    long i;
    unsigned long sol = 0;   
    for (i = 0; i < l; i++)
        sol = (sol * 3) + (s[i] - 'a');
    return sol;
}

void read()
{
     char s[LMAX];
     unsigned long vall;
     unsigned long vel;
     
     gets(cuv);
     c = strlen(cuv);
     while (gets(s))
     {
           if (l == 0)
              l = strlen(s);
           vall = val(s);
           vel = vall % P;
           hash[vel].push_back(vall);
     }
}

inline unsigned long calc_put()
{
     int i;
     unsigned long p = 1;
     for (i = 1; i < l; i++)
         p = p * 3;
     return p;
}

inline int search_val(unsigned long vall)
{
    unsigned long poz = vall % P;
    vector <unsigned long> :: iterator ittt;

    for (ittt = hash[poz].begin(); ittt != hash[poz].end(); ++ittt)
        if (*ittt == vall)
           return 1;
    return 0;
}

void dostuff()
{
     long i;
     unsigned long vall = val(cuv), sval, eval;

     if (search_val(vall))
        count++;
        
     harr = calc_put();
     
     for (i = 1; i <= c - l; i++)
     {
         sval = (cuv[i - 1] - 'a') * harr;
         eval = cuv[i + l - 1] - 'a';
         vall = (vall - sval) * 3 + eval;
         if (search_val(vall))
            count++;
     }
}

int main()
{
    freopen("abc2.out", "w", stdout);
    freopen("abc2.in", "r", stdin);
    read();
    dostuff();
    printf("%ld", count);
    return 0;
}