#include <cstdio> #include <vector> #include <algorithm> using namespace std; typedef unsigned int u32; typedef unsigned long long u64; typedef signed long long i64; #define min(a,b) (((a)<(b))?(a):(b)) #define fprintf(...) unsigned n, m; unsigned B[1000000]; char C[1000000]; u64 NWW(u64 a, u64 b) { u64 ab = a*b; while(a != b) if(a>b) a-=b; else b-=a; return (ab/b); } int main() { u32 i; char c; bool found = false; u64 found_min = 0; scanf("%u", &n); for(i=0; i<n ;++i) { scanf("%u", &B[i]); } scanf("%u\n", &m); fprintf(stderr,"read m = %u\n", m); if(n==m) { unsigned minimum = 1e8; unsigned minimum_idx=0; for(i=0; i<n ;++i) { scanf("%c", &C[i]); if((C[i]=='P') and (B[i]<minimum)) { minimum = B[i]; minimum_idx=i; } } fprintf(stderr,"minimum %u minimum_idx %u\n", minimum, minimum_idx); if(1e8==minimum) printf("-1\n"); else printf("%llu\n", (minimum-1LLU)*n+minimum_idx+1LLU); } else if(n > m) { for(i=0; i<m ;++i) { scanf("%c", &c); C[i]=('W'==c)?1:-1; fprintf(stderr,"Wczytalem c=%c C[%u]=%d\n", c, i, C[i]); } const u32 steps = NWW(n,m)/m - 1; fprintf(stderr,"NWW = %llu, steps = %u\n", NWW(n,m), steps); for(u32 u=0; u<n ;++u) { fprintf(stderr,"\tuser[%u] B=%u\n", u, B[u]); bool doNextIf = true; int balance = 0; int balance_min = 0; for(u32 s=0; s<steps ;++s) { balance += C[(s*n)%m]; if(balance < balance_min) balance_min = balance; fprintf(stderr,"\t\tbalance=%d C[%u]=%d\n", balance, (s*n)%m, C[(s*n)%m]); if(((int)B[u]+balance)==0) { if(found) { fprintf(stderr,"\t\t\t[found=true] found_min=%llu\n", (u64)s*n+u+1); found_min = min(found_min, (u64)s*n+u+1); } else { fprintf(stderr,"\t\t\t[found=false] found_min=%llu\n", (u64)s*n+u+1); found_min = (u64)s*n+u+1; found = true; } doNextIf = false; } } if(doNextIf and (balance < 0)) { u32 fullCycles = ((int)B[u]+balance_min) / (-1*balance); B[u] += fullCycles * balance; u64 moves = (u64)fullCycles * n * steps; fprintf(stderr,"\t\tNEGATIVE balance = %d fullCycles %u moves %llu B[]=%u\n", balance, fullCycles, moves, B[u]); for(u32 s=0; i<4*steps ;++s) { balance += C[(s*n)%m]; if(((int)B[u]+balance)==0) { if(found) { fprintf(stderr,"\t\t\t[#2 found=true] found_min=%llu\n", moves+(u64)s*n+u+1); found_min = min(found_min, moves+(u64)s*n+u+1); } else { fprintf(stderr,"\t\t\t[#2 found=false] found_min=%llu\n", moves+(u64)s*n+u+1); found_min = moves+(u64)s*n+u+1; found = true; } break; } } } } if(found) printf("%llu\n", found_min); else printf("-1\n"); } else // (n < m) { for(i=0; i<m ;++i) { scanf("%c", &c); C[i]=('W'==c)?1:-1; fprintf(stderr,"Wczytalem c=%c C[%u]=%d\n", c, i, C[i]); } const u32 steps = NWW(n,m)/n; fprintf(stderr,"NWW = %llu, steps = %u\n", NWW(n,m), steps); for(u32 u=0; u<n ;++u) { fprintf(stderr,"\tuser[%u] B=%u\n", u, B[u]); bool doNextIf = true; int balance = 0; int balance_min = 0; for(u32 s=0; s<steps ;++s) { balance += C[(s*n)%m]; if(balance < balance_min) balance_min = balance; fprintf(stderr,"\t\tbalance=%d C[%u]=%d\n", balance, (s*n)%m, C[(s*n)%m]); if(((int)B[u]+balance)==0) { if(found) { fprintf(stderr,"\t\t\t[found=true] found_min=%llu\n", (u64)s*n+u+1); found_min = min(found_min, (u64)s*n+u+1); } else { fprintf(stderr,"\t\t\t[found=false] found_min=%llu\n", (u64)s*n+u+1); found_min = (u64)s*n+u+1; found = true; } doNextIf = false; } } if(doNextIf and (balance < 0)) { u32 fullCycles = ((int)B[u]+balance_min) / (-1*balance); B[u] += fullCycles * balance; u64 moves = (u64)fullCycles * n * steps; fprintf(stderr,"\t\tNEGATIVE balance = %d fullCycles %u moves %llu B[]=%u\n", balance, fullCycles, moves, B[u]); for(u32 s=0; i<4*steps ;++s) { balance += C[(s*n)%m]; if(((int)B[u]+balance)==0) { if(found) { fprintf(stderr,"\t\t\t[#2 found=true] found_min=%llu\n", moves+(u64)s*n+u+1); found_min = min(found_min, moves+(u64)s*n+u+1); } else { fprintf(stderr,"\t\t\t[#2 found=false] found_min=%llu\n", moves+(u64)s*n+u+1); found_min = moves+(u64)s*n+u+1; found = true; } break; } } } } if(found) printf("%llu\n", found_min); else printf("-1\n"); } 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 | #include <cstdio> #include <vector> #include <algorithm> using namespace std; typedef unsigned int u32; typedef unsigned long long u64; typedef signed long long i64; #define min(a,b) (((a)<(b))?(a):(b)) #define fprintf(...) unsigned n, m; unsigned B[1000000]; char C[1000000]; u64 NWW(u64 a, u64 b) { u64 ab = a*b; while(a != b) if(a>b) a-=b; else b-=a; return (ab/b); } int main() { u32 i; char c; bool found = false; u64 found_min = 0; scanf("%u", &n); for(i=0; i<n ;++i) { scanf("%u", &B[i]); } scanf("%u\n", &m); fprintf(stderr,"read m = %u\n", m); if(n==m) { unsigned minimum = 1e8; unsigned minimum_idx=0; for(i=0; i<n ;++i) { scanf("%c", &C[i]); if((C[i]=='P') and (B[i]<minimum)) { minimum = B[i]; minimum_idx=i; } } fprintf(stderr,"minimum %u minimum_idx %u\n", minimum, minimum_idx); if(1e8==minimum) printf("-1\n"); else printf("%llu\n", (minimum-1LLU)*n+minimum_idx+1LLU); } else if(n > m) { for(i=0; i<m ;++i) { scanf("%c", &c); C[i]=('W'==c)?1:-1; fprintf(stderr,"Wczytalem c=%c C[%u]=%d\n", c, i, C[i]); } const u32 steps = NWW(n,m)/m - 1; fprintf(stderr,"NWW = %llu, steps = %u\n", NWW(n,m), steps); for(u32 u=0; u<n ;++u) { fprintf(stderr,"\tuser[%u] B=%u\n", u, B[u]); bool doNextIf = true; int balance = 0; int balance_min = 0; for(u32 s=0; s<steps ;++s) { balance += C[(s*n)%m]; if(balance < balance_min) balance_min = balance; fprintf(stderr,"\t\tbalance=%d C[%u]=%d\n", balance, (s*n)%m, C[(s*n)%m]); if(((int)B[u]+balance)==0) { if(found) { fprintf(stderr,"\t\t\t[found=true] found_min=%llu\n", (u64)s*n+u+1); found_min = min(found_min, (u64)s*n+u+1); } else { fprintf(stderr,"\t\t\t[found=false] found_min=%llu\n", (u64)s*n+u+1); found_min = (u64)s*n+u+1; found = true; } doNextIf = false; } } if(doNextIf and (balance < 0)) { u32 fullCycles = ((int)B[u]+balance_min) / (-1*balance); B[u] += fullCycles * balance; u64 moves = (u64)fullCycles * n * steps; fprintf(stderr,"\t\tNEGATIVE balance = %d fullCycles %u moves %llu B[]=%u\n", balance, fullCycles, moves, B[u]); for(u32 s=0; i<4*steps ;++s) { balance += C[(s*n)%m]; if(((int)B[u]+balance)==0) { if(found) { fprintf(stderr,"\t\t\t[#2 found=true] found_min=%llu\n", moves+(u64)s*n+u+1); found_min = min(found_min, moves+(u64)s*n+u+1); } else { fprintf(stderr,"\t\t\t[#2 found=false] found_min=%llu\n", moves+(u64)s*n+u+1); found_min = moves+(u64)s*n+u+1; found = true; } break; } } } } if(found) printf("%llu\n", found_min); else printf("-1\n"); } else // (n < m) { for(i=0; i<m ;++i) { scanf("%c", &c); C[i]=('W'==c)?1:-1; fprintf(stderr,"Wczytalem c=%c C[%u]=%d\n", c, i, C[i]); } const u32 steps = NWW(n,m)/n; fprintf(stderr,"NWW = %llu, steps = %u\n", NWW(n,m), steps); for(u32 u=0; u<n ;++u) { fprintf(stderr,"\tuser[%u] B=%u\n", u, B[u]); bool doNextIf = true; int balance = 0; int balance_min = 0; for(u32 s=0; s<steps ;++s) { balance += C[(s*n)%m]; if(balance < balance_min) balance_min = balance; fprintf(stderr,"\t\tbalance=%d C[%u]=%d\n", balance, (s*n)%m, C[(s*n)%m]); if(((int)B[u]+balance)==0) { if(found) { fprintf(stderr,"\t\t\t[found=true] found_min=%llu\n", (u64)s*n+u+1); found_min = min(found_min, (u64)s*n+u+1); } else { fprintf(stderr,"\t\t\t[found=false] found_min=%llu\n", (u64)s*n+u+1); found_min = (u64)s*n+u+1; found = true; } doNextIf = false; } } if(doNextIf and (balance < 0)) { u32 fullCycles = ((int)B[u]+balance_min) / (-1*balance); B[u] += fullCycles * balance; u64 moves = (u64)fullCycles * n * steps; fprintf(stderr,"\t\tNEGATIVE balance = %d fullCycles %u moves %llu B[]=%u\n", balance, fullCycles, moves, B[u]); for(u32 s=0; i<4*steps ;++s) { balance += C[(s*n)%m]; if(((int)B[u]+balance)==0) { if(found) { fprintf(stderr,"\t\t\t[#2 found=true] found_min=%llu\n", moves+(u64)s*n+u+1); found_min = min(found_min, moves+(u64)s*n+u+1); } else { fprintf(stderr,"\t\t\t[#2 found=false] found_min=%llu\n", moves+(u64)s*n+u+1); found_min = moves+(u64)s*n+u+1; found = true; } break; } } } } if(found) printf("%llu\n", found_min); else printf("-1\n"); } return 0; } |