1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;

const int max_nm = 1000*1000+ 99;

int N[max_nm];
int M[max_nm];
int B[max_nm];

unsigned int nwd(int x, int y)
{
    if (x == 0)
        return y;
    if (y == 0)
        return x;

    int k=0;
    while(!((x | y) & 1))
    {
        x>>=1; y>>=1;
        k++;
    }

    while (!(x & 1))
    x>>=1;
    do {
        while (!(y & 1))
        y>>=1;
        if (x > y)
            swap(x, y);
        y=y-x;
    } while (y != 0);
    return (x<<k);
}

int main() {
    int n, m;
    cin>>n;
    for(int i = 0; i < n; i++)
    {
        cin>>N[i];
        B[i]=N[i];
    }
    cin>>m;
    char c;
    for(int i = 0; i < m; i++)
    {
        cin>>c;
        if(c == 'W')
            M[i]=1;
        else
            M[i]=-1;
    }

    bool p = false;
    int f = 0;
    long long nww=n*m/nwd(min(n,m), max(n, m));
    for(long long i = 0; i < nww; i++)
    {
        f++;
        N[ (i%n) ] += M[ (i%m) ];
        if(N[ (i%n) ] == 0)
        {
            p = true;
            break;
        }
    }
    if(p) {
        cout<<f<<endl;
    } else {
        int t;
        int q = 2*1000*1000+9;
        bool g = false;
        for(int i = 0; i < n; i++)
        {
            int d = N[i] - B[i];
           // cout<<d<<" ";
            if( d < 0 ) {
                t = abs(N[i]/d);
                q = min (t, q);
                g = true;
            }
        }
        if(g) {
            bool h = false;
            int j ;
            for(int i = 0; i < n; i++)
            {
                int d = N[i] - B[i];
                N[i]+= (q*d);
                if(N[i] == 0)
                {
                    h = true;
                    j=i+1;
                    break;
                }
            }
            if(h) {
                cout<<nww*q+j<<endl;
            } else {
                    f=0;
                    for(long long i = 0; i < nww; i++)
                    {
                        f++;
                        N[ (i%n) ] += M[ (i%m) ];
                        if(N[ (i%n) ] == 0)
                        {
                            break;
                        }
                    }
                    cout<<nww*q+f<<endl;
                }
            } else {
                cout<<-1<<endl;
            }
        }

    return 0;
}