Submission #1094623

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1094623	2024-09-30T07:06:35 Z	alexdd	Brperm (RMI20_brperm)	C++17	Compilation error	0 ms	0 KB

brperm

#include "brperm.h"
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+9;
long long p[530005];
int put(int a, int exp)
{
    if(exp==0)
        return 1;
    if(exp%2==0)
        return put(a*a%MOD,exp/2);
    else
        return put(a*a%MOD,exp/2)*a%MOD;
}
int rev(int x, int k)
{
    int aux=0;
    for(int i=0;i<k;i++)
        if(((1<<i)&x))
            aux += (1<<(k-i-1));
    return aux;
}
long long hsh[500005][19];
long long normal[500005][19];
char s[500005];
void init(int n, const char copS[])
{
    for(int i=0;i<n;i++)
        s[i] = copS[i];
    p[0]=1;
    p[1]=31;
    for(int i=2;i<=(1<<19);i++)
        p[i] = (p[i-1]*p[1])%MOD;

    for(int i=0;i<n;i++)
    {
        hsh[i][0] = normal[i][0] = s[i];
    }
    for(int k=1;k<19;k++)
    {
        for(int i=0;i+(1<<k)-1<n;i++)
        {
            hsh[i][k] = (hsh[i][k-1] + hsh[i+(1<<(k-1))][k-1]*p[(1<<(18-k))])%MOD;

            for(int j=0;j<(1<<k);j++)
            {
                normal[i][k] = (normal[i][k] + s[i+j]*p[j*(1<<(18-k))])%MOD;
            }

        }
    }
}

int query(int i, int k)
{
    for(int j=0;j<(1<<k);j++)
        if(s[i+j]!=s[i+rev(j,k)])
            return 0;
    return 1;
    return hsh[i][k] == normal[i][k];
}

Compilation message

/usr/bin/ld: /tmp/cc51JTbL.o:(.bss+0x0): multiple definition of `s'; /tmp/ccqRaBcJ.o:(.bss+0x0): first defined here
collect2: error: ld returned 1 exit status