結果

問題 No.2422 regisys?
ユーザー tentententen
提出日時 2023-08-17 11:45:39
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,351 ms / 2,000 ms
コード長 4,480 bytes
コンパイル時間 3,751 ms
コンパイル使用メモリ 89,676 KB
実行使用メモリ 84,492 KB
最終ジャッジ日時 2024-05-04 18:29:36
合計ジャッジ時間 34,171 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
36,840 KB
testcase_01 AC 51 ms
36,912 KB
testcase_02 AC 52 ms
37,016 KB
testcase_03 AC 50 ms
37,196 KB
testcase_04 AC 53 ms
36,872 KB
testcase_05 AC 55 ms
37,432 KB
testcase_06 AC 56 ms
37,184 KB
testcase_07 AC 51 ms
37,276 KB
testcase_08 AC 53 ms
37,292 KB
testcase_09 AC 48 ms
36,968 KB
testcase_10 AC 47 ms
36,932 KB
testcase_11 AC 49 ms
37,196 KB
testcase_12 AC 46 ms
37,340 KB
testcase_13 AC 53 ms
37,232 KB
testcase_14 AC 49 ms
37,020 KB
testcase_15 AC 52 ms
36,928 KB
testcase_16 AC 51 ms
36,904 KB
testcase_17 AC 51 ms
36,980 KB
testcase_18 AC 53 ms
37,268 KB
testcase_19 AC 58 ms
37,108 KB
testcase_20 AC 61 ms
37,572 KB
testcase_21 AC 51 ms
37,268 KB
testcase_22 AC 51 ms
37,044 KB
testcase_23 AC 55 ms
37,240 KB
testcase_24 AC 50 ms
37,184 KB
testcase_25 AC 51 ms
37,104 KB
testcase_26 AC 47 ms
36,944 KB
testcase_27 AC 49 ms
37,296 KB
testcase_28 AC 52 ms
36,768 KB
testcase_29 AC 50 ms
37,156 KB
testcase_30 AC 50 ms
37,296 KB
testcase_31 AC 657 ms
53,220 KB
testcase_32 AC 747 ms
57,248 KB
testcase_33 AC 612 ms
53,548 KB
testcase_34 AC 484 ms
50,460 KB
testcase_35 AC 738 ms
57,732 KB
testcase_36 AC 647 ms
52,124 KB
testcase_37 AC 747 ms
57,032 KB
testcase_38 AC 609 ms
53,560 KB
testcase_39 AC 522 ms
51,444 KB
testcase_40 AC 493 ms
51,648 KB
testcase_41 AC 538 ms
51,160 KB
testcase_42 AC 1,089 ms
73,336 KB
testcase_43 AC 700 ms
53,424 KB
testcase_44 AC 1,042 ms
71,516 KB
testcase_45 AC 1,168 ms
66,596 KB
testcase_46 AC 1,139 ms
70,672 KB
testcase_47 AC 810 ms
56,724 KB
testcase_48 AC 1,281 ms
83,120 KB
testcase_49 AC 878 ms
62,540 KB
testcase_50 AC 1,047 ms
76,400 KB
testcase_51 AC 1,158 ms
70,420 KB
testcase_52 AC 630 ms
55,068 KB
testcase_53 AC 1,023 ms
69,232 KB
testcase_54 AC 1,294 ms
78,332 KB
testcase_55 AC 1,030 ms
67,080 KB
testcase_56 AC 940 ms
61,356 KB
testcase_57 AC 1,346 ms
84,196 KB
testcase_58 AC 1,337 ms
84,492 KB
testcase_59 AC 1,299 ms
79,612 KB
testcase_60 AC 1,351 ms
78,616 KB
testcase_61 AC 47 ms
37,296 KB
権限があれば一括ダウンロードができます

ソースコード

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 m = sc.nextInt();
        Goods[] goods = new Goods[n];
        for (int i = 0; i < n; i++) {
            goods[i] = new Goods(i, sc.nextInt());
        }
        PriorityQueue<Goods> stock = new PriorityQueue<>();
        for (int i = 0; i < n; i++) {
            goods[i].prices[1] = sc.nextInt();
            stock.add(goods[i]);
        }
        PriorityQueue<Integer> normal = new PriorityQueue<>();
        PriorityQueue<Integer> mma = new PriorityQueue<>();
        while (m-- > 0) {
            if (sc.nextInt() == 0) {
                normal.add(sc.nextInt());
            } else {
                mma.add(sc.nextInt());
            }
        }
        TreeSet<Goods> store = new TreeSet<>();
        while (normal.size() > 0) {
            int x = normal.poll();
            while (stock.size() > 0 && stock.peek().prices[0] <= x) {
                Goods g = stock.poll();
                g.add();
                store.add(g);
            }
            if (store.size() > 0) {
                store.pollLast();
            }
        }
        while (stock.size() > 0) {
            Goods g = stock.poll();
            g.add();
            store.add(g);
        }
        while (mma.size() > 0) {
            int x = mma.poll();
            if (store.size() > 0 && store.first().prices[1] <= x) {
                store.pollFirst();
            }
        }
        System.out.println(store.size() + stock.size());
    }
    
    static class Goods implements Comparable<Goods> {
        int idx;
        int[] prices;
        int current;
        
        public Goods(int idx, int p) {
            prices = new int[2];
            this.idx = idx;
            prices[0] = p;
        }
        
        public void add() {
            current++;
        }
        
        public int hashCode() {
            return idx;
        }
        
        public int compareTo(Goods another) {
            if (prices[current] == another.prices[another.current]) {
                return idx - another.idx;
            } else {
                return prices[current] - another.prices[another.current];
            }
        }
        
        public boolean equals(Object o) {
            return hashCode() == o.hashCode();
        }
    }
}
class BinaryIndexedTree {
    int size;
    int[] tree;
    
    public BinaryIndexedTree(int size) {
        this.size = size;
        tree = new int[size];
    }
    
    public void add(int idx, int value) {
        int mask = 1;
        while (idx < size) {
            if ((idx & mask) != 0) {
                tree[idx] += value;
                idx += mask;
            }
            mask <<= 1;
        }
    }
    
    public int getSum(int from, int to) {
        return getSum(to) - getSum(from - 1);
    }
    
    public int getSum(int x) {
        int mask = 1;
        int ans = 0;
        while (x > 0) {
            if ((x & mask) != 0) {
                ans += tree[x];
                x -= mask;
            }
            mask <<= 1;
        }
        return ans;
    }
}
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