結果

問題 No.2422 regisys?
ユーザー tentententen
提出日時 2023-08-17 11:40:39
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,018 bytes
コンパイル時間 7,083 ms
コンパイル使用メモリ 91,336 KB
実行使用メモリ 94,904 KB
最終ジャッジ日時 2024-11-26 08:02:01
合計ジャッジ時間 33,425 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
50,204 KB
testcase_01 WA -
testcase_02 AC 56 ms
50,176 KB
testcase_03 WA -
testcase_04 AC 55 ms
50,492 KB
testcase_05 AC 58 ms
50,344 KB
testcase_06 AC 62 ms
50,500 KB
testcase_07 AC 57 ms
50,356 KB
testcase_08 AC 58 ms
50,576 KB
testcase_09 AC 54 ms
49,988 KB
testcase_10 AC 54 ms
50,100 KB
testcase_11 WA -
testcase_12 AC 51 ms
50,112 KB
testcase_13 WA -
testcase_14 AC 54 ms
49,992 KB
testcase_15 WA -
testcase_16 AC 55 ms
50,352 KB
testcase_17 AC 56 ms
50,552 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 56 ms
50,356 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 AC 844 ms
78,212 KB
testcase_46 AC 986 ms
79,736 KB
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 WA -
testcase_61 WA -
権限があれば一括ダウンロードができます

ソースコード

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 (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 compareTo(Goods another) {
            return prices[current] - another.prices[another.current];
        }
    }
}
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