// Author : Hanczar #include <iostream> #include <stdint.h> #include <stdio.h> using namespace std; typedef long long int lli; char readbuf[1000100]; int savings[1000001]; //4MB int cycle[1000001]; //4MB int minimums[1000001];//4MB int values[20][1000001]; //20*4MB=80MB int minims[20][1000001];//20*4BM=80MB #define DEBUG 0 int main(int argc, char *argv[]) { int n, m; int level; scanf("%d", &n); for (int i = 0; i < n; i++) { int sav; scanf("%d", &sav); savings[i] = sav; } scanf("%d\n", &m); for (int i = 0; i < m; i++) { char val; scanf("%c", &val); if (val == 'W') { values[0][i] = 1; minims[0][i] = 0; } else if (val == 'P') { values[0][i] = -1; minims[0][i] = -1; } } // build playing table int round; int pass = 1; int lastpass; int cyclelength = 0; lli minimumplays = 0x7FFFFFFFFFFFFFFFLL; int player_id = -1; int shift = ((n - m) + m) % m; if(DEBUG)printf("shift:%d\n", shift); int pos = 0; lli sum = 0; do { sum += values[0][pos]; cyclelength++; pos = (pos + shift) % m; } while (pos != 0); if(DEBUG)printf(" cycle sum:%lld\n",sum); if(DEBUG)printf("cycle length:%d\n", cyclelength); for (round = 2; round <= cyclelength; round *= 2, pass++) { for (int i = 0; i < m; i++) { int shiftedpos = (i + shift * round/2) % m; int valuetostore = values[pass - 1][i] + values[pass - 1][shiftedpos]; values[pass][i] = valuetostore; minims[pass][i] = minims[pass -1][i]; if (minims[pass][i] > values[pass - 1][i] + minims[pass-1][shiftedpos] ) { minims[pass][i] = values[pass - 1][i] + minims[pass-1][shiftedpos]; } // printf("values[%d][%d] = %d[%d] ( %d + %d ),%d round:%d\n",pass,i,valuetostore,minims[pass][i],values[pass-1][i] , values[pass-1][shiftedpos],shiftedpos,round); } } lastpass = pass -1; pass = 0; int shiftedpos = 0; for (int bit=1;bit<=cyclelength;(bit<<=1),pass++) { if (bit&cyclelength) { if(DEBUG)printf("bit checking 0x%x, pass:%d cyclelength:0x%x(%d)\n",bit,pass,cyclelength,cyclelength); if(DEBUG)printf("shiftedpos:%d\n",shiftedpos); for (int i=0;i<m;i++) { int oldcycle = cycle[i]; cycle[i] += values[pass][(i+shiftedpos)%m]; if(DEBUG)printf("cycle[i]=%d->%d values[pass][%d]%d\n",oldcycle,cycle[i],(int)((i+shiftedpos)%m),values[pass][(i+shiftedpos)%m]); if (minimums[i] > cycle[i]) { minimums[i] = cycle[i]; } } shiftedpos += shift * (1<<pass); } } for (int i=0;i<m;i++) { if(DEBUG)printf("[%d] cycle value:%d\n",i,cycle[i]); } pass = 0; for (int _i=0;_i<n;_i++) { int i=_i %m; if(DEBUG)printf(" ---------------- Player ---------------- %d savings:%d cycle:%d minimums:%d\n",i,savings[_i],cycle[i],minimums[i]); if (cycle[i]<0) { lli playedgames = 0; int gameposition = i; // for sure this one goes broke if (savings[_i] +minimums[i]>0) { int bigroundcount = (savings[_i] + minimums[i]) / (-cycle[i]); playedgames = (lli)bigroundcount * cyclelength; savings[_i] += cycle[i] * bigroundcount; if(DEBUG)printf("[b] bigrounds:%d savings:%d minimums[i]:%d cycle[i]:%d\n",bigroundcount,savings[_i],minimums[i],cycle[i]); } while(savings[_i]>0) { while (pass < lastpass && savings[_i] + minims[pass+1][gameposition]>0) { if(DEBUG)printf("increasing pass to %d\n",pass); pass++; } while (savings[_i] + minims[pass][gameposition]<=0 && pass > 0 ) { if(DEBUG)printf("decreasing pass to %d\n",pass); pass--; } savings[_i] += values[pass][gameposition]; if(DEBUG)printf("[b][%d] pos:%d(%d) pg:%lld savings[_i]=%d pass=%d values[%d][0]=%d\n",i,gameposition,values[pass][gameposition],playedgames,savings[_i],pass,gameposition,values[pass][gameposition]); gameposition = (int)((gameposition + (lli)shift * (1<<pass)) %m); playedgames += (1<<pass); if (playedgames >= minimumplays) { if(DEBUG)printf("breaking pg:%lld > mg:%lld\n",playedgames,minimumplays); break; } } if (savings[_i] == 0 && playedgames < minimumplays) { minimumplays = playedgames; if(DEBUG)printf("minimumplays:%lld\n",minimumplays); player_id = _i; } } else if (savings[_i] - minimums[i] <= 0 ) { lli playedgames = 0; int gameposition = i; do { while (pass < lastpass && savings[_i] + minims[pass+1][gameposition]>0) { if(DEBUG)printf("increasing pass to %d\n",pass); pass++; } while (savings[_i] + minims[pass][gameposition]<=0 && pass > 0 ) { if(DEBUG)printf("decreasing pass to %d\n",pass); pass--; } savings[_i] += values[pass][gameposition]; if(DEBUG)printf("[c][%d] pos:%d(%d) pg:%lld savings[_i]=%d pass=%d values[%d][0]=%d\n",i,gameposition,values[pass][gameposition],playedgames,savings[_i],pass,gameposition,values[pass][gameposition]); gameposition = (int)((gameposition + (lli)shift * (1<<pass)) %m); playedgames += (1<<pass); if (playedgames >= minimumplays) { if(DEBUG)printf("breaking pg:%lld > mg:%lld\n",playedgames,minimumplays); break; } if (savings[_i]==0) { if(DEBUG)printf("breaking savings[_i]==0\n"); break; } } while (playedgames < cyclelength); // check only one cycle if(DEBUG)printf("playedgames %lld cycle[i] :%d\n",playedgames,cyclelength); if (savings[_i] == 0 && playedgames < minimumplays) { minimumplays = playedgames; if(DEBUG)printf("minimumplays:%lld\n",minimumplays); player_id = _i; } } else { if(DEBUG)printf("player skipped - always wins\n"); } } lli allgames = -1; if (-1!=player_id) { allgames = ((lli)minimumplays * n) - (n-player_id) + 1; } if(DEBUG)printf(" minimumplays:%lld\n",minimumplays); if(DEBUG)printf(" player_id:%d\n", player_id); printf("%lld\n",allgames); 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 | // Author : Hanczar #include <iostream> #include <stdint.h> #include <stdio.h> using namespace std; typedef long long int lli; char readbuf[1000100]; int savings[1000001]; //4MB int cycle[1000001]; //4MB int minimums[1000001];//4MB int values[20][1000001]; //20*4MB=80MB int minims[20][1000001];//20*4BM=80MB #define DEBUG 0 int main(int argc, char *argv[]) { int n, m; int level; scanf("%d", &n); for (int i = 0; i < n; i++) { int sav; scanf("%d", &sav); savings[i] = sav; } scanf("%d\n", &m); for (int i = 0; i < m; i++) { char val; scanf("%c", &val); if (val == 'W') { values[0][i] = 1; minims[0][i] = 0; } else if (val == 'P') { values[0][i] = -1; minims[0][i] = -1; } } // build playing table int round; int pass = 1; int lastpass; int cyclelength = 0; lli minimumplays = 0x7FFFFFFFFFFFFFFFLL; int player_id = -1; int shift = ((n - m) + m) % m; if(DEBUG)printf("shift:%d\n", shift); int pos = 0; lli sum = 0; do { sum += values[0][pos]; cyclelength++; pos = (pos + shift) % m; } while (pos != 0); if(DEBUG)printf(" cycle sum:%lld\n",sum); if(DEBUG)printf("cycle length:%d\n", cyclelength); for (round = 2; round <= cyclelength; round *= 2, pass++) { for (int i = 0; i < m; i++) { int shiftedpos = (i + shift * round/2) % m; int valuetostore = values[pass - 1][i] + values[pass - 1][shiftedpos]; values[pass][i] = valuetostore; minims[pass][i] = minims[pass -1][i]; if (minims[pass][i] > values[pass - 1][i] + minims[pass-1][shiftedpos] ) { minims[pass][i] = values[pass - 1][i] + minims[pass-1][shiftedpos]; } // printf("values[%d][%d] = %d[%d] ( %d + %d ),%d round:%d\n",pass,i,valuetostore,minims[pass][i],values[pass-1][i] , values[pass-1][shiftedpos],shiftedpos,round); } } lastpass = pass -1; pass = 0; int shiftedpos = 0; for (int bit=1;bit<=cyclelength;(bit<<=1),pass++) { if (bit&cyclelength) { if(DEBUG)printf("bit checking 0x%x, pass:%d cyclelength:0x%x(%d)\n",bit,pass,cyclelength,cyclelength); if(DEBUG)printf("shiftedpos:%d\n",shiftedpos); for (int i=0;i<m;i++) { int oldcycle = cycle[i]; cycle[i] += values[pass][(i+shiftedpos)%m]; if(DEBUG)printf("cycle[i]=%d->%d values[pass][%d]%d\n",oldcycle,cycle[i],(int)((i+shiftedpos)%m),values[pass][(i+shiftedpos)%m]); if (minimums[i] > cycle[i]) { minimums[i] = cycle[i]; } } shiftedpos += shift * (1<<pass); } } for (int i=0;i<m;i++) { if(DEBUG)printf("[%d] cycle value:%d\n",i,cycle[i]); } pass = 0; for (int _i=0;_i<n;_i++) { int i=_i %m; if(DEBUG)printf(" ---------------- Player ---------------- %d savings:%d cycle:%d minimums:%d\n",i,savings[_i],cycle[i],minimums[i]); if (cycle[i]<0) { lli playedgames = 0; int gameposition = i; // for sure this one goes broke if (savings[_i] +minimums[i]>0) { int bigroundcount = (savings[_i] + minimums[i]) / (-cycle[i]); playedgames = (lli)bigroundcount * cyclelength; savings[_i] += cycle[i] * bigroundcount; if(DEBUG)printf("[b] bigrounds:%d savings:%d minimums[i]:%d cycle[i]:%d\n",bigroundcount,savings[_i],minimums[i],cycle[i]); } while(savings[_i]>0) { while (pass < lastpass && savings[_i] + minims[pass+1][gameposition]>0) { if(DEBUG)printf("increasing pass to %d\n",pass); pass++; } while (savings[_i] + minims[pass][gameposition]<=0 && pass > 0 ) { if(DEBUG)printf("decreasing pass to %d\n",pass); pass--; } savings[_i] += values[pass][gameposition]; if(DEBUG)printf("[b][%d] pos:%d(%d) pg:%lld savings[_i]=%d pass=%d values[%d][0]=%d\n",i,gameposition,values[pass][gameposition],playedgames,savings[_i],pass,gameposition,values[pass][gameposition]); gameposition = (int)((gameposition + (lli)shift * (1<<pass)) %m); playedgames += (1<<pass); if (playedgames >= minimumplays) { if(DEBUG)printf("breaking pg:%lld > mg:%lld\n",playedgames,minimumplays); break; } } if (savings[_i] == 0 && playedgames < minimumplays) { minimumplays = playedgames; if(DEBUG)printf("minimumplays:%lld\n",minimumplays); player_id = _i; } } else if (savings[_i] - minimums[i] <= 0 ) { lli playedgames = 0; int gameposition = i; do { while (pass < lastpass && savings[_i] + minims[pass+1][gameposition]>0) { if(DEBUG)printf("increasing pass to %d\n",pass); pass++; } while (savings[_i] + minims[pass][gameposition]<=0 && pass > 0 ) { if(DEBUG)printf("decreasing pass to %d\n",pass); pass--; } savings[_i] += values[pass][gameposition]; if(DEBUG)printf("[c][%d] pos:%d(%d) pg:%lld savings[_i]=%d pass=%d values[%d][0]=%d\n",i,gameposition,values[pass][gameposition],playedgames,savings[_i],pass,gameposition,values[pass][gameposition]); gameposition = (int)((gameposition + (lli)shift * (1<<pass)) %m); playedgames += (1<<pass); if (playedgames >= minimumplays) { if(DEBUG)printf("breaking pg:%lld > mg:%lld\n",playedgames,minimumplays); break; } if (savings[_i]==0) { if(DEBUG)printf("breaking savings[_i]==0\n"); break; } } while (playedgames < cyclelength); // check only one cycle if(DEBUG)printf("playedgames %lld cycle[i] :%d\n",playedgames,cyclelength); if (savings[_i] == 0 && playedgames < minimumplays) { minimumplays = playedgames; if(DEBUG)printf("minimumplays:%lld\n",minimumplays); player_id = _i; } } else { if(DEBUG)printf("player skipped - always wins\n"); } } lli allgames = -1; if (-1!=player_id) { allgames = ((lli)minimumplays * n) - (n-player_id) + 1; } if(DEBUG)printf(" minimumplays:%lld\n",minimumplays); if(DEBUG)printf(" player_id:%d\n", player_id); printf("%lld\n",allgames); return 0; } |