結果

問題 No.2065 Sum of Min
ユーザー tentententen
提出日時 2023-04-27 10:17:53
言語 Java21
(openjdk 21)
結果
AC  
実行時間 907 ms / 2,000 ms
コード長 3,816 bytes
コンパイル時間 3,113 ms
コンパイル使用メモリ 96,040 KB
実行使用メモリ 65,592 KB
最終ジャッジ日時 2024-04-28 05:50:51
合計ジャッジ時間 22,500 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
37,916 KB
testcase_01 AC 67 ms
37,592 KB
testcase_02 AC 67 ms
37,668 KB
testcase_03 AC 70 ms
37,628 KB
testcase_04 AC 816 ms
58,744 KB
testcase_05 AC 833 ms
58,680 KB
testcase_06 AC 732 ms
56,592 KB
testcase_07 AC 713 ms
63,796 KB
testcase_08 AC 796 ms
64,572 KB
testcase_09 AC 907 ms
65,524 KB
testcase_10 AC 851 ms
65,480 KB
testcase_11 AC 862 ms
65,240 KB
testcase_12 AC 896 ms
65,008 KB
testcase_13 AC 865 ms
65,088 KB
testcase_14 AC 893 ms
65,224 KB
testcase_15 AC 879 ms
65,020 KB
testcase_16 AC 874 ms
64,992 KB
testcase_17 AC 875 ms
65,592 KB
testcase_18 AC 890 ms
65,040 KB
testcase_19 AC 851 ms
65,240 KB
testcase_20 AC 872 ms
65,424 KB
testcase_21 AC 839 ms
64,504 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 q = sc.nextInt();
        PriorityQueue<Path> queue = new PriorityQueue<>();
        for (int i = 1; i <= n; i++) {
            queue.add(new Path(i, sc.nextInt()));
        }
        for (int i = 0; i < q; i++) {
            queue.add(new Path(i, sc.nextInt(), sc.nextInt(), sc.nextInt()));
        }
        BinaryIndexedTree sums = new BinaryIndexedTree(n + 1);
        BinaryIndexedTree counts = new BinaryIndexedTree(n + 1);
        long[] ans = new long[q];
        while (queue.size() > 0) {
            Path x = queue.poll();
            if (x.left == 0) {
                sums.add(x.idx, x.value);
                counts.add(x.idx, 1);
            } else {
                long size = x.right - x.left + 1;
                long tmp = sums.getSum(x.left, x.right);
                tmp += (size - counts.getSum(x.left, x.right)) * x.value;
                ans[x.idx] = tmp;
            }
        }
        System.out.println(String.join("\n", Arrays.stream(ans).mapToObj(String::valueOf).toArray(String[]::new)));
    }
    
    static class Path implements Comparable<Path> {
        int idx;
        int left;
        int right;
        int value;
        
        public Path(int idx, int left, int right, int value) {
            this.idx = idx;
            this.left = left;
            this.right = right;
            this.value = value;
        }
        
        public Path(int idx, int value) {
            this(idx, 0, 0, value);
        }
        
        public int compareTo(Path another) {
            return value - another.value;
        }
    }
}

class BinaryIndexedTree {
    int size;
    long[] tree;
    
    public BinaryIndexedTree(int size) {
        this.size = size;
        tree = new long[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 long getSum(int from, int to) {
        return getSum(to) - getSum(from - 1);
    }
    
    public long getSum(int x) {
        int mask = 1;
        long 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