結果
問題 |
No.3126 Dual Query Problem
|
ユーザー |
![]() |
提出日時 | 2025-04-30 15:23:17 |
言語 | Java (openjdk 23) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,587 bytes |
コンパイル時間 | 2,947 ms |
コンパイル使用メモリ | 81,844 KB |
実行使用メモリ | 65,624 KB |
最終ジャッジ日時 | 2025-04-30 15:23:38 |
合計ジャッジ時間 | 18,556 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 WA * 1 |
other | AC * 20 WA * 12 |
ソースコード
import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { FastScanner sc = new FastScanner(); int n = sc.nextInt(); int q = sc.nextInt(); StringBuilder sb = new StringBuilder(); Map<Integer, Integer> current = new HashMap<>(); current.put(0, 1); int idx = 2; for (int i = 0; i < n && q >= 0; i++) { int x = sc.nextInt(); if (!current.containsKey(x)) { current.put(x, idx); sb.append("1 ").append(idx).append(" ").append(x).append("\n"); q--; } sb.append("2 ").append(current.get(x)).append("\n"); q--; } if (q < 0) { System.out.println("No"); return; } while (q-- > 0) { sb.append("1 1 1\n"); } System.out.println("Yes"); System.out.print(sb); } } class FastScanner { private DataInputStream din; private byte[] buffer; private int bufferPointer, bytesRead; private static final int BUFFER_SIZE = 1 << 16; // 65,536 バイト public FastScanner() { din = new DataInputStream(System.in); buffer = new byte[BUFFER_SIZE]; bufferPointer = bytesRead = 0; } private byte read() { try { if (bufferPointer == bytesRead) { bytesRead = din.read(buffer, 0, BUFFER_SIZE); if (bytesRead == -1) return -1; bufferPointer = 0; } return buffer[bufferPointer++]; } catch (IOException e) { throw new RuntimeException(e); } } public String next() { byte b = read(); // 空白文字を読み飛ばす while (isSpaceChar(b)) { b = read(); } StringBuilder sb = new StringBuilder(); while (!isSpaceChar(b)) { sb.append((char) b); b = read(); } return sb.toString(); } public int nextInt() { int ret = 0; byte c = read(); while (isSpaceChar(c)) c = read(); boolean neg = (c == '-'); if (neg) c = read(); do { ret = ret * 10 + c - '0'; c = read(); } while (!isSpaceChar(c)); return neg ? -ret : ret; } public long nextLong() { long ret = 0; byte c = read(); while (isSpaceChar(c)) c = read(); boolean neg = (c == '-'); if (neg) c = read(); do { ret = ret * 10L + c - '0'; c = read(); } while (!isSpaceChar(c)); return neg ? -ret : ret; } public double nextDouble() { double ret = 0, div = 1; byte c = read(); while (isSpaceChar(c)) c = read(); boolean neg = (c == '-'); if (neg) c = read(); do { ret = ret * 10 + c - '0'; c = read(); } while (!isSpaceChar(c) && c != '.'); if (c == '.') { while (!isSpaceChar(c = read())) { ret += (c - '0') / (div *= 10); } } return neg ? -ret : ret; } private boolean isSpaceChar(byte c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } public void close() { try { if (din != null) din.close(); } catch (IOException e) { throw new RuntimeException(e); } } }