#403522 (Java21) No.937 Ultra Sword

• 問題: No.937 Ultra Sword
• ユーザー: uwi
• 提出日時: 2019-12-01 06:17:44
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 176 ms / 3,000 ms
• コード長: 4,193 bytes
• コンパイル時間: 4,341 ms
• コンパイル使用メモリ: 82,932 KB
• 実行使用メモリ: 52,704 KB
• 最終ジャッジ日時: 2024-05-01 03:44:27
• 合計ジャッジ時間: 11,859 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	114 ms; 51,312 KB
testcase_01	AC	131 ms; 52,044 KB
testcase_02	AC	109 ms; 51,572 KB
testcase_03	AC	113 ms; 51,508 KB
testcase_04	AC	121 ms; 51,576 KB
testcase_05	AC	142 ms; 51,976 KB
testcase_06	AC	165 ms; 52,328 KB
testcase_07	AC	172 ms; 52,136 KB
testcase_08	AC	151 ms; 52,228 KB
testcase_09	AC	129 ms; 51,596 KB
testcase_10	AC	173 ms; 52,024 KB
testcase_11	AC	123 ms; 52,276 KB
testcase_12	AC	163 ms; 51,964 KB
testcase_13	AC	160 ms; 52,092 KB
testcase_14	AC	167 ms; 52,164 KB
testcase_15	AC	160 ms; 52,032 KB
testcase_16	AC	130 ms; 52,128 KB
testcase_17	AC	110 ms; 51,148 KB
testcase_18	AC	158 ms; 51,880 KB
testcase_19	AC	149 ms; 52,416 KB
testcase_20	AC	144 ms; 52,108 KB
testcase_21	AC	176 ms; 52,160 KB
testcase_22	AC	119 ms; 52,248 KB
testcase_23	AC	119 ms; 51,580 KB
testcase_24	AC	168 ms; 52,160 KB
testcase_25	AC	161 ms; 52,136 KB
testcase_26	AC	156 ms; 52,148 KB
testcase_27	AC	156 ms; 52,076 KB
testcase_28	AC	164 ms; 52,028 KB
testcase_29	AC	114 ms; 51,504 KB
testcase_30	AC	153 ms; 52,000 KB
testcase_31	AC	173 ms; 52,280 KB
testcase_32	AC	144 ms; 52,704 KB
testcase_33	AC	164 ms; 52,184 KB
testcase_34	AC	121 ms; 51,880 KB
testcase_35	AC	111 ms; 51,228 KB
testcase_36	AC	170 ms; 52,156 KB
testcase_37	AC	115 ms; 51,456 KB
testcase_38	AC	149 ms; 51,808 KB
testcase_39	AC	120 ms; 52,044 KB
testcase_40	AC	156 ms; 52,216 KB
testcase_41	AC	137 ms; 52,072 KB
testcase_42	AC	152 ms; 52,008 KB
testcase_43	AC	151 ms; 51,736 KB
testcase_44	AC	121 ms; 51,776 KB
testcase_45	AC	138 ms; 52,216 KB
testcase_46	AC	138 ms; 51,752 KB

ソースコード

package contest191129;
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 F2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	long f2gcd(long a, long b)
	{
		if(a < b) {
			long d = a; a = b; b = d;
		}
		while(b != 0) {
			long c = a ^ b * (Long.highestOneBit(a)/Long.highestOneBit(b));
			a = b; b = c;
		}
		return a;
	}
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		
		long g = a[0];
		for(int i = 1;i < n;i++)g = f2gcd(a[i], g);
		
		long[] f = new long[100005];
		for(int v : a) {
			f[v] += v;
		}
		for(int i = 1;i <= 100000;i++) {
			for(int j = i*2;j <= 100000;j+=i) {
				f[i] += f[j];
			}
		}
		long all = 0;
		for(int v : a)all += v;
		long ans = all;
		for(int i = 1;i <= 100000;i++) {
			if(f2gcd(i, g) == g) {
				ans = Math.min(ans, all - f[i] + f[i] / i);
			}
		}
		out.println(ans);
	}
	
	public static boolean hasSolution(long x, long[] bas)
	{
		int h = 63-Long.numberOfLeadingZeros(x);
		while(x != 0){
			if(bas[h] != 0){
				x ^= bas[h];
				h = 63-Long.numberOfLeadingZeros(x);
			}else{
				return false;
			}
		}
		return true;
	}

	
	
	
	void run() throws Exception
	{
//		int n = 100000, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		for (int i = 0; i < n; i++) {
//			sb.append(gen.nextInt(100000)+1 + " ");
//		}
//		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 F2().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)); }
}