#include <vector> #include <iostream> #include <sstream> #include <math.h> #include <sys/time.h> #include <cstdlib> #include <algorithm> #include <cassert> #include <cstring> #include <fstream> #include <set> #define FOR(i,a,b) for(__typeof(b) i=(a);i<(b);++i) #define REP(i,a) FOR(i,0,a) #define FOREACH(x,c) for(__typeof(c.begin()) x=c.begin();x != c.end(); x++) #define ALL(c) c.begin(),c.end() #define CLEAR(c) memset(c,0,sizeof(c)) #define SIZE(c) (int) ((c).size()) #define PB push_back #define MP make_pair #define X first #define Y second #define ULL unsigned long long #define LL long long #define LD long double #define II pair<int, int> #define DD pair<double, double> #define VC vector #define VI VC<int> #define VVI VC<VI> #define VD VC<double> #define VS VC<string> #define VII VC<II> #define VDD VC<DD> #define DB(a) cerr << #a << ": " << a << endl; using namespace std; template<class T> void print(VC < T > v) {cerr << "[";if (SIZE(v) != 0) cerr << v[0]; FOR(i, 1, SIZE(v)) cerr << "," << v[i]; cerr << "]\n";} template<class T> string i2s(T &x) { ostringstream o; o << x; return o.str(); } VS split(string &s, char c = ' ') {VS all; int p = 0, np; while (np = s.find(c, p), np >= 0) {if (np != p) all.PB(s.substr(p, np - p)); p = np + 1;} if (p < SIZE(s)) all.PB(s.substr(p)); return all;} #define N 1000000 int n; VI x; int m; VI pattern; int total; struct DP{ LL k; VI sum; VI low; DP(){ sum.resize(m); low.resize(m);} void sw(DP &x){ sum.swap(x.sum); low.swap(x.low); swap(k,x.k);} }; void add(const DP &a, const DP &b, DP &c){ int shift = (((LL)(a.k))*n)%m; c.k = a.k+b.k; int j=shift; REP(i,m){ c.sum[i] = a.sum[i]+b.sum[j]; c.low[i] = min(a.low[i],a.sum[i]+b.low[j]); j = (j==m-1)?0:(j+1); } } VC<DP> dp; void readData(){ scanf("%d",&n); x.resize(n); REP(i,n) scanf("%d",&(x[i])); scanf("%d",&m); char p[N+1]; scanf("%s",p); pattern.resize(m); REP(i,m) pattern[i] = (p[i] == 'W')?1:(-1); total = 0; REP(i,m) total += pattern[i]; } int mod[N]; int check(const DP &dp){ REP(i,n){ if (x[i]+dp.low[mod[i]] <= 0) return i; } return -1; } void solve(){ REP(i,n) mod[i] = i%m; dp.PB(DP()); dp[0].k = 1; REP(i,m) dp[0].sum[i] = pattern[i]; REP(i,m) dp[0].low[i] = min(pattern[i],0); while(1){ if (check(dp.back()) >= 0){ if (SIZE(dp) > 1){ DP right; right.sw(dp.back()); dp.pop_back(); DP left; left.sw(dp.back()); dp.pop_back(); DP mid; while (!dp.empty()){ add(left,dp.back(),mid); if (check(mid) >= 0){ right.sw(mid); }else left.sw(mid); dp.pop_back(); } dp.PB(right); } cout << ((LL)n)*(dp.back().k-1) + check(dp.back())+1 << endl; return; } if (dp.back().k >= m && total >= 0){ cout << "-1" << endl; return; } dp.PB(DP()); add(dp[SIZE(dp)-2],dp[SIZE(dp)-2],dp.back()); } } int main(int argc, char *argv[]){ readData(); solve(); return 0; }
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 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 | #include <vector> #include <iostream> #include <sstream> #include <math.h> #include <sys/time.h> #include <cstdlib> #include <algorithm> #include <cassert> #include <cstring> #include <fstream> #include <set> #define FOR(i,a,b) for(__typeof(b) i=(a);i<(b);++i) #define REP(i,a) FOR(i,0,a) #define FOREACH(x,c) for(__typeof(c.begin()) x=c.begin();x != c.end(); x++) #define ALL(c) c.begin(),c.end() #define CLEAR(c) memset(c,0,sizeof(c)) #define SIZE(c) (int) ((c).size()) #define PB push_back #define MP make_pair #define X first #define Y second #define ULL unsigned long long #define LL long long #define LD long double #define II pair<int, int> #define DD pair<double, double> #define VC vector #define VI VC<int> #define VVI VC<VI> #define VD VC<double> #define VS VC<string> #define VII VC<II> #define VDD VC<DD> #define DB(a) cerr << #a << ": " << a << endl; using namespace std; template<class T> void print(VC < T > v) {cerr << "[";if (SIZE(v) != 0) cerr << v[0]; FOR(i, 1, SIZE(v)) cerr << "," << v[i]; cerr << "]\n";} template<class T> string i2s(T &x) { ostringstream o; o << x; return o.str(); } VS split(string &s, char c = ' ') {VS all; int p = 0, np; while (np = s.find(c, p), np >= 0) {if (np != p) all.PB(s.substr(p, np - p)); p = np + 1;} if (p < SIZE(s)) all.PB(s.substr(p)); return all;} #define N 1000000 int n; VI x; int m; VI pattern; int total; struct DP{ LL k; VI sum; VI low; DP(){ sum.resize(m); low.resize(m);} void sw(DP &x){ sum.swap(x.sum); low.swap(x.low); swap(k,x.k);} }; void add(const DP &a, const DP &b, DP &c){ int shift = (((LL)(a.k))*n)%m; c.k = a.k+b.k; int j=shift; REP(i,m){ c.sum[i] = a.sum[i]+b.sum[j]; c.low[i] = min(a.low[i],a.sum[i]+b.low[j]); j = (j==m-1)?0:(j+1); } } VC<DP> dp; void readData(){ scanf("%d",&n); x.resize(n); REP(i,n) scanf("%d",&(x[i])); scanf("%d",&m); char p[N+1]; scanf("%s",p); pattern.resize(m); REP(i,m) pattern[i] = (p[i] == 'W')?1:(-1); total = 0; REP(i,m) total += pattern[i]; } int mod[N]; int check(const DP &dp){ REP(i,n){ if (x[i]+dp.low[mod[i]] <= 0) return i; } return -1; } void solve(){ REP(i,n) mod[i] = i%m; dp.PB(DP()); dp[0].k = 1; REP(i,m) dp[0].sum[i] = pattern[i]; REP(i,m) dp[0].low[i] = min(pattern[i],0); while(1){ if (check(dp.back()) >= 0){ if (SIZE(dp) > 1){ DP right; right.sw(dp.back()); dp.pop_back(); DP left; left.sw(dp.back()); dp.pop_back(); DP mid; while (!dp.empty()){ add(left,dp.back(),mid); if (check(mid) >= 0){ right.sw(mid); }else left.sw(mid); dp.pop_back(); } dp.PB(right); } cout << ((LL)n)*(dp.back().k-1) + check(dp.back())+1 << endl; return; } if (dp.back().k >= m && total >= 0){ cout << "-1" << endl; return; } dp.PB(DP()); add(dp[SIZE(dp)-2],dp[SIZE(dp)-2],dp.back()); } } int main(int argc, char *argv[]){ readData(); solve(); return 0; } |