#139769 (Java21) No.469 区間加算と一致検索の問題

• 問題: No.469 区間加算と一致検索の問題
• ユーザー: uwi
• 提出日時: 2016-12-19 00:08:20
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 621 ms / 5,000 ms
• コード長: 4,149 bytes
• コンパイル時間: 4,143 ms
• コンパイル使用メモリ: 83,220 KB
• 実行使用メモリ: 60,568 KB
• 最終ジャッジ日時: 2024-06-01 10:50:21
• 合計ジャッジ時間: 23,489 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	104 ms; 52,192 KB
testcase_01	AC	104 ms; 52,168 KB
testcase_02	AC	107 ms; 52,584 KB
testcase_03	AC	138 ms; 52,768 KB
testcase_04	AC	150 ms; 52,984 KB
testcase_05	AC	153 ms; 52,852 KB
testcase_06	AC	159 ms; 53,036 KB
testcase_07	AC	162 ms; 53,164 KB
testcase_08	AC	165 ms; 53,032 KB
testcase_09	AC	145 ms; 52,348 KB
testcase_10	AC	174 ms; 53,104 KB
testcase_11	AC	132 ms; 52,748 KB
testcase_12	AC	161 ms; 53,336 KB
testcase_13	AC	154 ms; 53,300 KB
testcase_14	AC	125 ms; 53,024 KB
testcase_15	AC	130 ms; 52,452 KB
testcase_16	AC	150 ms; 53,044 KB
testcase_17	AC	161 ms; 52,816 KB
testcase_18	AC	159 ms; 53,056 KB
testcase_19	AC	120 ms; 52,436 KB
testcase_20	AC	161 ms; 52,800 KB
testcase_21	AC	125 ms; 52,388 KB
testcase_22	AC	112 ms; 52,700 KB
testcase_23	AC	344 ms; 57,784 KB
testcase_24	AC	332 ms; 47,184 KB
testcase_25	AC	340 ms; 46,656 KB
testcase_26	AC	336 ms; 46,524 KB
testcase_27	AC	349 ms; 46,336 KB
testcase_28	AC	333 ms; 47,200 KB
testcase_29	AC	340 ms; 46,680 KB
testcase_30	AC	325 ms; 46,628 KB
testcase_31	AC	344 ms; 46,648 KB
testcase_32	AC	326 ms; 46,412 KB
testcase_33	AC	621 ms; 51,004 KB
testcase_34	AC	583 ms; 60,568 KB
testcase_35	AC	588 ms; 50,840 KB
testcase_36	AC	582 ms; 50,772 KB
testcase_37	AC	575 ms; 53,980 KB
testcase_38	AC	579 ms; 49,720 KB
testcase_39	AC	608 ms; 53,132 KB
testcase_40	AC	589 ms; 49,592 KB
testcase_41	AC	569 ms; 49,920 KB
testcase_42	AC	580 ms; 53,080 KB
testcase_43	AC	591 ms; 49,696 KB
testcase_44	AC	599 ms; 49,888 KB
testcase_45	AC	565 ms; 49,820 KB
testcase_46	AC	567 ms; 49,896 KB
testcase_47	AC	586 ms; 49,844 KB
testcase_48	AC	115 ms; 40,348 KB
testcase_49	AC	105 ms; 39,604 KB
testcase_50	AC	596 ms; 52,892 KB
testcase_51	AC	558 ms; 52,888 KB

ソースコード

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;
		
		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)); }
}