結果

問題 No.2220 Range Insert & Point Mex
ユーザー tenten
提出日時 2023-07-06 11:35:29
言語 Java
(openjdk 23)
結果
AC  
実行時間 914 ms / 2,000 ms
コード長 3,590 bytes
コンパイル時間 2,739 ms
コンパイル使用メモリ 96,832 KB
実行使用メモリ 75,384 KB
最終ジャッジ日時 2024-07-20 06:52:53
合計ジャッジ時間 23,739 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff # 

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[] lefts = new int[n];
        int[] rights = new int[n];
        int[] values = new int[n];
        PriorityQueue<Path> stock = new PriorityQueue<>();
        for (int i = 0; i < n; i++) {
            lefts[i] = sc.nextInt();
            rights[i] = sc.nextInt();
            values[i] = sc.nextInt();
            stock.add(new Path(i, lefts[i]));
        }
        PriorityQueue<Path> inQueue = new PriorityQueue<>();
        HashMap<Integer, Integer> counts = new HashMap<>();
        TreeSet<Integer> mex = new TreeSet<>();
        for (int i = 0; i <= n; i++) {
            mex.add(i);
        }
        int q = sc.nextInt();
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < q; i++) {
            int x = sc.nextInt();
            while (stock.size() > 0 && stock.peek().value <= x) {
                Path p = stock.poll();
                int v = values[p.idx];
                if (v > n) {
                    continue;
                }
                inQueue.add(new Path(p.idx, rights[p.idx]));
                if (mex.contains(v)) {
                    mex.remove(v);
                    counts.put(v, 1);
                } else {
                    counts.put(v, counts.get(v) + 1);
                }
            }
            while (inQueue.size() > 0 && inQueue.peek().value < x) {
                Path p = inQueue.poll();
                int v = values[p.idx];
                if (counts.get(v) == 1) {
                    counts.remove(v);
                    mex.add(v);
                } else {
                    counts.put(v, counts.get(v) - 1);
                }
            }
            sb.append(mex.first()).append("\n");
        }
        System.out.print(sb);
    }
    
    static class Path implements Comparable<Path> {
        int idx;
        int value;
        
        public Path(int idx, int value) {
            this.idx = idx;
            this.value = value;
        }
        
        public int compareTo(Path another) {
            return value - another.value;
        }
        
        public String toString() {
            return idx + ":" + value;
        }
    }
}
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();
    }
    
}
0