結果

問題 No.97 最大の値を求めるくえり
ユーザー uwiuwi
提出日時 2014-12-09 04:08:27
言語 Java21
(openjdk 21)
結果
AC  
実行時間 742 ms / 5,000 ms
コード長 5,279 bytes
コンパイル時間 2,895 ms
コンパイル使用メモリ 92,392 KB
実行使用メモリ 53,932 KB
最終ジャッジ日時 2024-06-11 18:45:37
合計ジャッジ時間 10,473 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 74 ms
37,616 KB
testcase_01 AC 109 ms
40,528 KB
testcase_02 AC 456 ms
47,860 KB
testcase_03 AC 742 ms
45,236 KB
testcase_04 AC 220 ms
45,508 KB
testcase_05 AC 229 ms
46,720 KB
testcase_06 AC 252 ms
47,416 KB
testcase_07 AC 334 ms
48,128 KB
testcase_08 AC 304 ms
48,944 KB
testcase_09 AC 421 ms
45,948 KB
testcase_10 AC 537 ms
45,120 KB
testcase_11 AC 490 ms
53,932 KB
testcase_12 AC 347 ms
46,488 KB
testcase_13 AC 420 ms
50,012 KB
testcase_14 AC 343 ms
49,620 KB
testcase_15 AC 294 ms
49,332 KB
testcase_16 AC 262 ms
48,588 KB
testcase_17 AC 244 ms
46,404 KB
testcase_18 AC 261 ms
47,488 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 Main {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int n = ni(), Q = ni();
		long[] a = new long[n];
		XorShift xs = new XorShift();
		for(int i = 0;i < n;i++){
			a[i] = modh(xs.next());
		}
		int[] qs = na(Q);
		if((long)n*n < 200000){
			for(int i = 0;i < Q;i++){
				long max = -1;
				for(int j = 0;j < n;j++){
					long v = modh(a[j]*qs[i]);
					if(v > max)max = v;
				}
				out.println(max);
			}
		}else{
			boolean[] table = new boolean[100003];
			for(int i = 0;i < n;i++){
				table[(int)a[i]] = true;
			}
			int[] invs = enumInvs(100002, 100003);
			for(int i = 0;i < Q;i++){
				if(qs[i] == 0){
					out.println(0);
				}else{
					int iv = invs[qs[i]];
					for(int j = 100002;j >= 0;j--){
						if(table[(int)modh((long)j*iv)]){
							out.println(j);
							break;
						}
					}
				}
			}
		}
	}
	
	public static int mod;
	public static long M;
	public static int h;
	
	static {
		mod = 100003;
		long K = Integer.highestOneBit(mod)<<1;
		h = Long.numberOfTrailingZeros(K)*2;
		M = K*K/mod;
	}
	
	public static long modh(long a)
	{
		long r = a-((M*(a&mask)>>>31)+M*(a>>>31)>>>h-31)*mod;
		return r < mod ? r : r-mod;
	}
	
	private static final long mask = (1L<<31)-1;
	
	public static int[] enumInvs(int n, int mod)
	{
		int[] inv = new int[n+1];
		inv[1] = 1;
		for(int i = 2;i <= n;i++){
			inv[i] = (int)modh(inv[mod%i]*(long)(mod-mod/i));
		}
		return inv;
	}
	
	public static long invl(long a, long mod) {
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		return p < 0 ? p + mod : p;
	}
	
	public static class XorShift {
		private long x=123456789, y=362436069, z=521288629, w=88675123;
		protected long next(){
			long t=(x^x<<11)&(1L<<32)-1; x=y; y=z; z=w; w=(w^w>>>19^t^t>>>8)&(1L<<32)-1;
			return w;
		}
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static 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 static 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 static 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 static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static int ni()
	{
		int num = 0, 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 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0