結果

問題 No.1233 割り切れない気持ち
ユーザー uwiuwi
提出日時 2020-09-19 11:04:36
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,518 bytes
コンパイル時間 3,737 ms
コンパイル使用メモリ 85,516 KB
実行使用メモリ 57,044 KB
最終ジャッジ日時 2023-09-05 12:40:31
合計ジャッジ時間 10,993 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 81 ms
53,612 KB
testcase_01 AC 82 ms
53,148 KB
testcase_02 AC 83 ms
53,288 KB
testcase_03 AC 82 ms
53,256 KB
testcase_04 AC 81 ms
53,948 KB
testcase_05 AC 82 ms
53,060 KB
testcase_06 AC 84 ms
53,900 KB
testcase_07 AC 101 ms
54,248 KB
testcase_08 AC 117 ms
54,432 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 112 ms
54,432 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 144 ms
54,768 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 146 ms
54,876 KB
testcase_21 AC 143 ms
54,828 KB
testcase_22 AC 132 ms
55,068 KB
testcase_23 AC 143 ms
55,016 KB
testcase_24 AC 134 ms
54,524 KB
testcase_25 AC 135 ms
54,336 KB
testcase_26 AC 138 ms
54,600 KB
testcase_27 AC 139 ms
54,988 KB
testcase_28 AC 133 ms
55,008 KB
testcase_29 AC 150 ms
54,932 KB
testcase_30 AC 148 ms
54,764 KB
testcase_31 AC 145 ms
54,936 KB
testcase_32 AC 136 ms
54,612 KB
testcase_33 AC 133 ms
55,072 KB
testcase_34 AC 136 ms
56,612 KB
testcase_35 AC 131 ms
54,600 KB
testcase_36 AC 135 ms
54,580 KB
testcase_37 AC 84 ms
53,364 KB
testcase_38 AC 131 ms
54,720 KB
testcase_39 WA -
testcase_40 WA -
権限があれば一括ダウンロードができます

ソースコード

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_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int D = 200001;
		int[] f = new int[D+5];
		for(int v : a) {
			f[v]++;
		}
		int[] cf = new int[D+5];
		long[] wcf = new long[D+5];
		for(int i = 0;i <= D;i++) {
			cf[i+1] = cf[i] + f[i];
			wcf[i+1] = wcf[i] + (long)i*f[i];
		}
		
		long ans = 0;
		for(int i = 1;i <= D;i++) {
			long lans = 0;
			for(int j = 0;i*j <= D;j++) {
				lans += wcf[Math.min(D, j*i+i)] - wcf[i*j] - (cf[Math.min(D, j*i+i)] - cf[i*j]) * j * i;
			}
			ans += lans * f[i];
		}
		out.println(ans);
	}

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