結果
問題 | No.1896 Arrays and XOR Procedure 2 |
ユーザー | tenten |
提出日時 | 2023-02-06 18:33:01 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 129 ms / 2,000 ms |
コード長 | 3,212 bytes |
コンパイル時間 | 2,959 ms |
コンパイル使用メモリ | 94,288 KB |
実行使用メモリ | 40,832 KB |
最終ジャッジ日時 | 2024-07-04 21:49:53 |
合計ジャッジ時間 | 10,357 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
37,048 KB |
testcase_01 | AC | 54 ms
37,048 KB |
testcase_02 | AC | 53 ms
37,116 KB |
testcase_03 | AC | 106 ms
39,484 KB |
testcase_04 | AC | 129 ms
40,468 KB |
testcase_05 | AC | 117 ms
40,832 KB |
testcase_06 | AC | 110 ms
40,100 KB |
testcase_07 | AC | 117 ms
40,348 KB |
testcase_08 | AC | 125 ms
39,928 KB |
testcase_09 | AC | 124 ms
40,096 KB |
testcase_10 | AC | 119 ms
40,280 KB |
testcase_11 | AC | 125 ms
39,952 KB |
testcase_12 | AC | 123 ms
39,900 KB |
testcase_13 | AC | 121 ms
40,060 KB |
testcase_14 | AC | 121 ms
39,692 KB |
testcase_15 | AC | 119 ms
39,900 KB |
testcase_16 | AC | 117 ms
40,004 KB |
testcase_17 | AC | 118 ms
39,960 KB |
testcase_18 | AC | 106 ms
39,508 KB |
testcase_19 | AC | 83 ms
38,824 KB |
testcase_20 | AC | 117 ms
39,956 KB |
testcase_21 | AC | 90 ms
38,664 KB |
testcase_22 | AC | 122 ms
40,072 KB |
testcase_23 | AC | 123 ms
40,268 KB |
testcase_24 | AC | 111 ms
40,288 KB |
testcase_25 | AC | 118 ms
40,308 KB |
testcase_26 | AC | 124 ms
40,208 KB |
testcase_27 | AC | 124 ms
39,892 KB |
testcase_28 | AC | 117 ms
39,844 KB |
testcase_29 | AC | 120 ms
40,012 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 n = sc.nextInt(); int[] valuesA = new int[n]; int[] countsA = new int[n]; int max = 0; int idx = 0; for (int i = 0; i < n; i++) { valuesA[i] = sc.nextInt(); countsA[i] = getCount(valuesA[i]); if (max < countsA[i]) { max = countsA[i]; idx = i; } } ArrayList<Action> ans = new ArrayList<>(); int target = -1; for (int i = 0; i < n; i++) { int x = sc.nextInt(); int y = getCount(x); if (y == max) { target = i; } else if (y < max) { target = i; ans.add(new Action(2, idx, i)); } } if (target >= 0) { for (int i = 0; i < n; i++) { if (countsA[i] == max) { ans.add(new Action(1, i, target)); } } } System.out.println(ans.size()); StringBuilder sb = new StringBuilder(); for (Action x : ans) { sb.append(x).append("\n"); } System.out.print(sb); } static int getCount(int x) { int count = 0; while (x > 0) { count++; x >>= 1; } return count; } static class Action { int type; int left; int right; public Action(int type, int left, int right) { this.type = type; this.left = left; this.right = right; } public String toString() { StringBuilder sb = new StringBuilder(); return sb.append(type).append(" ").append(left + 1).append(" ").append(right + 1).toString(); } } } 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(); } }