結果
問題 | No.749 クエリ全部盛り |
ユーザー |
|
提出日時 | 2020-08-27 07:21:30 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 2,890 ms / 3,000 ms |
コード長 | 5,007 bytes |
コンパイル時間 | 5,337 ms |
コンパイル使用メモリ | 78,772 KB |
実行使用メモリ | 380,364 KB |
最終ジャッジ日時 | 2024-09-27 16:29:05 |
合計ジャッジ時間 | 21,103 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 20 |
ソースコード
import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;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 Seg {final int MOD=(int)(1e9+7);int n=1;int[][] vec;int[][] lazy;public Seg(int n_) {while (n<n_) n*=2;vec=new int[2*n-1][3];lazy=new int[2*n-1][3];for (int i=0;i<2*n-1;++i) {lazy[i][0]=1;}for (int i=n-1;i<2*n-1;++i) {vec[i][1]=1;if (i==n-1) {vec[i][2]=0;} else if (i==n) {vec[i][2]=1;} else {vec[i][2]=(vec[i-1][2]+vec[i-2][2])%MOD;}}for (int i=n-2;i>=0;--i) {for (int j=0;j<3;++j)vec[i][j]=(vec[2*i+1][j]+vec[2*i+2][j])%MOD;}}int[] mul_lazy(int[] a,int[] b) {int[] c=new int[3];for (int i=0;i<3;++i) c[i]=(int)((long)a[0]*b[i]%MOD);c[1]=(c[1]+a[1])%MOD;c[2]=(c[2]+a[2])%MOD;return c;}void propagate(int k) {long sum=0;for (int i=0;i<3;++i) sum=(sum+(long)lazy[k][i]*vec[k][i])%MOD;vec[k][0]=(int)sum;if (2*k+1<2*n-1) {lazy[2*k+1]=mul_lazy(lazy[k],lazy[2*k+1]);lazy[2*k+2]=mul_lazy(lazy[k],lazy[2*k+2]);}for (int i=0;i<3;++i) lazy[k][i]=0;lazy[k][0]=1;}int[] query_q0(int a,int b,int k0) {return query_q0(0,n,a,b,0,k0);}void query(int a,int b,int q,int k0) {query(0,n,a,b,0,q,k0);}int[] query_q0(int l,int r,int a,int b,int k,int k0) {propagate(k);if (r<=a||b<=l) return new int[] {0,0,0};else if (a<=l&&r<=b) {propagate(k);return vec[k];} else {int[] vl=query_q0(l,(l+r)/2,a,b,2*k+1,k0);int[] vr=query_q0((l+r)/2,r,a,b,2*k+2,k0);for (int i=0;i<3;++i) vec[k][i]=(vec[2*k+1][i]+vec[2*k+2][i])%MOD;int[] ret=new int[3];for (int i=0;i<3;++i) ret[i]=(vl[i]+vr[i])%MOD;return ret;}}void query(int l,int r,int a,int b,int k,int q0,int k0) {propagate(k);if (r<=a||b<=l) return;else if (a<=l&&r<=b) {if (q0==1) {lazy[k][0]=0;lazy[k][1]=k0;} else if (q0==2) {lazy[k][1]=k0;} else if (q0==3) {lazy[k][0]=k0;} else if (q0==4) {lazy[k][2]=k0;}propagate(k);} else {query(l,(l+r)/2,a,b,2*k+1,q0,k0);query((l+r)/2,r,a,b,2*k+2,q0,k0);for (int i=0;i<3;++i) vec[k][i]=(vec[2*k+1][i]+vec[2*k+2][i])%MOD;}}void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}}class Main {public static void main(String[] args) {new Main().run();}final long MOD=(long)(1e9+7);void run() {FastScanner sc = new FastScanner();int N=sc.nextInt();int Q=sc.nextInt();Seg seg=new Seg(N);PrintWriter pw=new PrintWriter(System.out);while (Q-->0) {int q=sc.nextInt();int l=sc.nextInt();int r=sc.nextInt()+1;int k=sc.nextInt();if (q==0) {pw.println((long)seg.query_q0(l, r, k)[0]*k%MOD);} else {seg.query(l, r, q, k);}}pw.flush();}void tr(Object...o) {System.out.println(Arrays.deepToString(o));}}