// Karol Kosinski #include <cstdio> #include <queue> #define FR(i,a,b) for(int i=(a);i<(b);++i) #define FD(i,b,a) for(int i=(b-1);i>=(a);--i) //#define DEBUG(x...) printf(x) #define DEBUG(x...) //#define DEFR(i,a,b) FR(i,a,b) #define DEFR(i,a,b) using namespace std; typedef long long LG; const int NMX = 1000003; const int LOG = 20; struct wol { int index, val; }; bool operator < (const wol &a, const wol &b) { return a.val - b.val < 0; } int n, m, cycles, clen; int Money[NMX], S[NMX], RPS[NMX], Log2[NMX]; int Jump[NMX][LOG]; int gcd(int a, int b) { if( b == 0 ) return a; return gcd(b, a % b); } void read_data() { char str[NMX]; scanf("%d", &n); FR(i,0,n) scanf("%d", Money + i); scanf("%d%s", &m, str); cycles = gcd(n, m); clen = m / cycles; int step = n % m; FR(c,0,cycles) { int j = c, k = c; FR(i,0,clen) { S[k] = (str[j] == 'W') ? +1 : -1; j = (j + step) % m; k += cycles; } } FR(i,1,NMX) Log2[i] = Log2[i >> 1] + 1; FD(i,m,m-cycles) RPS[i] = S[i]; FD(i,m-cycles,0) RPS[i] = RPS[i + cycles] + S[i]; DEBUG("*** Log2:\n"); DEFR(i,0,33) DEBUG("%3d ", Log2[i]); DEBUG("\n*** S:\n"); DEFR(i,0,m) DEBUG("%3d ", S[i]); DEBUG("\n*** RPS:\n"); DEFR(i,0,m) DEBUG("%3d ", RPS[i]); DEBUG("\n\n"); } void connect(priority_queue<wol> &Q, int k, int s) { while( not Q.empty() and Q.top().val == s ) { Jump[Q.top().index][0] = k; Q.pop(); } } void build_branches() { priority_queue<wol> QW, QL; FR(c,0,cycles) { int sum = 0, k = c; FR(i,0,clen) { sum += S[k]; if(S[k] == -1) { QL.push((wol){ k, sum }); connect(QL, k, sum + 1); connect(QW, k, sum + 2); } else { QW.push((wol){ k, sum }); } k += cycles; } while( not QW.empty() ) { //Jump[QW.top().index][0] = -1; QW.pop(); } while( not QL.empty() ) { //Jump[QL.top().index][0] = -1; QL.pop(); } } DEFR(i,0,m) DEBUG("%3d ", i); DEBUG("\n*** Jump[.][0]:\n"); DEFR(i,0,m) DEBUG("%3d ", Jump[i][0]); DEBUG("\n"); } void compress_branches() { int logm = Log2[m]; FR(j,1,logm) { DEBUG("*** Jump[.][%d]:\n", j); FR(i,0,m) { int x = Jump[i][j - 1]; if( x == 0 ) Jump[i][j] = 0; else Jump[i][j] = Jump[x][j - 1]; DEBUG("%3d ", Jump[i][j]); } DEBUG("\n"); } DEBUG("\n"); } LG play_a_game(LG mon, int ind) { int i = ind; DEBUG("--------------> mon: %lld i: %d\n", mon, i); while( mon > 0 /*and i != 0*/ ) { int j = Log2[mon] - 1; i = Jump[i][j]; if( i == 0 ) break; mon -= (1 << j); DEBUG("--------------> mon: %lld i: %d\n", mon, i); } if( i == 0 ) return clen - ind / cycles; else return i / cycles - ind / cycles + 1; } LG query(int ind) { int i = ind % m; LG sum = 0LL, val, mon = Money[ind]; if( S[i] == -1 ) { //--mon; //DEBUG(" +0+> mon: %lld\n", mon); //++sum; //DEBUG(" -0-> sum: %lld\n", sum); if( mon == 1LL ) return 1LL; } val = play_a_game(mon, i); DEBUG(" -1---> val: %lld\n", val); sum += val; DEBUG(" -1-> sum: %lld\n", sum); if( val < clen - i / cycles ) return sum; mon += RPS[i]; DEBUG(" +1+> mon: %lld\n", mon); int cstart = i % cycles; val = play_a_game(mon, cstart); DEBUG(" -2---> val: %lld\n", val); sum += val; DEBUG(" -2-> sum: %lld\n", sum); if( val < clen ) return sum; if( RPS[cstart] >= 0 ) return -1; mon += RPS[cstart]; DEBUG(" +2+> mon: %lld\n", mon); LG k = -mon / RPS[cstart]; sum += val * k; DEBUG(" -3-> sum: %lld\n", sum); mon += k * RPS[cstart]; DEBUG(" +3+> mon: %lld\n", mon); if( mon == 0 ) { sum -= val; mon -= RPS[cstart]; DEBUG(" +4+> mon: %lld\n", mon); DEBUG(" -4-> sum: %lld\n", sum); } val = play_a_game(mon, cstart); DEBUG(" -5---> val: %lld\n", val); sum += val; DEBUG(" -5-> sum: %lld\n", sum); return sum; } void process_queries() { LG worst = query(0), current; int ind = 0; DEBUG("query %3d: %13lld\n\n", 0, worst); FR(i,1,n) { current = query(i); DEBUG("query %3d: %13lld\n\n", i, current); if( current != -1 and (current < worst or worst == -1) ) { worst = current; ind = i; } } if( worst == -1 ) printf("-1\n"); else printf("%lld\n", (worst - 1) * n + ind + 1); } int main() { read_data(); build_branches(); compress_branches(); process_queries(); 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 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 | // Karol Kosinski #include <cstdio> #include <queue> #define FR(i,a,b) for(int i=(a);i<(b);++i) #define FD(i,b,a) for(int i=(b-1);i>=(a);--i) //#define DEBUG(x...) printf(x) #define DEBUG(x...) //#define DEFR(i,a,b) FR(i,a,b) #define DEFR(i,a,b) using namespace std; typedef long long LG; const int NMX = 1000003; const int LOG = 20; struct wol { int index, val; }; bool operator < (const wol &a, const wol &b) { return a.val - b.val < 0; } int n, m, cycles, clen; int Money[NMX], S[NMX], RPS[NMX], Log2[NMX]; int Jump[NMX][LOG]; int gcd(int a, int b) { if( b == 0 ) return a; return gcd(b, a % b); } void read_data() { char str[NMX]; scanf("%d", &n); FR(i,0,n) scanf("%d", Money + i); scanf("%d%s", &m, str); cycles = gcd(n, m); clen = m / cycles; int step = n % m; FR(c,0,cycles) { int j = c, k = c; FR(i,0,clen) { S[k] = (str[j] == 'W') ? +1 : -1; j = (j + step) % m; k += cycles; } } FR(i,1,NMX) Log2[i] = Log2[i >> 1] + 1; FD(i,m,m-cycles) RPS[i] = S[i]; FD(i,m-cycles,0) RPS[i] = RPS[i + cycles] + S[i]; DEBUG("*** Log2:\n"); DEFR(i,0,33) DEBUG("%3d ", Log2[i]); DEBUG("\n*** S:\n"); DEFR(i,0,m) DEBUG("%3d ", S[i]); DEBUG("\n*** RPS:\n"); DEFR(i,0,m) DEBUG("%3d ", RPS[i]); DEBUG("\n\n"); } void connect(priority_queue<wol> &Q, int k, int s) { while( not Q.empty() and Q.top().val == s ) { Jump[Q.top().index][0] = k; Q.pop(); } } void build_branches() { priority_queue<wol> QW, QL; FR(c,0,cycles) { int sum = 0, k = c; FR(i,0,clen) { sum += S[k]; if(S[k] == -1) { QL.push((wol){ k, sum }); connect(QL, k, sum + 1); connect(QW, k, sum + 2); } else { QW.push((wol){ k, sum }); } k += cycles; } while( not QW.empty() ) { //Jump[QW.top().index][0] = -1; QW.pop(); } while( not QL.empty() ) { //Jump[QL.top().index][0] = -1; QL.pop(); } } DEFR(i,0,m) DEBUG("%3d ", i); DEBUG("\n*** Jump[.][0]:\n"); DEFR(i,0,m) DEBUG("%3d ", Jump[i][0]); DEBUG("\n"); } void compress_branches() { int logm = Log2[m]; FR(j,1,logm) { DEBUG("*** Jump[.][%d]:\n", j); FR(i,0,m) { int x = Jump[i][j - 1]; if( x == 0 ) Jump[i][j] = 0; else Jump[i][j] = Jump[x][j - 1]; DEBUG("%3d ", Jump[i][j]); } DEBUG("\n"); } DEBUG("\n"); } LG play_a_game(LG mon, int ind) { int i = ind; DEBUG("--------------> mon: %lld i: %d\n", mon, i); while( mon > 0 /*and i != 0*/ ) { int j = Log2[mon] - 1; i = Jump[i][j]; if( i == 0 ) break; mon -= (1 << j); DEBUG("--------------> mon: %lld i: %d\n", mon, i); } if( i == 0 ) return clen - ind / cycles; else return i / cycles - ind / cycles + 1; } LG query(int ind) { int i = ind % m; LG sum = 0LL, val, mon = Money[ind]; if( S[i] == -1 ) { //--mon; //DEBUG(" +0+> mon: %lld\n", mon); //++sum; //DEBUG(" -0-> sum: %lld\n", sum); if( mon == 1LL ) return 1LL; } val = play_a_game(mon, i); DEBUG(" -1---> val: %lld\n", val); sum += val; DEBUG(" -1-> sum: %lld\n", sum); if( val < clen - i / cycles ) return sum; mon += RPS[i]; DEBUG(" +1+> mon: %lld\n", mon); int cstart = i % cycles; val = play_a_game(mon, cstart); DEBUG(" -2---> val: %lld\n", val); sum += val; DEBUG(" -2-> sum: %lld\n", sum); if( val < clen ) return sum; if( RPS[cstart] >= 0 ) return -1; mon += RPS[cstart]; DEBUG(" +2+> mon: %lld\n", mon); LG k = -mon / RPS[cstart]; sum += val * k; DEBUG(" -3-> sum: %lld\n", sum); mon += k * RPS[cstart]; DEBUG(" +3+> mon: %lld\n", mon); if( mon == 0 ) { sum -= val; mon -= RPS[cstart]; DEBUG(" +4+> mon: %lld\n", mon); DEBUG(" -4-> sum: %lld\n", sum); } val = play_a_game(mon, cstart); DEBUG(" -5---> val: %lld\n", val); sum += val; DEBUG(" -5-> sum: %lld\n", sum); return sum; } void process_queries() { LG worst = query(0), current; int ind = 0; DEBUG("query %3d: %13lld\n\n", 0, worst); FR(i,1,n) { current = query(i); DEBUG("query %3d: %13lld\n\n", i, current); if( current != -1 and (current < worst or worst == -1) ) { worst = current; ind = i; } } if( worst == -1 ) printf("-1\n"); else printf("%lld\n", (worst - 1) * n + ind + 1); } int main() { read_data(); build_branches(); compress_branches(); process_queries(); return 0; } |