結果

問題 No.879 Range Mod 2 Query
ユーザー 37zigen37zigen
提出日時 2020-08-10 17:14:19
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,335 ms / 3,000 ms
コード長 4,878 bytes
コンパイル時間 2,215 ms
コンパイル使用メモリ 79,124 KB
実行使用メモリ 127,372 KB
最終ジャッジ日時 2024-04-16 20:59:13
合計ジャッジ時間 24,699 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
36,892 KB
testcase_01 AC 98 ms
40,296 KB
testcase_02 AC 105 ms
40,384 KB
testcase_03 AC 105 ms
40,488 KB
testcase_04 AC 113 ms
40,728 KB
testcase_05 AC 84 ms
38,176 KB
testcase_06 AC 86 ms
38,852 KB
testcase_07 AC 107 ms
40,852 KB
testcase_08 AC 111 ms
40,816 KB
testcase_09 AC 95 ms
39,620 KB
testcase_10 AC 100 ms
40,008 KB
testcase_11 AC 2,160 ms
117,004 KB
testcase_12 AC 1,373 ms
106,848 KB
testcase_13 AC 1,719 ms
115,468 KB
testcase_14 AC 1,714 ms
122,612 KB
testcase_15 AC 1,707 ms
89,244 KB
testcase_16 AC 2,263 ms
118,504 KB
testcase_17 AC 2,277 ms
120,288 KB
testcase_18 AC 2,335 ms
127,372 KB
testcase_19 AC 1,421 ms
104,892 KB
testcase_20 AC 1,515 ms
105,148 KB
testcase_21 AC 1,504 ms
105,300 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.NoSuchElementException;

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}

class Main {
	public static void main(String[] args) {
		new Main().run();
	}
	
	class Tree {
		int n=1;
		int n_;
		long[] sum;
		int[] sum_parity;		
		ArrayDeque<Long>[] lazy;
		long erase=-1;
		
		public Tree(int n_) {
			while (n<n_) n*=2;
			this.n_=n_;
			sum=new long[2*n-1];
			sum_parity=new int[2*n-1];
			lazy=new ArrayDeque[2*n-1];
			for (int i=0;i<lazy.length;++i) lazy[i]=new ArrayDeque<Long>();
		}
		
		void push(int k,int l,int r) {
			while (!lazy[k].isEmpty()) {
				long key=lazy[k].pollFirst();
				if (key==erase) {
					sum[k]=sum_parity[k];
				} else {
					sum[k]+=key*(r-l);
					if (key%2==1) {
						sum_parity[k]=r-l-sum_parity[k];
					}
				}
				if (2*k+1<sum.length) {
					if (key==erase) {
						for (int i=1;i<=2;++i){
							long add=0;
							while (!lazy[2*k+i].isEmpty()) {
								if (lazy[2*k+i].peekLast()==erase)
									lazy[2*k+i].pollLast();
								else {
									add+=lazy[2*k+i].pollLast();
								}
							}
							lazy[2*k+i].addLast(add);
							lazy[2*k+i].addLast(erase);
						}
					} else {
						for (int i=1;i<=2;++i) {
							if (!lazy[2*k+i].isEmpty() && lazy[2*k+i].peekLast()!=erase) {
								lazy[2*k+i].add(lazy[2*k+i].pollLast()+key);
							} else {
								lazy[2*k+i].add(key);
							}
						}
					}
				}
			}
		}
		
		void erase(int a,int b) {
			query(0,n,a,b,0,erase);
		}
		
		void add(int a,int b,long val) {
			query(0,n,a,b,0,val);
		}
		
		long query(int a,int b) {
			return query(0,n,a,b,0,0);
		}
		
		long query(int l,int r,int a,int b,int k,long add) {
			push(k,l,r);
			if (r<=a||b<=l) return 0;
			else if (a<=l&&r<=b) {
				lazy[k].addLast(add);
				push(k,l,r);
				return sum[k];
			} else {
				long vl=query(l,(l+r)/2,a,b,2*k+1,add);
				long vr=query((l+r)/2,r,a,b,2*k+2,add);
				sum[k]=sum[2*k+1]+sum[2*k+2];
				sum_parity[k]=sum_parity[2*k+1]+sum_parity[2*k+2];
				return vl+vr;
			}
		}
		
	}
	
	void run() {
		FastScanner sc = new FastScanner();
		int N=sc.nextInt();
		int Q=sc.nextInt();
		Tree tree=new Tree(N);
		for (int i=0;i<N;++i) {
			long A=Integer.parseInt(sc.next());
			tree.sum[tree.n+i-1]+=A;
			tree.sum_parity[tree.n+i-1]+=A%2;
		}
		for (int i=tree.n-2;i>=0;--i) {
			tree.sum[i]=tree.sum[2*i+1]+tree.sum[2*i+2];
			tree.sum_parity[i]=tree.sum_parity[2*i+1]+tree.sum_parity[2*i+2];
		}
		PrintWriter pw=new PrintWriter(System.out);
		for (int i=0;i<Q;++i) {
			int t=sc.nextInt();
			int l=sc.nextInt()-1;
			int r=sc.nextInt();
			if (t==1) {
				tree.erase(l,r);
			} else if (t==2) {
				long x=sc.nextLong();
				tree.add(l, r, x);
			} else {
				pw.println(tree.query(l, r));
			}
		}
		pw.flush();
	}
}
0