結果

問題 No.631 Noelちゃんと電車旅行
ユーザー yuya178yuya178
提出日時 2018-01-06 20:40:45
言語 Java21
(openjdk 21)
結果
AC  
実行時間 846 ms / 2,000 ms
コード長 5,859 bytes
コンパイル時間 3,152 ms
コンパイル使用メモリ 88,740 KB
実行使用メモリ 138,364 KB
最終ジャッジ日時 2024-04-10 07:49:13
合計ジャッジ時間 18,386 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 606 ms
117,892 KB
testcase_01 AC 807 ms
138,256 KB
testcase_02 AC 830 ms
138,364 KB
testcase_03 AC 825 ms
138,080 KB
testcase_04 AC 846 ms
138,304 KB
testcase_05 AC 832 ms
138,048 KB
testcase_06 AC 608 ms
132,892 KB
testcase_07 AC 536 ms
131,908 KB
testcase_08 AC 763 ms
136,216 KB
testcase_09 AC 794 ms
132,612 KB
testcase_10 AC 779 ms
136,012 KB
testcase_11 AC 753 ms
135,168 KB
testcase_12 AC 782 ms
136,560 KB
testcase_13 AC 646 ms
118,444 KB
testcase_14 AC 491 ms
117,372 KB
testcase_15 AC 705 ms
130,960 KB
testcase_16 AC 240 ms
99,532 KB
testcase_17 AC 237 ms
99,692 KB
testcase_18 AC 235 ms
99,636 KB
testcase_19 AC 241 ms
99,860 KB
testcase_20 AC 234 ms
99,780 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    long MOD = 1_000_000_007;
    int inf = Integer.MAX_VALUE;

    int n;
    int[] t;
    void solve(){
        n = ni();
        t = new int[n-1];
        for(int i = 0; i < n-1; i++){
            t[i] = ni();
        }
        LazySegmentTree seg = new LazySegmentTree();
        for(int i = 0; i < n-1; i++){
            int tmp = 3*(n-1-i) + t[i];
            seg.update(i,i+1,tmp);
        }
        int m = ni();
        for(int i = 0; i < m; i++){
            int l = ni()-1;
            int r = ni()-1;
            long d = nl();
            // out.println(l+" "+r);
            seg.update(l,r+1,d);
            long res = seg.query(0,n)[0];
            // for(int j = 0; j < n; j++){
            //     long r1 = seg.query(j,j+1)[0];
            //     out.println(r1);
            // }
            out.println(res);
            // out.println();
        }
    }

    class LazySegmentTree {
        int SIZE = 1 << 19;
        long[][] seg;
        long[] lazy;
        LazySegmentTree() {
            this.seg = new long[2 * SIZE][2];
            this.lazy = new long[2 * SIZE];
            for(int i=0;i<2*SIZE;++i){
                seg[i][0] = 0;
                seg[i][1] = 0;
                lazy[i] = 0;
            }
        }
        long[] comb(long[] a, long[] b){
            return new long[]{Math.max(a[0],b[0]),a[1]+b[1]};
        }
        long[] query(int a,int b,int l,int r,int k){
            eval(l,r,k);
            if(a<=l&&r<=b) return seg[k];
            if(b<=l||r<=a) return new long[]{0,0};
            long[] ans1=query(a,b,l,(l+r)/2,2*k+1);
            long[] ans2=query(a,b,(l+r)/2,r,2*k+2);
            return comb(ans1,ans2);
        }
        long[] query(int l, int r) {
            return query(l,r,0,SIZE,0);
        }
        void eval(int l, int r, int k){
            if(this.lazy[k]!= 0){
                this.seg[k][0] += this.lazy[k];
                if(r-l>1){
                    this.lazy[2*k+1] += this.lazy[k];
                    this.lazy[2*k+2] += this.lazy[k];
                }
                this.lazy[k] = 0;
            }
        }
        void update(int a, int b, long x, int l, int r, int k){
            eval(l,r,k);
            if(b<=l||r<=a) return;
            if(a<=l&&r<=b){
                this.lazy[k] += x;
                eval(l,r,k);
            }
            else{
                update(a,b,x,l,(l+r)/2,2*k+1);
                update(a,b,x,(l+r)/2,r,2*k+2);
                this.seg[k] = comb(this.seg[2*k+1],this.seg[2*k+2]);
            }
        }
        void update(int a, int b, long x){
            update(a, b, x, 0, SIZE, 0);
        }
    }    

    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
 
}
0