結果
問題 | No.2074 Product is Square ? |
ユーザー | tenten |
提出日時 | 2023-06-30 17:48:42 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 659 ms / 2,000 ms |
コード長 | 3,148 bytes |
コンパイル時間 | 4,666 ms |
コンパイル使用メモリ | 82,968 KB |
実行使用メモリ | 61,240 KB |
最終ジャッジ日時 | 2023-09-21 11:21:44 |
合計ジャッジ時間 | 13,195 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
47,856 KB |
testcase_01 | AC | 86 ms
51,804 KB |
testcase_02 | AC | 97 ms
51,692 KB |
testcase_03 | AC | 90 ms
52,592 KB |
testcase_04 | AC | 90 ms
52,280 KB |
testcase_05 | AC | 87 ms
52,344 KB |
testcase_06 | AC | 84 ms
52,304 KB |
testcase_07 | AC | 97 ms
52,528 KB |
testcase_08 | AC | 96 ms
52,080 KB |
testcase_09 | AC | 101 ms
52,544 KB |
testcase_10 | AC | 97 ms
52,000 KB |
testcase_11 | AC | 160 ms
56,084 KB |
testcase_12 | AC | 278 ms
56,048 KB |
testcase_13 | AC | 659 ms
55,944 KB |
testcase_14 | AC | 284 ms
56,672 KB |
testcase_15 | AC | 197 ms
59,560 KB |
testcase_16 | AC | 284 ms
56,124 KB |
testcase_17 | AC | 657 ms
58,104 KB |
testcase_18 | AC | 271 ms
56,040 KB |
testcase_19 | AC | 198 ms
59,312 KB |
testcase_20 | AC | 284 ms
56,160 KB |
testcase_21 | AC | 653 ms
55,972 KB |
testcase_22 | AC | 270 ms
56,152 KB |
testcase_23 | AC | 197 ms
61,240 KB |
testcase_24 | AC | 280 ms
56,340 KB |
testcase_25 | AC | 651 ms
56,216 KB |
testcase_26 | AC | 269 ms
56,404 KB |
testcase_27 | AC | 194 ms
59,952 KB |
testcase_28 | AC | 283 ms
56,540 KB |
testcase_29 | AC | 652 ms
56,072 KB |
testcase_30 | AC | 268 ms
56,024 KB |
testcase_31 | AC | 48 ms
49,432 KB |
testcase_32 | AC | 41 ms
49,548 KB |
testcase_33 | AC | 69 ms
50,492 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int t = sc.nextInt(); StringBuilder sb = new StringBuilder(); while (t-- > 0) { ArrayDeque<Long> current = new ArrayDeque<>(); ArrayDeque<Long> next = new ArrayDeque<>(); int n = sc.nextInt(); while (n-- > 0) { long a = sc.nextLong(); while (current.size() > 0) { long x = current.poll(); long gcd = getGCD(a, x); a /= gcd; x /= gcd; if (x > 1) { next.add(x); } } if (a > 1) { next.add(a); } ArrayDeque<Long> tmp = current; current = next; next = tmp; } if (isSquare(current)) { sb.append("Yes\n"); } else { sb.append("No\n"); } } System.out.print(sb); } static boolean isSquare(ArrayDeque<Long> deq) { while (deq.size() > 0) { if (!isSquare(deq.poll())) { return false; } } return true; } static boolean isSquare(long x) { long left = 0; long right = Integer.MAX_VALUE; while (right - left > 1) { long m = (left + right) / 2; if (m * m <= x) { left = m; } else { right = m; } } return left * left == x; } static long getGCD(long x, long y) { if (y == 0) { return x; } else { return getGCD(y, x % y); } } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }