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

提出ソース

結果

問題	No.469 区間加算と一致検索の問題
ユーザー	uwi
提出日時	2016-12-19 00:08:20
言語	Java21 (openjdk 21)
結果	AC
実行時間	594 ms / 5,000 ms
コード長	4,149 bytes
コンパイル時間	4,393 ms
コンパイル使用メモリ	90,492 KB
実行使用メモリ	63,204 KB
最終ジャッジ日時	2023-08-23 13:16:21
合計ジャッジ時間	22,214 ms
ジャッジサーバーID （参考情報）	judge14 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	91 ms 53,396 KB
testcase_01	AC	93 ms 53,108 KB
testcase_02	AC	94 ms 53,308 KB
testcase_03	AC	128 ms 53,928 KB
testcase_04	AC	138 ms 53,716 KB
testcase_05	AC	138 ms 53,796 KB
testcase_06	AC	146 ms 54,132 KB
testcase_07	AC	149 ms 53,328 KB
testcase_08	AC	139 ms 53,372 KB
testcase_09	AC	126 ms 54,064 KB
testcase_10	AC	162 ms 53,876 KB
testcase_11	AC	108 ms 53,972 KB
testcase_12	AC	146 ms 54,072 KB
testcase_13	AC	136 ms 53,808 KB
testcase_14	AC	101 ms 53,712 KB
testcase_15	AC	114 ms 53,728 KB
testcase_16	AC	145 ms 54,032 KB
testcase_17	AC	144 ms 53,956 KB
testcase_18	AC	141 ms 53,004 KB
testcase_19	AC	106 ms 53,812 KB
testcase_20	AC	150 ms 54,028 KB
testcase_21	AC	117 ms 53,640 KB
testcase_22	AC	99 ms 53,492 KB
testcase_23	AC	325 ms 57,996 KB
testcase_24	AC	319 ms 58,072 KB
testcase_25	AC	318 ms 58,080 KB
testcase_26	AC	318 ms 58,328 KB
testcase_27	AC	320 ms 58,376 KB
testcase_28	AC	321 ms 58,112 KB
testcase_29	AC	319 ms 56,120 KB
testcase_30	AC	318 ms 58,056 KB
testcase_31	AC	308 ms 58,312 KB
testcase_32	AC	320 ms 57,748 KB
testcase_33	AC	584 ms 60,992 KB
testcase_34	AC	555 ms 60,780 KB
testcase_35	AC	566 ms 60,656 KB
testcase_36	AC	565 ms 60,736 KB
testcase_37	AC	561 ms 60,536 KB
testcase_38	AC	570 ms 60,520 KB
testcase_39	AC	588 ms 60,628 KB
testcase_40	AC	550 ms 60,404 KB
testcase_41	AC	581 ms 60,584 KB
testcase_42	AC	574 ms 60,400 KB
testcase_43	AC	547 ms 62,988 KB
testcase_44	AC	576 ms 60,416 KB
testcase_45	AC	583 ms 60,712 KB
testcase_46	AC	594 ms 63,204 KB
testcase_47	AC	582 ms 60,568 KB
testcase_48	AC	98 ms 53,264 KB
testcase_49	AC	95 ms 53,528 KB
testcase_50	AC	553 ms 60,708 KB
testcase_51	AC	551 ms 60,432 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

yukicoder

結果

テストケース

ソースコード