結果
問題 |
No.2449 square_permutation
|
ユーザー |
![]() |
提出日時 | 2023-09-04 10:10:02 |
言語 | Java (openjdk 23) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,471 bytes |
コンパイル時間 | 2,541 ms |
コンパイル使用メモリ | 96,384 KB |
実行使用メモリ | 80,140 KB |
最終ジャッジ日時 | 2024-06-22 09:12:20 |
合計ジャッジ時間 | 11,198 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 1 WA * 20 |
ソースコード
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 n = sc.nextInt(); TreeSet<Integer> square = new TreeSet<>(); TreeSet<Integer> sExists = new TreeSet<>(); for (int i = 1; i * i <= n; i++) { square.add(i * i); sExists.add(i * i); } int[] ans = new int[n]; for (int i = 1; i <= n; i++) { if (ans[i - 1] > 0) { continue; } if (square.contains(i)) { ans[i - 1] = sExists.pollLast(); ans[ans[i - 1] - 1] = i; } else { Integer current = square.floor(n / i); while (current != null) { if (ans[i * current - 1] == 0) { ans[i - 1] = i * current; ans[i * current - 1] = i; break; } current = square.lower(current); } } } System.out.println(String.join(" ", Arrays.stream(ans).mapToObj(String::valueOf).toArray(String[]::new))); } } 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(); } }