結果

問題 No.1233 割り切れない気持ち
ユーザー uwiuwi
提出日時 2020-09-19 10:50:18
言語 Java21
(openjdk 21)
結果
AC  
実行時間 484 ms / 3,153 ms
コード長 4,161 bytes
コンパイル時間 4,029 ms
コンパイル使用メモリ 91,020 KB
実行使用メモリ 43,500 KB
最終ジャッジ日時 2024-06-23 08:00:44
合計ジャッジ時間 14,223 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
36,700 KB
testcase_01 AC 50 ms
36,364 KB
testcase_02 AC 52 ms
36,776 KB
testcase_03 AC 54 ms
37,464 KB
testcase_04 AC 53 ms
36,752 KB
testcase_05 AC 50 ms
37,040 KB
testcase_06 AC 50 ms
36,396 KB
testcase_07 AC 234 ms
40,848 KB
testcase_08 AC 244 ms
41,856 KB
testcase_09 AC 395 ms
43,248 KB
testcase_10 AC 362 ms
42,308 KB
testcase_11 AC 171 ms
40,048 KB
testcase_12 AC 476 ms
43,476 KB
testcase_13 AC 448 ms
43,500 KB
testcase_14 AC 484 ms
43,104 KB
testcase_15 AC 459 ms
42,884 KB
testcase_16 AC 472 ms
43,332 KB
testcase_17 AC 104 ms
41,300 KB
testcase_18 AC 421 ms
42,336 KB
testcase_19 AC 113 ms
40,820 KB
testcase_20 AC 109 ms
40,872 KB
testcase_21 AC 136 ms
42,364 KB
testcase_22 AC 144 ms
42,108 KB
testcase_23 AC 140 ms
42,044 KB
testcase_24 AC 142 ms
42,472 KB
testcase_25 AC 140 ms
42,776 KB
testcase_26 AC 142 ms
42,128 KB
testcase_27 AC 146 ms
42,176 KB
testcase_28 AC 156 ms
42,676 KB
testcase_29 AC 151 ms
42,752 KB
testcase_30 AC 148 ms
42,692 KB
testcase_31 AC 145 ms
42,528 KB
testcase_32 AC 139 ms
42,480 KB
testcase_33 AC 149 ms
41,948 KB
testcase_34 AC 142 ms
42,952 KB
testcase_35 AC 144 ms
42,056 KB
testcase_36 AC 146 ms
41,600 KB
testcase_37 AC 50 ms
36,856 KB
testcase_38 AC 101 ms
40,852 KB
testcase_39 AC 281 ms
42,488 KB
testcase_40 AC 273 ms
42,876 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 No1233 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		Arrays.sort(a);
		long[] cum = new long[n+1];
		for(int i = 0;i < n;i++){
			cum[i+1] = cum[i] + a[i];
		}
		long ans = 0;
		long t = 0;
		for(int i = 0;i < n;i++){
			if(i > 0 && a[i-1] == a[i]) {
				ans += t;
			}else {
				t = 0;
				int l = 0;
				while(l < n) {
					int r = lowerBound(a, (a[l] / a[i] + 1) * a[i]);
					int u = a[l] / a[i];
					t += (cum[r] - cum[l]) - (long) u * (r - l) * a[i];
					l = r;
				}
				ans += t;
			}
		}
		out.println(ans);
	}

	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
	{
//		int n = 200000, m = 99999;
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		for (int i = 0; i < n/2; i++) {
//			sb.append(1 + " ");
//		}
//		for (int i = 0; i < n/2; i++) {
//			sb.append((n-i*2+1)*2 + " ");
//		}
//		INPUT = sb.toString();

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