結果
| 問題 | No.515 典型LCP |
| ユーザー |
 uwi
|
| 提出日時 | 2017-05-05 22:47:36 |
| 言語 | Java (openjdk 23) |
| 結果 |
RE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,263 bytes |
| コンパイル時間 | 4,473 ms |
| コンパイル使用メモリ | 82,428 KB |
| 実行使用メモリ | 53,900 KB |
| 最終ジャッジ日時 | 2024-09-14 09:53:32 |
| 合計ジャッジ時間 | 10,930 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 13 RE * 2 |
ソースコード
package contest170505;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.Comparator;import java.util.InputMismatchException;public class D3 {InputStream is;PrintWriter out;String INPUT = "";static class Datum{String s;int id;}void solve(){int n = ni();Datum[] ds = new Datum[n];for(int i = 0;i < n;i++){ds[i] = new Datum();ds[i].s = ns();ds[i].id = i;}Arrays.sort(ds, new Comparator<Datum>() {public int compare(Datum a, Datum b) {return a.s.compareTo(b.s);}});int[] lcp = new int[n-1];for(int i = 0;i < n-1;i++){int same = 0;for(int j = 0;j < ds[i].s.length() && j < ds[i+1].s.length();j++){if(ds[i].s.charAt(j) == ds[i+1].s.charAt(j)){same++;}else{break;}}lcp[i] = same;}SegmentTreeRMQ st = new SegmentTreeRMQ(lcp);int[] iord = new int[n];for(int i = 0;i < n;i++){iord[ds[i].id] = i;}int M = ni();long x = ni(), d = ni();long ret = 0;for(int k = 1;k <= M;k++){long ik = x/(n-1)+1;long jk = x%(n-1)+1;if(ik > jk){long e = ik; ik = jk; jk = e;}else{jk++;}x = (x+d)%((long)n*(n-1));int u = iord[(int)ik-1], v = iord[(int)jk-1];if(u > v){int e = u; u = v; v = e;}ret += st.minx(u, v);}out.println(ret);}public static class SegmentTreeRMQ {public int M, H, N;public int[] st;public SegmentTreeRMQ(int n){N = n;M = Integer.highestOneBit(Math.max(N-1, 1))<<2;H = M>>>1;st = new int[M];Arrays.fill(st, 0, M, Integer.MAX_VALUE);}public SegmentTreeRMQ(int[] a){N = a.length;M = Integer.highestOneBit(Math.max(N-1, 1))<<2;H = M>>>1;st = new int[M];for(int i = 0;i < N;i++){st[H+i] = a[i];}Arrays.fill(st, H+N, M, Integer.MAX_VALUE);for(int i = H-1;i >= 1;i--)propagate(i);}public void update(int pos, int x){st[H+pos] = x;for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i);}private void propagate(int i){st[i] = Math.min(st[2*i], st[2*i+1]);}public int minx(int l, int r){int min = Integer.MAX_VALUE;if(l >= r)return min;while(l != 0){int f = l&-l;if(l+f > r)break;int v = st[(H+l)/f];if(v < min)min = v;l += f;}while(l < r){int f = r&-r;int v = st[(H+r)/f-1];if(v < min)min = v;r -= f;}return min;}public int min(int l, int r){ return l >= r ? 0 : min(l, r, 0, H, 1);}private int min(int l, int r, int cl, int cr, int cur){if(l <= cl && cr <= r){return st[cur];}else{int mid = cl+cr>>>1;int ret = Integer.MAX_VALUE;if(cl < r && l < mid){ret = Math.min(ret, min(l, r, cl, mid, 2*cur));}if(mid < r && l < cr){ret = Math.min(ret, min(l, r, mid, cr, 2*cur+1));}return ret;}}public int firstle(int l, int v) {int cur = H+l;while(true){if(st[cur] <= v){if(cur < H){cur = 2*cur;}else{return cur-H;}}else{cur++;if((cur&cur-1) == 0)return -1;if((cur&1)==0)cur>>>=1;}}}public int lastle(int l, int v) {int cur = H+l;while(true){if(st[cur] <= v){if(cur < H){cur = 2*cur+1;}else{return cur-H;}}else{if((cur&cur-1) == 0)return -1;cur--;if((cur&1)==1)cur>>>=1;}}}}void run() throws Exception{is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new PrintWriter(System.out);long s = System.currentTimeMillis();solve();out.flush();if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){// @Override// public void run() {// long s = System.currentTimeMillis();// solve();// out.flush();// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");// }// };// t.start();// t.join();}public static void main(String[] args) throws Exception { new D3().run(); }private byte[] inbuf = new byte[1024];public int lenbuf = 0, ptrbuf = 0;private int readByte(){if(lenbuf == -1)throw new InputMismatchException();if(ptrbuf >= lenbuf){ptrbuf = 0;try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }if(lenbuf <= 0)return -1;}return inbuf[ptrbuf++];}private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }private double nd() { return Double.parseDouble(ns()); }private char nc() { return (char)skip(); }private String ns(){int b = skip();StringBuilder sb = new StringBuilder();while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')sb.appendCodePoint(b);b = readByte();}return sb.toString();}private char[] ns(int n){char[] buf = new char[n];int b = skip(), p = 0;while(p < n && !(isSpaceChar(b))){buf[p++] = (char)b;b = readByte();}return n == p ? buf : Arrays.copyOf(buf, p);}private int[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private long[] nal(int n){long[] a = new long[n];for(int i = 0;i < n;i++)a[i] = nl();return a;}private char[][] nm(int n, int m) {char[][] map = new char[n][];for(int i = 0;i < n;i++)map[i] = ns(m);return map;}private int[][] nmi(int n, int m) {int[][] map = new int[n][];for(int i = 0;i < n;i++)map[i] = na(m);return map;}private int ni() { return (int)nl(); }private long nl(){long num = 0;int b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }}