結果

問題 No.1201 お菓子配り-4
ユーザー uwiuwi
提出日時 2020-08-28 21:54:23
言語 Java21
(openjdk 21)
結果
AC  
実行時間 3,540 ms / 4,000 ms
コード長 4,230 bytes
コンパイル時間 5,332 ms
コンパイル使用メモリ 88,068 KB
実行使用メモリ 52,348 KB
最終ジャッジ日時 2024-11-14 00:17:17
合計ジャッジ時間 33,039 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 156 ms
51,760 KB
testcase_01 AC 1,104 ms
52,052 KB
testcase_02 AC 1,574 ms
52,128 KB
testcase_03 AC 800 ms
52,208 KB
testcase_04 AC 436 ms
51,992 KB
testcase_05 AC 957 ms
52,168 KB
testcase_06 AC 211 ms
51,844 KB
testcase_07 AC 490 ms
52,152 KB
testcase_08 AC 1,201 ms
52,348 KB
testcase_09 AC 891 ms
52,292 KB
testcase_10 AC 83 ms
51,136 KB
testcase_11 AC 302 ms
51,988 KB
testcase_12 AC 1,783 ms
52,296 KB
testcase_13 AC 116 ms
51,332 KB
testcase_14 AC 92 ms
51,392 KB
testcase_15 AC 1,402 ms
52,148 KB
testcase_16 AC 487 ms
52,012 KB
testcase_17 AC 604 ms
52,040 KB
testcase_18 AC 163 ms
51,908 KB
testcase_19 AC 163 ms
51,944 KB
testcase_20 AC 52 ms
50,248 KB
testcase_21 AC 52 ms
49,912 KB
testcase_22 AC 52 ms
50,324 KB
testcase_23 AC 51 ms
50,328 KB
testcase_24 AC 52 ms
49,888 KB
testcase_25 AC 51 ms
50,028 KB
testcase_26 AC 52 ms
49,956 KB
testcase_27 AC 53 ms
50,080 KB
testcase_28 AC 53 ms
50,356 KB
testcase_29 AC 53 ms
50,256 KB
testcase_30 AC 2,205 ms
52,172 KB
testcase_31 AC 2,203 ms
52,112 KB
testcase_32 AC 2,200 ms
51,940 KB
testcase_33 AC 2,224 ms
52,164 KB
testcase_34 AC 2,206 ms
52,044 KB
testcase_35 AC 3,540 ms
52,032 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200828;
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();
		int[] a = na(n);
		int[] b = na(m);
		// sum_i sum_j sum_{k=1}^b[j] 2[a[i]*k/b[j]]
		long s = 0;
		for(int v : a){
			for(int w : b){
				s += sumFloorFraction(v, w, w+1);
			}
		}
		s = s % mod * 2 % mod;
		if(s < 0)s += mod;
		out.println(s);
	}
	
	public static long gcd(long a, long b) {
		while (b > 0) {
			long c = a;
			a = b;
			b = c % b;
		}
		return a;
	}
	
	
	static int mod = 1000000007;
	
	public static long sumFloorFraction(long a, long b, long n)
	{
		if(b == 0)throw new ArithmeticException();
		if(a == 0 || n == 0)return 0L;
		
		
		// gcd(a,b)=1
		long g = gcd(a, b);
		a /= g; b /= g;
		long S = 0;
		
		int h = 0;
		while(a != 0 && n != 0){
			if(a >= b){
				S += a/b%mod*(n*(n-1)/2%mod);
				S %= mod;
				a %= b;
				if(a == 0)break;
			}
			if(n >= b){
				S += ((n/b)*(n/b-1)/2%mod)*a%mod*b + (a-1)*(b-1)/2%mod*(n/b) + (n/b)*a%mod*(n%b); // under_block + diagonal_block + last_under_block
				S %= mod;
				n %= b;
				if(n == 0)break;
			}
			
			// TODO
			S += (b-1)*(a-1)/2-(b-n)*(a*(n-1)/b%mod); // all-rectangle
			S %= mod;
			n = a-a*(n-1)/b;
			long d = a; a = b; b = d;
			S = -S; // flipped from then on
			h++;
		}
		return h % 2 == 0 ? S : -S;
	}

	
	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