結果

問題 No.515 典型LCP
ユーザー 37zigen37zigen
提出日時 2017-05-06 02:12:39
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,506 bytes
コンパイル時間 2,980 ms
コンパイル使用メモリ 75,512 KB
実行使用メモリ 67,588 KB
最終ジャッジ日時 2023-10-12 11:24:04
合計ジャッジ時間 8,525 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 43 ms
49,816 KB
testcase_04 AC 42 ms
49,708 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.NoSuchElementException;

class Main {
	int N, M;
	int[] X, Y;

	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		Scanner sc = new Scanner();
		long N = sc.nextLong();
		class S implements Comparable<S> {
			int idx;
			String s;

			public S(int idx, String s) {
				this.idx = idx;
				this.s = s;
			}

			public int compareTo(S o) {
				return s.compareTo(o.s);
			};
		}
		S[] s = new S[(int) N];

		Integer[] ord = new Integer[(int) N];
		for (int i = 0; i < N; ++i) {
			s[i] = new S(i, sc.next());
		}
		Arrays.sort(s);
		int[] rev = new int[(int) N];
		for (int i = 0; i < N; ++i) {
			rev[s[i].idx] = i;
		}
		int[][] t = new int[(int) (Math.log(N) / Math.log(2))][];
		t[0] = new int[(int) N];
		for (int i = 0; i + 1 < N; ++i) {
			int len = 0;
			while (len < Math.min(s[i].s.length(), s[i + 1].s.length())
					&& s[i].s.charAt(len) == s[i + 1].s.charAt(len)) {
				++len;
			}
			t[0][i] = len;
		}
		for (int i = 1; i < t.length; ++i) {
			// [j, j+(1<<i));
			int p = 0;
			while ((p + 1) + (1 << i) <= N)
				++p;
			t[i] = new int[p];
			for (int j = 0; j < t[i].length; ++j) {
				t[i][j] = Math.min(t[i - 1][j], t[i - 1][j + (1 << (i - 1))]);
			}
		}
		long M = sc.nextLong();
		long x = sc.nextLong();
		long d = sc.nextLong();
		long ans = 0;
		for (int k = 0; k < M; ++k) {
			int i = (int) (x / (N - 1)) + 1;
			int j = (int) (x % (N - 1)) + 1;
			if (i > j) {
				int tmp = i;
				i = j;
				j = tmp;
			} else {
				j = j + 1;
			}
			x = (x + d) % (N * (N - 1));
			--i;
			--j;
			if (rev[i] > rev[j]) {
				int tmp = i;
				i = j;
				j = tmp;
			}
			// [rev[i],rev[j])
			int a = 0;
			while (1 << (a + 1) <= (rev[j] - rev[j] + 1)) {
				++a;
			}
			ans += Math.min(t[a][rev[i]], t[a][rev[j] - (1 << a)]);
		}
		System.out.println(ans);

	}

	class Seg {
		int n;
		int[] v;

		public Seg(int n_) {
			n = 1;
			while (n < n_) {
				n *= 2;
			}
			v = new int[2 * n - 1];
			Arrays.fill(v, Integer.MAX_VALUE / 16);
		}

		void init() {
			for (int i = n - 2; i >= 0; --i) {
				v[i] = Math.min(v[2 * i + 1], v[2 * i + 2]);
			}
		}

		void setVal(int k, int val) {
			k += n - 1;
			v[k] = val;
			while (k > 0) {
				k = (k - 1) / 2;
				v[k] = Math.min(v[2 * k + 1], v[2 * k + 2]);
			}
		}

		int query(int a, int b) {
			return query(a, b, 0, n, 0);
		}

		int query(int a, int b, int l, int r, int k) {
			if (r <= a || b <= l) {
				return Integer.MAX_VALUE / 16;
			} else if (a <= l && r <= b) {
				return v[k];
			} else {
				int vl = query(a, b, l, (l + r) / 2, 2 * k + 1);
				int vr = query(a, b, (l + r) / 2, r, 2 * k + 2);
				return Math.min(vl, vr);
			}
		}
	}

	class Scanner {
		private final InputStream in = System.in;
		private final byte[] buffer = new byte[1024];
		private int ptr = 0;
		private int buflen = 0;

		private boolean hasNextByte() {
			if (ptr < buflen) {
				return true;
			} else {
				ptr = 0;
				try {
					buflen = in.read(buffer);
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (buflen <= 0) {
					return false;
				}
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[ptr++];
			else
				return -1;
		}

		private boolean isPrintableChar(int c) {
			return 33 <= c && c <= 126;
		}

		private void skipUnprintable() {
			while (hasNextByte() && !isPrintableChar(buffer[ptr]))
				ptr++;
		}

		public boolean hasNext() {
			skipUnprintable();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (isPrintableChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			long n = 0;
			boolean minus = false;
			int b = readByte();
			if (b == '-') {
				minus = true;
				b = readByte();
			}
			if (b < '0' || '9' < b) {
				throw new NumberFormatException();
			}
			while (true) {
				if ('0' <= b && b <= '9') {
					n *= 10;
					n += b - '0';
				} else if (b == -1 || !isPrintableChar(b)) {
					return minus ? -n : n;
				} else {
					throw new NumberFormatException();
				}
				b = readByte();
			}
		}
	}

	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}
0