結果

問題 No.3134 二分探索木
ユーザー tenten
提出日時 2025-05-12 14:20:32
言語 Java
(openjdk 23)
結果
TLE  
実行時間 -
コード長 4,159 bytes
コンパイル時間 3,155 ms
コンパイル使用メモリ 87,860 KB
実行使用メモリ 69,216 KB
最終ジャッジ日時 2025-05-12 14:20:43
合計ジャッジ時間 9,849 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 5
other AC * 8 TLE * 1 -- * 6
権限があれば一括ダウンロードができます

ソースコード

diff # 

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();
        Node[] nodes = new Node[n];
        nodes[0] = new Node(sc.nextInt());
        Node base = nodes[0];
        for (int i = 1; i < n; i++) {
            nodes[i] = new Node(sc.nextInt());
            Node current = base;
            while (true) {
                current.count++;
                nodes[i].depth++;
                if (current.value > nodes[i].value) {
                    if (current.left == null) {
                        current.left = nodes[i];
                        break;
                    } else {
                        current = current.left;
                    }
                } else {
                    if (current.right == null) {
                        current.right = nodes[i];
                        break;
                    } else {
                        current = current.right;
                    }
                }
            }
        }
        System.out.println(Arrays.stream(nodes).map(x -> String.valueOf(x.depth)).collect(Collectors.joining(" ")));
        System.out.println(Arrays.stream(nodes).map(x -> String.valueOf(x.count)).collect(Collectors.joining(" ")));
    }
    
    static class Node {
        int value;
        int count;
        int depth;
        Node left;
        Node right;
        
        public Node(int value) {
            this.value = value;
        }
    }
}

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);
        }
    }
}
0