#1165834 (Java) No.3503 Brackets Stack Query 2

• 問題: No.3503 Brackets Stack Query 2
• ユーザー: tenten
• 提出日時: 2026-05-21 17:51:24
• 言語: Java (openjdk 25.0.2)
• 結果: RE
• 実行時間: -
• コード長: 4,376 bytes
• コンパイル時間: 1,929 ms
• コンパイル使用メモリ: 84,972 KB
• 実行使用メモリ: 80,496 KB
• 最終ジャッジ日時: 2026-05-21 17:51:35
• 合計ジャッジ時間: 9,402 ms
• ジャッジサーバーID （参考情報）: judge3_1 / judge1_1

ファイルパターン	結果
sample	AC * 1
other	AC * 6 RE * 24

ソースコード

import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;
import java.math.*;

public class Main {
    public static void main(String[] args) throws Exception {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        Deque<Character> stack = new ArrayDeque<>();
        Deque<Boolean> isAdd = new ArrayDeque<>();
        StringBuilder sb = new StringBuilder();
        while (n-- > 0) {
            if (sc.nextInt() == 1) {
                char c = sc.next().charAt(0);
                if (c == '(' || c == '|') {
                    stack.push(c);
                    isAdd.push(true);
                } else {
                    if (stack.size() >= 2) {
                        char c2 = stack.pop();
                        char c1 = stack.pop();
                        if (c1 == '(' && c2 == '|') {
                            isAdd.pop();
                            isAdd.pop();
                            isAdd.push(false);
                        } else {
                            stack.push(c1);
                            stack.push(c2);
                            stack.push(c);
                            isAdd.push(true);
                        }
                    } else {
                        stack.push(c);
                        isAdd.push(true);
                    }
                }
            } else {
                boolean past = isAdd.pop();
                if (past) {
                    stack.pop();
                } else {
                    isAdd.push(true);
                    isAdd.push(true);
                    stack.push('(');
                    stack.push('|');
                }
            }
            sb.append(stack.size() == 0 ? "Yes\n" : "No\n");
        }
        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);
        }
    }
}