#include <algorithm> #include <cstdio> using namespace std; typedef long long ll; int main() { int n; scanf("%d", &n)?:0; int cash[n]; for(int i = 0; i < n; i++) scanf("%d", &cash[i])?:0; int m; scanf("%d", &m)?:0; bool cycle[m]; for(int i = 0; i < m; i++) { char tmp; scanf(" %c", &tmp)?:0; cycle[i] = (tmp=='W')?true:false; } ll res = 2*(1e18); for(int i = 0; i < n; i++) { //printf("%d\n", i); //printf("i = %d\n", i); ll pos = i%m, curr = cash[i], played = 0, min_cash = cash[i]+2, min_cash_played = -1; do { //printf("pos = %d\n", pos); curr += (cycle[pos])?1:(-1); //printf("pos = %lld, curr = %lld\n", pos, curr); played++; //printf("\tplayed = %lld\n", played); if(curr < min_cash) { min_cash = curr; min_cash_played = played; } if(curr == 0) break; pos = (pos+n)%m; } while(pos != i%m /*&& played < res*/); if(curr == 0) { res = min(res, played*n-(n-i-1)); //printf("a %lld\n", played*n-(n-i-1)); continue; } ll cycle_diff = curr-cash[i], min_cash_diff = min_cash-cash[i]; //printf("cycle_diff = %lld\n", cycle_diff); if(cycle_diff < 0) { if(curr+min_cash_diff >= 0) { //puts("b"); played *= -((curr+min_cash_diff)/cycle_diff)+1; curr += (-((curr+min_cash_diff)/cycle_diff))*cycle_diff; } else { //printf("cc %lld %lld\n", -(curr/cycle_diff), min_cash_diff); played *= -(curr/cycle_diff)+1; curr += (-(curr/cycle_diff))*cycle_diff; } while(curr != 0 /*&& played < res*/) { //puts("druga petla"); curr += (cycle[pos])?1:(-1); played++; pos = (pos+n)%m; } res = min(res, played*n-(n-i-1)); //printf("%lld\n", played*n-(n-i-1)); } //puts("jestem"); //printf("played = %lld, i = %d\n", played, i); } //puts("wtf"); if(res == 2*(1e18)) puts("-1"); else printf("%lld\n", res); return 0; } /* 4 2 3 2 1 3 WPP */
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 | #include <algorithm> #include <cstdio> using namespace std; typedef long long ll; int main() { int n; scanf("%d", &n)?:0; int cash[n]; for(int i = 0; i < n; i++) scanf("%d", &cash[i])?:0; int m; scanf("%d", &m)?:0; bool cycle[m]; for(int i = 0; i < m; i++) { char tmp; scanf(" %c", &tmp)?:0; cycle[i] = (tmp=='W')?true:false; } ll res = 2*(1e18); for(int i = 0; i < n; i++) { //printf("%d\n", i); //printf("i = %d\n", i); ll pos = i%m, curr = cash[i], played = 0, min_cash = cash[i]+2, min_cash_played = -1; do { //printf("pos = %d\n", pos); curr += (cycle[pos])?1:(-1); //printf("pos = %lld, curr = %lld\n", pos, curr); played++; //printf("\tplayed = %lld\n", played); if(curr < min_cash) { min_cash = curr; min_cash_played = played; } if(curr == 0) break; pos = (pos+n)%m; } while(pos != i%m /*&& played < res*/); if(curr == 0) { res = min(res, played*n-(n-i-1)); //printf("a %lld\n", played*n-(n-i-1)); continue; } ll cycle_diff = curr-cash[i], min_cash_diff = min_cash-cash[i]; //printf("cycle_diff = %lld\n", cycle_diff); if(cycle_diff < 0) { if(curr+min_cash_diff >= 0) { //puts("b"); played *= -((curr+min_cash_diff)/cycle_diff)+1; curr += (-((curr+min_cash_diff)/cycle_diff))*cycle_diff; } else { //printf("cc %lld %lld\n", -(curr/cycle_diff), min_cash_diff); played *= -(curr/cycle_diff)+1; curr += (-(curr/cycle_diff))*cycle_diff; } while(curr != 0 /*&& played < res*/) { //puts("druga petla"); curr += (cycle[pos])?1:(-1); played++; pos = (pos+n)%m; } res = min(res, played*n-(n-i-1)); //printf("%lld\n", played*n-(n-i-1)); } //puts("jestem"); //printf("played = %lld, i = %d\n", played, i); } //puts("wtf"); if(res == 2*(1e18)) puts("-1"); else printf("%lld\n", res); return 0; } /* 4 2 3 2 1 3 WPP */ |