結果

問題 No.990 N×Mマス計算（Kの倍数）
ユーザー uwiuwi
提出日時 2020-02-14 21:33:16
言語 Java21
(openjdk 21)
結果
AC  
実行時間 222 ms / 2,000 ms
コード長 4,508 bytes
コンパイル時間 4,000 ms
コンパイル使用メモリ 84,472 KB
実行使用メモリ 41,528 KB
最終ジャッジ日時 2024-11-16 00:27:34
合計ジャッジ時間 7,254 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
37,304 KB
testcase_01 AC 51 ms
37,204 KB
testcase_02 AC 51 ms
37,076 KB
testcase_03 AC 51 ms
37,168 KB
testcase_04 AC 52 ms
37,328 KB
testcase_05 AC 51 ms
37,360 KB
testcase_06 AC 51 ms
37,164 KB
testcase_07 AC 51 ms
36,944 KB
testcase_08 AC 52 ms
37,368 KB
testcase_09 AC 51 ms
36,960 KB
testcase_10 AC 173 ms
40,212 KB
testcase_11 AC 113 ms
39,512 KB
testcase_12 AC 222 ms
40,484 KB
testcase_13 AC 93 ms
38,960 KB
testcase_14 AC 187 ms
41,272 KB
testcase_15 AC 119 ms
40,340 KB
testcase_16 AC 156 ms
40,908 KB
testcase_17 AC 135 ms
39,764 KB
testcase_18 AC 214 ms
41,528 KB
testcase_19 AC 156 ms
40,008 KB
testcase_20 AC 202 ms
41,368 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200214;
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 D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni(), K = ni();
		char o = nc();
		int[] b = na(m);
		int[] a = na(n);
		for(int i = 0;i < n;i++) {
			a[i] %= K;
		}
		for(int i = 0;i < m;i++) {
			b[i] %= K;
		}
		if(o == '+') {
			long ans = 0;
			Arrays.sort(b);
			for(int v : a) {
				ans += lowerBound(b, (K-v)%K+1) - lowerBound(b, (K-v)%K);
			}
			out.println(ans);
		}else {
			long[] ds = new long[10000];
			int p = 0;
			for(long d = 1;d*d <= K;d++) {
				if(K % d == 0) {
					ds[p++] = d;
					if(d*d < K)ds[p++] = K/d;
				}
			}
			ds = Arrays.copyOf(ds, p);
			Arrays.sort(ds);
			
			int[] fb = new int[p];
			for(int i = 0;i < m;i++) {
				int g = gcd(b[i], K);
				fb[Arrays.binarySearch(ds, g)]++;
			}
			
			for(int i = 0;i < p;i++) {
				for(int j = i+1;j < p;j++) {
					if(ds[j] % ds[i] == 0) {
						fb[i] += fb[j];
					}
				}
			}
			
			long ans = 0;
			for(int v : a) {
				int g = gcd(v, K);
				int ind = Arrays.binarySearch(ds, K/g);
				ans += fb[ind];
			}
			out.println(ans);
		}
	}
	
	public static int gcd(int a, int b) {
		while (b > 0) {
			int c = a;
			a = b;
			b = c % b;
		}
		return a;
	}
	
	
	public static int lowerBound(int[] a, int v){ return lowerBound(a, 0, a.length, v); }
	public static int lowerBound(int[] a, int l, int r, int v)
	{
		if(l > r || l < 0 || r > a.length)throw new IllegalArgumentException();
		int low = l-1, high = r;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

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