結果

問題 No.937 Ultra Sword
ユーザー uwiuwi
提出日時 2019-11-29 22:24:12
言語 Java21
(openjdk 21)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 4,228 bytes
コンパイル時間 3,707 ms
コンパイル使用メモリ 84,360 KB
実行使用メモリ 52,836 KB
最終ジャッジ日時 2024-11-21 02:23:33
合計ジャッジ時間 11,335 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 78 ms
51,544 KB
testcase_01 WA -
testcase_02 AC 77 ms
51,292 KB
testcase_03 AC 77 ms
51,440 KB
testcase_04 AC 72 ms
51,300 KB
testcase_05 AC 123 ms
51,920 KB
testcase_06 AC 170 ms
52,320 KB
testcase_07 AC 144 ms
52,100 KB
testcase_08 AC 144 ms
52,288 KB
testcase_09 AC 136 ms
51,956 KB
testcase_10 AC 148 ms
52,348 KB
testcase_11 AC 113 ms
52,208 KB
testcase_12 AC 151 ms
52,228 KB
testcase_13 AC 156 ms
52,200 KB
testcase_14 AC 157 ms
52,380 KB
testcase_15 AC 146 ms
52,136 KB
testcase_16 AC 95 ms
51,488 KB
testcase_17 AC 95 ms
51,640 KB
testcase_18 AC 151 ms
52,320 KB
testcase_19 AC 135 ms
52,436 KB
testcase_20 AC 132 ms
52,700 KB
testcase_21 AC 136 ms
52,172 KB
testcase_22 AC 89 ms
51,432 KB
testcase_23 AC 84 ms
51,824 KB
testcase_24 AC 136 ms
52,012 KB
testcase_25 AC 140 ms
51,880 KB
testcase_26 AC 134 ms
52,836 KB
testcase_27 AC 145 ms
52,648 KB
testcase_28 AC 136 ms
52,316 KB
testcase_29 AC 91 ms
51,548 KB
testcase_30 AC 138 ms
52,188 KB
testcase_31 AC 148 ms
52,276 KB
testcase_32 AC 134 ms
52,224 KB
testcase_33 AC 141 ms
52,136 KB
testcase_34 AC 109 ms
52,292 KB
testcase_35 AC 93 ms
52,440 KB
testcase_36 AC 139 ms
52,380 KB
testcase_37 AC 96 ms
52,160 KB
testcase_38 AC 144 ms
52,004 KB
testcase_39 AC 91 ms
51,440 KB
testcase_40 AC 137 ms
52,480 KB
testcase_41 AC 130 ms
52,156 KB
testcase_42 AC 134 ms
51,900 KB
testcase_43 AC 135 ms
52,388 KB
testcase_44 AC 100 ms
51,796 KB
testcase_45 AC 119 ms
52,180 KB
testcase_46 AC 128 ms
52,324 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		
		long[] bas = new long[64];
		for(int v : a) {
			for(long y = v;y <= 1<<18;y*=2) {
				long x = y;
				int h = 63-Long.numberOfLeadingZeros(x);
				while(x != 0){
					if(bas[h] != 0){
						x ^= bas[h];
						h = 63-Long.numberOfLeadingZeros(x);
					}else{
						bas[h] = x;
					}
				}
			}
		}
		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(hasSolution(i, bas)) {
				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 F().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