結果

問題 No.510 二次漸化式
ユーザー uwiuwi
提出日時 2017-04-29 14:35:21
言語 Java21
(openjdk 21)
結果
AC  
実行時間 284 ms / 3,000 ms
コード長 6,406 bytes
コンパイル時間 4,236 ms
コンパイル使用メモリ 84,332 KB
実行使用メモリ 65,636 KB
最終ジャッジ日時 2024-09-13 19:15:03
合計ジャッジ時間 12,506 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
37,236 KB
testcase_01 AC 52 ms
36,872 KB
testcase_02 AC 164 ms
40,240 KB
testcase_03 AC 143 ms
40,396 KB
testcase_04 AC 156 ms
40,644 KB
testcase_05 AC 158 ms
40,592 KB
testcase_06 AC 158 ms
42,204 KB
testcase_07 AC 174 ms
42,060 KB
testcase_08 AC 176 ms
41,840 KB
testcase_09 AC 166 ms
42,152 KB
testcase_10 AC 138 ms
40,248 KB
testcase_11 AC 143 ms
39,920 KB
testcase_12 AC 142 ms
40,200 KB
testcase_13 AC 131 ms
40,420 KB
testcase_14 AC 124 ms
40,268 KB
testcase_15 AC 125 ms
40,000 KB
testcase_16 AC 225 ms
65,608 KB
testcase_17 AC 219 ms
65,264 KB
testcase_18 AC 224 ms
65,476 KB
testcase_19 AC 215 ms
65,300 KB
testcase_20 AC 220 ms
65,480 KB
testcase_21 AC 221 ms
65,248 KB
testcase_22 AC 228 ms
65,348 KB
testcase_23 AC 267 ms
65,368 KB
testcase_24 AC 284 ms
65,536 KB
testcase_25 AC 271 ms
65,324 KB
testcase_26 AC 278 ms
65,356 KB
testcase_27 AC 275 ms
65,556 KB
testcase_28 AC 271 ms
65,364 KB
testcase_29 AC 273 ms
65,372 KB
testcase_30 AC 277 ms
65,636 KB
testcase_31 AC 191 ms
65,100 KB
testcase_32 AC 197 ms
65,184 KB
testcase_33 AC 197 ms
65,008 KB
testcase_34 AC 237 ms
65,292 KB
testcase_35 AC 202 ms
65,048 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170428;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class C3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		SegmentTreeArrayL st = new SegmentTreeArrayL(n+1);
		int[] xs = new int[n];
		int[] ys = new int[n];
		for(int Q = ni();Q > 0;Q--){
			char c = nc();
			if(c == 'x'){
				int id = ni(), v = ni();
				xs[id] = v;
				st.update(id, xs[id], ys[id]);
			}else if(c == 'y'){
				int id = ni(), v = ni();
				ys[id] = v;
				st.update(id, xs[id], ys[id]);
			}else{
				int id = ni();
				long[] v = {1, 1, 1, 1};
				out.println(st.apply(0, id, v)[0]);
			}
//			tr("--------------");
//			for(long[] no : st.node){
//				tr(no);
//			}
//			for(int i = 0;i < 3;i++){
//				long[] v = {1, 1, 1, 1};
//				tr(st.apply(0, i, v));
//			}
		}
	}
	
	int mod = 1000000007;
	
	public static class SegmentTreeArrayL {
		public int M, H, N;
		public long[][] node;
		public int K = 8;
		
		public SegmentTreeArrayL(int n)
		{
			N = n;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			
			node = new long[M][];
			for(int i = 0;i < N;i++){
				long[] item = new long[K];
				item[5] = item[7] = 1;
				
				node[H+i] = item;
			}
			queue = new int[M];
			inq = new boolean[M];
			qp = 0;
			
			for(int i = H-1;i >= 1;i--)propagate(i);
		}
		
		private void propagate(int cur)
		{
			node[cur] = prop2(node[2*cur], node[2*cur+1], node[cur]);
		}
		int mod = 1000000007;
		
		private long[] prop2(long[] L, long[] R, long[] C)
		{
			if(L != null && R != null){
				if(C == null)C = new long[K];
				long[] P = C;
				// 1 a 0 0
				// 0 b c d
				// 0 0 e f
				// 0 0 0 1
				
				P[0] = (L[0]+R[0]*L[3])%mod;
				P[1] = (L[1]+R[0]*L[4]+R[1]*L[6])%mod;
				P[2] = (L[2]+R[0]*L[5]+R[1]*L[7]+R[2])%mod;
				P[3] = (R[3]*L[3])%mod;
				P[4] = (R[3]*L[4]+R[4]*L[6])%mod;
				P[5] = (R[3]*L[5]+R[4]*L[7]+R[5])%mod;
				P[6] = (R[6]*L[6])%mod;
				P[7] = (R[6]*L[7]+R[7])%mod;
				return C;
			}else if(L != null){
				return prop1(L, C);
			}else if(R != null){
				return prop1(R, C);
			}else{
				return null;
			}
		}
		
		private long[] prop1(long[] L, long[] C)
		{
			if(C == null)C = new long[K];
			System.arraycopy(L, 0, C, 0, K);
			return C;
		}
		
		public int qp;
		public int[] queue;
		public boolean[] inq;
		
		private void superPropagate()
		{
			for(int r = 0;r < qp;r++){
				int tar = queue[r];
				inq[tar] = false;
				propagate(tar);
				if(tar > 1 && !inq[tar>>>1]){
					inq[tar>>>1] = true;
					queue[qp++] = tar>>>1;
				}
			}
			qp = 0;
		}
		
		public void update(int x, long a, long b) {
			node[H+x][0] = a;
			node[H+x][3] = b*b%mod;
			node[H+x][4] = 2*b;
			node[H+x][6] = b;
			if(!inq[H+x>>>1]){
				inq[H+x>>>1] = true;
				queue[qp++] = H+x>>>1;
			}
//			for(int i = H+x>>>1;i >= 1;i>>>=1)propagate(i);
		}
		
		public long[] apply(int l, int r, long[] v) {
			superPropagate();
			return apply(l, r, v, 0, H, 1);
		}
		
		public long[] apply(long[] m, long[] v)
		{
			long v0 = (v[0] + m[0] * v[1] + m[1] * v[2] + m[2]) % mod;
			long v1 = (m[3] * v[1] + m[4] * v[2] + m[5]) % mod;
			long v2 = (m[6] * v[2] + m[7]) % mod;
			v[0] = v0; v[1] = v1; v[2] = v2;
			return v;
		}
		
		protected long[] apply(int l, int r, long[] v, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				return apply(node[cur], v);
			}else{
				int mid = cl+cr>>>1;
				if(cl < r && l < mid){
					v = apply(l, r, v, cl, mid, 2*cur);
				}
				if(mid < r && l < cr){
					v = apply(l, r, v, mid, cr, 2*cur+1);
				}
				return v;
			}
		}
	}
	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new C3().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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))){ // when nextLine, (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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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