import java.io.BufferedInputStream; import java.io.BufferedOutputStream; import java.io.InputStream; import java.io.OutputStream; import java.util.ArrayList; import java.util.List; public class haz { static int n, m, cc, cl; static int[] o, r; static class Cycle { int[] x; ArrayList<Integer>[] v; int min; public Cycle(int s) { x = new int[cl + 1]; x[0] = 0; for (int i = 1; i <= cl; i++) { x[i] = x[i - 1] + r[s]; s = (s + n) % m; } v = new ArrayList[cl + 1]; min = 0; for (int i = 1; i <= cl; i++) { if (x[i] < 0) { if (v[-x[i]] == null) v[-x[i]] = new ArrayList<Integer>(); v[-x[i]].add(i); } if (x[i] < min) min = x[i]; } } public int find(int money, int s) { if (money > cl) return -1; ArrayList<Integer> a = v[money]; if (a != null) { for (int i = 0; i < a.size(); i++) { if (a.get(i) > s) return a.get(i); } } return -1; } public String toString() { String s = ""; for (int i = 0; i <= cl; i++) { s += x[i] + " "; } for (int i = -cl; i < 0; i++) { s += "\n " + i + " - " + v[-i]; } return s; } } public static void main(String[] args) { n = R.i(); o = new int[n]; for (int i = 0; i < n; i++) { o[i] = R.i(); } m = R.i(); r = new int[m]; for (int i = 0; i < m; i++) { r[i] = R.c() == 'W' ? 1 : -1; } cc = gcd(n, m); cl = m / cc; Cycle[] cycles = new Cycle[cc]; for (int i = 0; i < cc; i++) { cycles[i] = new Cycle(i); //W.sn("" + i + ": " + cycles[i]); } int[] cs = new int[cl]; int y = 0; for (int i = 0; i < m; i++) { cs[y] = i; y = (y + n) % m; } Cycle c; int s; int money; int k, j; long result; long bestResult = Long.MAX_VALUE; for (int i = 0; i < n; i++) { money = o[i]; c = cycles[i % cc]; s = cs[(i / cc) % cl]; k = c.find(money - c.x[s], s); if (k > 0) { result = (long) n * (long) (k - s - 1) + i + 1; } else if (c.x[cl] < 0) { // konczymy cykl money = money - c.x[s] + c.x[cl]; result = (long) n * (long) (cl - s); // j razy pelny cykl j = (money + c.min) / (-c.x[cl]); if ((money + c.min) % (-c.x[cl]) > 0) j+= 1; result += (long) n * (long) cl * (long) j; money += j * c.x[cl]; k = c.find(money, 0); result += (long) n * (long) (k - 1) + i + 1; } else { result = Long.MAX_VALUE; } if (result < bestResult) bestResult = result; } if (bestResult < Long.MAX_VALUE) { W.ln(bestResult); } else { W.sn("-1"); } W.flush(); } public static int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } static class R { static InputStream is=new BufferedInputStream(System.in); static int b='\n'; static void next(){try{b=is.read();}catch(Exception e){}} static void skip(){while(b=='\n'||b==' '||b=='\r'||b=='\t')next();} static char c(){skip();char c=(char)b;next();return c;} static int i(){skip();int i=0;while(b>='0'&&b<='9'){i=10*i+(b-'0');next();}return i;} static long l(){skip();long i=0;while(b>='0'&&b<='9'){i=10*i+(b-'0');next();}return i;} } static class W { static OutputStream os=new BufferedOutputStream(System.out,4096); static void b(int b){try{os.write(b);}catch(Exception e){}} static void c(char c){b(c);} static void cs(char c){c(c);space();} static void cn(char c){c(c);newLine();} static void i(int i){if(i>9)i(i/10);b('0'+(i%10));} static void is(int i){i(i);space();} static void in(int i){i(i);newLine();} static void l(long l){if(l>9)l(l/10);b('0'+(int)(l%10));} static void ls(long l){l(l);space();} static void ln(long l){l(l);newLine();} static void s(String s){try{os.write(s.getBytes());}catch(Exception e){}} static void ss(String s){s(s);space();} static void sn(String s){s(s);newLine();} static void tn(boolean b){sn(b?"TAK":"NIE");} static void space(){b(' ');} static void newLine(){b('\n');} static void flush(){try{os.flush();}catch(Exception e){}}; } static class T { static List<String> s=new ArrayList<String>(); static List<Long> t=new ArrayList<Long>(); static void t(String n){s.add(n);t.add(System.currentTimeMillis());} static void err(){t.add(System.currentTimeMillis());System.err.println();for(int i=0;i<s.size();i++){System.err.println(s.get(i)+": "+(t.get(i+1)-t.get(i)));}System.err.println("TOTAL: "+(t.get(t.size() - 1)-t.get(0)));System.err.flush();} } }
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 | import java.io.BufferedInputStream; import java.io.BufferedOutputStream; import java.io.InputStream; import java.io.OutputStream; import java.util.ArrayList; import java.util.List; public class haz { static int n, m, cc, cl; static int[] o, r; static class Cycle { int[] x; ArrayList<Integer>[] v; int min; public Cycle(int s) { x = new int[cl + 1]; x[0] = 0; for (int i = 1; i <= cl; i++) { x[i] = x[i - 1] + r[s]; s = (s + n) % m; } v = new ArrayList[cl + 1]; min = 0; for (int i = 1; i <= cl; i++) { if (x[i] < 0) { if (v[-x[i]] == null) v[-x[i]] = new ArrayList<Integer>(); v[-x[i]].add(i); } if (x[i] < min) min = x[i]; } } public int find(int money, int s) { if (money > cl) return -1; ArrayList<Integer> a = v[money]; if (a != null) { for (int i = 0; i < a.size(); i++) { if (a.get(i) > s) return a.get(i); } } return -1; } public String toString() { String s = ""; for (int i = 0; i <= cl; i++) { s += x[i] + " "; } for (int i = -cl; i < 0; i++) { s += "\n " + i + " - " + v[-i]; } return s; } } public static void main(String[] args) { n = R.i(); o = new int[n]; for (int i = 0; i < n; i++) { o[i] = R.i(); } m = R.i(); r = new int[m]; for (int i = 0; i < m; i++) { r[i] = R.c() == 'W' ? 1 : -1; } cc = gcd(n, m); cl = m / cc; Cycle[] cycles = new Cycle[cc]; for (int i = 0; i < cc; i++) { cycles[i] = new Cycle(i); //W.sn("" + i + ": " + cycles[i]); } int[] cs = new int[cl]; int y = 0; for (int i = 0; i < m; i++) { cs[y] = i; y = (y + n) % m; } Cycle c; int s; int money; int k, j; long result; long bestResult = Long.MAX_VALUE; for (int i = 0; i < n; i++) { money = o[i]; c = cycles[i % cc]; s = cs[(i / cc) % cl]; k = c.find(money - c.x[s], s); if (k > 0) { result = (long) n * (long) (k - s - 1) + i + 1; } else if (c.x[cl] < 0) { // konczymy cykl money = money - c.x[s] + c.x[cl]; result = (long) n * (long) (cl - s); // j razy pelny cykl j = (money + c.min) / (-c.x[cl]); if ((money + c.min) % (-c.x[cl]) > 0) j+= 1; result += (long) n * (long) cl * (long) j; money += j * c.x[cl]; k = c.find(money, 0); result += (long) n * (long) (k - 1) + i + 1; } else { result = Long.MAX_VALUE; } if (result < bestResult) bestResult = result; } if (bestResult < Long.MAX_VALUE) { W.ln(bestResult); } else { W.sn("-1"); } W.flush(); } public static int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } static class R { static InputStream is=new BufferedInputStream(System.in); static int b='\n'; static void next(){try{b=is.read();}catch(Exception e){}} static void skip(){while(b=='\n'||b==' '||b=='\r'||b=='\t')next();} static char c(){skip();char c=(char)b;next();return c;} static int i(){skip();int i=0;while(b>='0'&&b<='9'){i=10*i+(b-'0');next();}return i;} static long l(){skip();long i=0;while(b>='0'&&b<='9'){i=10*i+(b-'0');next();}return i;} } static class W { static OutputStream os=new BufferedOutputStream(System.out,4096); static void b(int b){try{os.write(b);}catch(Exception e){}} static void c(char c){b(c);} static void cs(char c){c(c);space();} static void cn(char c){c(c);newLine();} static void i(int i){if(i>9)i(i/10);b('0'+(i%10));} static void is(int i){i(i);space();} static void in(int i){i(i);newLine();} static void l(long l){if(l>9)l(l/10);b('0'+(int)(l%10));} static void ls(long l){l(l);space();} static void ln(long l){l(l);newLine();} static void s(String s){try{os.write(s.getBytes());}catch(Exception e){}} static void ss(String s){s(s);space();} static void sn(String s){s(s);newLine();} static void tn(boolean b){sn(b?"TAK":"NIE");} static void space(){b(' ');} static void newLine(){b('\n');} static void flush(){try{os.flush();}catch(Exception e){}}; } static class T { static List<String> s=new ArrayList<String>(); static List<Long> t=new ArrayList<Long>(); static void t(String n){s.add(n);t.add(System.currentTimeMillis());} static void err(){t.add(System.currentTimeMillis());System.err.println();for(int i=0;i<s.size();i++){System.err.println(s.get(i)+": "+(t.get(i+1)-t.get(i)));}System.err.println("TOTAL: "+(t.get(t.size() - 1)-t.get(0)));System.err.flush();} } } |