結果
問題 | No.2254 Reverse Only |
ユーザー | 👑 hos.lyric |
提出日時 | 2023-03-25 01:19:55 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 139 ms / 2,000 ms |
コード長 | 2,446 bytes |
コンパイル時間 | 874 ms |
コンパイル使用メモリ | 109,304 KB |
実行使用メモリ | 25,196 KB |
最終ジャッジ日時 | 2023-09-04 20:05:29 |
合計ジャッジ時間 | 5,257 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 139 ms
22,260 KB |
testcase_09 | AC | 76 ms
25,128 KB |
testcase_10 | AC | 59 ms
18,500 KB |
testcase_11 | AC | 139 ms
22,628 KB |
testcase_12 | AC | 138 ms
21,140 KB |
testcase_13 | AC | 62 ms
18,212 KB |
testcase_14 | AC | 63 ms
19,112 KB |
testcase_15 | AC | 63 ms
21,920 KB |
testcase_16 | AC | 68 ms
24,888 KB |
testcase_17 | AC | 69 ms
24,724 KB |
testcase_18 | AC | 139 ms
21,420 KB |
testcase_19 | AC | 86 ms
22,684 KB |
testcase_20 | AC | 73 ms
25,136 KB |
testcase_21 | AC | 72 ms
25,196 KB |
testcase_22 | AC | 50 ms
24,364 KB |
testcase_23 | AC | 73 ms
25,100 KB |
testcase_24 | AC | 61 ms
24,932 KB |
testcase_25 | AC | 66 ms
24,856 KB |
testcase_26 | AC | 66 ms
24,728 KB |
testcase_27 | AC | 3 ms
4,384 KB |
testcase_28 | AC | 29 ms
6,140 KB |
testcase_29 | AC | 30 ms
8,900 KB |
testcase_30 | AC | 56 ms
9,104 KB |
testcase_31 | AC | 15 ms
5,248 KB |
testcase_32 | AC | 16 ms
5,848 KB |
testcase_33 | AC | 9 ms
4,896 KB |
testcase_34 | AC | 37 ms
11,012 KB |
testcase_35 | AC | 25 ms
8,480 KB |
testcase_36 | AC | 118 ms
19,280 KB |
testcase_37 | AC | 125 ms
19,476 KB |
testcase_38 | AC | 11 ms
5,548 KB |
testcase_39 | AC | 108 ms
14,476 KB |
testcase_40 | AC | 4 ms
4,380 KB |
testcase_41 | AC | 21 ms
7,232 KB |
testcase_42 | AC | 13 ms
6,072 KB |
testcase_43 | AC | 38 ms
9,920 KB |
testcase_44 | AC | 59 ms
19,876 KB |
testcase_45 | AC | 79 ms
11,356 KB |
testcase_46 | AC | 3 ms
4,376 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } int[] suffixZ(T)(const(T[]) as) { import std.algorithm : max; const n = cast(int)(as.length); if (n == 0) return []; auto zs = new int[n]; int j; foreach (i; 1 .. n) { if (i + zs[i - j] < j + zs[j]) { zs[i] = zs[i - j]; } else { int z = max(j + zs[j] - i, 0); for (; i + z < n && as[z] == as[i + z]; ++z) {} zs[i] = z; j = i; } } zs[0] = n; return zs; } int N, K; int[] A, B; bool solve() { if (A == B) { return true; } if (K > N) { return false; } else if (K == N) { auto as = A.dup; as.reverse; if (as == B) return true; return false; } else if (K == N - 1) { auto as = A.dup; foreach (dir; 0 .. 2) { // cyclic shift? const zs = suffixZ(as ~ B ~ B); foreach (i; N .. N + N) { if (zs[i] >= N) { return true; } } as.reverse; } return false; } else { auto as = A.dup; auto bs = B.dup; as.sort; bs.sort; return (as == bs); } } void main() { try { for (; ; ) { N = readInt; K = readInt; A = new int[N]; foreach (i; 0 .. N) A[i] = readInt; B = new int[N]; foreach (i; 0 .. N) B[i] = readInt; const ans = solve; writeln(ans ? "Yes" : "No"); } } catch (EOFException e) { } }