結果

問題 No.469 区間加算と一致検索の問題
ユーザー uwiuwi
提出日時 2016-12-19 00:07:41
言語 Java
(openjdk 23)
結果
AC  
実行時間 798 ms / 5,000 ms
コード長 4,345 bytes
コンパイル時間 5,301 ms
コンパイル使用メモリ 87,988 KB
実行使用メモリ 66,740 KB
最終ジャッジ日時 2024-12-21 16:36:03
合計ジャッジ時間 26,346 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 113 ms
39,396 KB
testcase_01 AC 109 ms
39,844 KB
testcase_02 AC 124 ms
41,480 KB
testcase_03 AC 148 ms
40,100 KB
testcase_04 AC 159 ms
40,532 KB
testcase_05 AC 159 ms
40,400 KB
testcase_06 AC 166 ms
40,528 KB
testcase_07 AC 166 ms
40,300 KB
testcase_08 AC 165 ms
40,748 KB
testcase_09 AC 145 ms
39,916 KB
testcase_10 AC 184 ms
41,660 KB
testcase_11 AC 135 ms
39,992 KB
testcase_12 AC 176 ms
41,324 KB
testcase_13 AC 155 ms
40,524 KB
testcase_14 AC 129 ms
40,612 KB
testcase_15 AC 130 ms
40,380 KB
testcase_16 AC 163 ms
41,348 KB
testcase_17 AC 164 ms
40,584 KB
testcase_18 AC 160 ms
41,364 KB
testcase_19 AC 125 ms
39,688 KB
testcase_20 AC 160 ms
41,120 KB
testcase_21 AC 128 ms
40,000 KB
testcase_22 AC 110 ms
39,636 KB
testcase_23 AC 361 ms
46,684 KB
testcase_24 AC 342 ms
46,692 KB
testcase_25 AC 326 ms
46,388 KB
testcase_26 AC 344 ms
46,568 KB
testcase_27 AC 361 ms
46,452 KB
testcase_28 AC 357 ms
46,652 KB
testcase_29 AC 372 ms
46,508 KB
testcase_30 AC 364 ms
46,944 KB
testcase_31 AC 353 ms
46,608 KB
testcase_32 AC 349 ms
46,612 KB
testcase_33 AC 797 ms
66,236 KB
testcase_34 AC 782 ms
66,240 KB
testcase_35 AC 798 ms
66,004 KB
testcase_36 AC 793 ms
66,084 KB
testcase_37 AC 798 ms
65,980 KB
testcase_38 AC 771 ms
66,216 KB
testcase_39 AC 736 ms
66,008 KB
testcase_40 AC 769 ms
66,200 KB
testcase_41 AC 727 ms
66,228 KB
testcase_42 AC 774 ms
66,180 KB
testcase_43 AC 790 ms
66,588 KB
testcase_44 AC 779 ms
65,936 KB
testcase_45 AC 774 ms
66,232 KB
testcase_46 AC 755 ms
66,140 KB
testcase_47 AC 758 ms
66,028 KB
testcase_48 AC 117 ms
39,916 KB
testcase_49 AC 99 ms
39,752 KB
testcase_50 AC 774 ms
66,740 KB
testcase_51 AC 783 ms
66,192 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2016;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.Map;
import java.util.Random;

public class N469 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		Random gen = new Random();
		long B1 = BigInteger.probablePrime(30, gen).longValue();
		long M1 = BigInteger.probablePrime(31, gen).longValue();
		long B2 = BigInteger.probablePrime(30, gen).longValue();
		long M2 = BigInteger.probablePrime(31, gen).longValue();
		int n = ni(), Q = ni();
		long h1 = 0, h2 = 0;
		long[] p1 = new long[n+2];
		p1[0] = 1;
		for(int i = 1;i <= n+1;i++)p1[i] = p1[i-1] * B1 % M1;
		long[] p2 = new long[n+2];
		p2[0] = 1;
		for(int i = 1;i <= n+1;i++)p2[i] = p2[i-1] * B2 % M2;
		
		Map<Long, Integer> when = new HashMap<>();
		when.put(0L, 0);
		for(int i = 0;i < Q;i++){
			char t = nc();
			if(t == '!'){
				int l = ni(), r = ni(), v = ni();
				h1 += v*(sumGP(B1, r, M1) - sumGP(B1, l, M1));
				h2 += v*(sumGP(B2, r, M2) - sumGP(B2, l, M2));
				h1 %= M1; if(h1 < 0)h1 += M1;
				h2 %= M2; if(h2 < 0)h2 += M2;
				when.putIfAbsent(h1<<32|h2, i+1);
			}else{
				out.println(when.get(h1<<32|h2));
			}
		}
	}
	
	public static long sumGP(long a, long n, long mod)
	{
		long smul = 1; // % mod
		long mul = a % mod;
		long ret = 0;
		for(;n > 0;n >>>= 1){
			if((n&1)==1){
				ret = (ret * mul + smul) % mod;
			}
			smul = smul * (mul + 1) % mod;
			mul = mul * mul % mod;
		}
		return ret;
	}

	
	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 N469().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