結果

問題 No.886 Direct
ユーザー uwiuwi
提出日時 2019-09-13 22:45:00
言語 Java21
(openjdk 21)
結果
AC  
実行時間 496 ms / 4,000 ms
コード長 4,598 bytes
コンパイル時間 4,262 ms
コンパイル使用メモリ 81,444 KB
実行使用メモリ 77,980 KB
最終ジャッジ日時 2023-09-17 14:55:09
合計ジャッジ時間 13,066 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 136 ms
77,112 KB
testcase_01 AC 138 ms
77,264 KB
testcase_02 AC 134 ms
77,268 KB
testcase_03 AC 139 ms
77,324 KB
testcase_04 AC 133 ms
77,260 KB
testcase_05 AC 135 ms
77,248 KB
testcase_06 AC 138 ms
77,620 KB
testcase_07 AC 137 ms
75,296 KB
testcase_08 AC 134 ms
77,268 KB
testcase_09 AC 133 ms
77,252 KB
testcase_10 AC 133 ms
77,056 KB
testcase_11 AC 138 ms
77,340 KB
testcase_12 AC 138 ms
77,312 KB
testcase_13 AC 138 ms
77,332 KB
testcase_14 AC 137 ms
77,100 KB
testcase_15 AC 138 ms
77,580 KB
testcase_16 AC 137 ms
77,280 KB
testcase_17 AC 138 ms
77,244 KB
testcase_18 AC 143 ms
77,292 KB
testcase_19 AC 142 ms
77,052 KB
testcase_20 AC 139 ms
77,140 KB
testcase_21 AC 139 ms
77,356 KB
testcase_22 AC 142 ms
77,324 KB
testcase_23 AC 209 ms
77,808 KB
testcase_24 AC 274 ms
77,980 KB
testcase_25 AC 199 ms
77,748 KB
testcase_26 AC 192 ms
75,504 KB
testcase_27 AC 345 ms
77,556 KB
testcase_28 AC 356 ms
77,548 KB
testcase_29 AC 135 ms
77,252 KB
testcase_30 AC 139 ms
77,568 KB
testcase_31 AC 496 ms
77,524 KB
testcase_32 AC 495 ms
77,516 KB
testcase_33 AC 493 ms
77,660 KB
testcase_34 AC 492 ms
77,972 KB
testcase_35 AC 494 ms
77,592 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190913;
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 E2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		// a, b
		// gcd(a, b) = 1
		// sum (h-a)*(w-b)*2
		// + (h-1)w + w(h-1)
		
		// sum_(a,b) 1 (gcd(a,b)=1) = 
		
		long H = nl(), W = nl();
		int mod = 1000000007;
		
		int[] lpf = enumLowestPrimeFactors(3000050);
		int[] mob = enumMobiusByLPF(3000050, lpf);
		
		long C = 0;
		long B = 0;
		long A = 0;
		long AB = 0;
		for(int i = 1;i <= H && i <= W;i++) {
			if(mob[i] == 0)continue;
			C += mob[i] * (H/i) * (W/i); // const
			B += mob[i] * (H/i) * s1(W/i, mod) % mod * i;
			A += mob[i] * (W/i) * s1(H/i, mod) % mod * i;
			AB += mob[i] * s1(H/i, mod) * s1(W/i, mod) % mod * i % mod * i;
			C %= mod;
			B %= mod;
			A %= mod;
			AB %= mod;
		}
		long ans= (AB-A*W-B*H+C*H%mod*W)*2+(H-1)*W+(W-1)*H;
		ans %= mod;
		if(ans < 0)ans += mod;
		out.println(ans);
	}
	
	public static long s1(long n, int mod)
	{
		return n*(n+1)/2 % mod;
	}

	
	public static int[] enumMobiusByLPF(int n, int[] lpf)
	{
		int[] mob = new int[n+1];
		mob[1] = 1;
		for(int i = 2;i <= n;i++){
			int j = i/lpf[i];
			if(lpf[j] == lpf[i]){
//				mob[i] = 0;
			}else{
				mob[i] = -mob[j];
			}
		}
		return mob;
	}

	
	public static int[] enumLowestPrimeFactors(int n) {
		int tot = 0;
		int[] lpf = new int[n + 1];
		int u = n + 32;
		double lu = Math.log(u);
		int[] primes = new int[(int) (u / lu + u / lu / lu * 1.5)];
		for (int i = 2; i <= n; i++)
			lpf[i] = i;
		for (int p = 2; p <= n; p++) {
			if (lpf[p] == p)
				primes[tot++] = p;
			int tmp;
			for (int i = 0; i < tot && primes[i] <= lpf[p] && (tmp = primes[i] * p) <= n; i++) {
				lpf[tmp] = primes[i];
			}
		}
		return lpf;
	}

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