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
#include <iostream>
#include <vector>
using namespace std;

int a,b;
vector <int> mon;
vector <int> pnww;
vector <bool> win;

long long nwd(long long a, long long b)
{
    if(a==0)
        return b;
    return nwd(b%a,a);
}
long long nww(long long a, long long b)
{
    return (a*b)/nwd(a,b);
}
void read()
{
    cin >> a;
    int pom;
    for(int i = 0; i < a; i++)
    {
        //scanf("%d",&(pom));
        cin >> pom;
        mon.push_back(pom);
        pnww.push_back(pom);
    }
    cin >> b;
    char s;
    for(int i = 0; i < b; i++)
    {
        cin >> s;
        if(s=='W')
        {
            win.push_back(true);
        }
        else
        if(s=='P')
        {
            win.push_back(false);
        }
    }
}

long long solve()
{
    int it = 0;
    long long suma = 0;
    int mink= 1000001;
    long long nwww =  nww(a,b);
    while(suma <= nwww)
    {
        for(int i = 0; i<b; i++)
        {
            if(win[i])
                mon[it]++;
            else
                mon[it]--;
            suma++;
            if(mon[it]<=0)
                return suma;
            it++;
            it%=a;
        }
    }
    int pom;
    for(int i = 0; i<mon.size(); i++)
    {
        if(pnww[i]-mon[i]>0)
        {
            pom = mon[i]/(pnww[i]-mon[i]);
            if(pom<mink)
                mink=pom;
            mon[i] -= pom * (pnww[i]-mon[i]);
        }
    }
    if(mink==1000001)
        return -1;
    else
    {
        suma+=mink*a;//mon.size();
        it = 0;
        int licznikn = 0;
        while(licznikn <= nwww)
            {
            for(int i = 0; i<b; i++)
            {
                if(win[i])
                    mon[it]++;
                else
                    mon[it]--;
                suma++;
                if(mon[it]<=0)
                    return suma;
                it++;
                it%=a;
            }
            }
        //return -1;

    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    read();
    /*for(int i = 0; i< mon.size(); i++)
        cout << mon[i] << " ";
    cout << endl;
    for(int i = 0; i< win.size(); i++)
        cout << win[i] << " ";*/
    cout << solve();
    return 0;
}