結果

問題 No.1036 Make One With GCD 2
ユーザー uwiuwi
提出日時 2020-04-24 21:33:09
言語 Java21
(openjdk 21)
結果
AC  
実行時間 893 ms / 2,000 ms
コード長 3,804 bytes
コンパイル時間 4,390 ms
コンパイル使用メモリ 91,096 KB
実行使用メモリ 47,752 KB
最終ジャッジ日時 2024-09-16 13:11:21
合計ジャッジ時間 18,628 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 238 ms
47,584 KB
testcase_01 AC 184 ms
47,352 KB
testcase_02 AC 198 ms
47,368 KB
testcase_03 AC 135 ms
44,504 KB
testcase_04 AC 158 ms
46,076 KB
testcase_05 AC 50 ms
37,104 KB
testcase_06 AC 50 ms
36,712 KB
testcase_07 AC 169 ms
44,876 KB
testcase_08 AC 143 ms
44,836 KB
testcase_09 AC 350 ms
47,268 KB
testcase_10 AC 320 ms
46,804 KB
testcase_11 AC 334 ms
47,648 KB
testcase_12 AC 317 ms
47,196 KB
testcase_13 AC 497 ms
47,464 KB
testcase_14 AC 490 ms
47,420 KB
testcase_15 AC 493 ms
46,996 KB
testcase_16 AC 468 ms
47,084 KB
testcase_17 AC 500 ms
47,272 KB
testcase_18 AC 53 ms
36,840 KB
testcase_19 AC 54 ms
37,024 KB
testcase_20 AC 61 ms
37,588 KB
testcase_21 AC 57 ms
37,064 KB
testcase_22 AC 458 ms
47,044 KB
testcase_23 AC 394 ms
45,932 KB
testcase_24 AC 488 ms
47,096 KB
testcase_25 AC 455 ms
46,640 KB
testcase_26 AC 476 ms
47,440 KB
testcase_27 AC 52 ms
37,120 KB
testcase_28 AC 51 ms
36,844 KB
testcase_29 AC 53 ms
36,504 KB
testcase_30 AC 51 ms
36,496 KB
testcase_31 AC 51 ms
36,980 KB
testcase_32 AC 51 ms
36,504 KB
testcase_33 AC 51 ms
36,500 KB
testcase_34 AC 51 ms
36,812 KB
testcase_35 AC 50 ms
37,108 KB
testcase_36 AC 51 ms
36,532 KB
testcase_37 AC 52 ms
37,116 KB
testcase_38 AC 893 ms
47,464 KB
testcase_39 AC 210 ms
47,152 KB
testcase_40 AC 387 ms
45,936 KB
testcase_41 AC 216 ms
47,456 KB
testcase_42 AC 236 ms
47,260 KB
testcase_43 AC 257 ms
47,752 KB
testcase_44 AC 254 ms
47,616 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200424;
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();
		long[] a = new long[n];
		for(int i = 0;i < n;i++){
			a[i] = nl();
		}
		long ans= 0;
		long[][] gs = {};
		for(int i = 0;i < n;i++){
			long[][] nex = new long[gs.length+1][];
			int p = 0;
			for(int j = 0;j < gs.length;j++){
				long v = gcd(a[i], gs[j][0]);
				if(p > 0 && nex[p-1][0] == v){
					nex[p-1][1] += gs[j][1];
				}else{
					nex[p++] = new long[]{v, gs[j][1]};
				}
			}
			{
				long v = a[i];
				if(p > 0 && nex[p-1][0] == v){
					nex[p-1][1] += 1;
				}else{
					nex[p++] = new long[]{v, 1};
				}
			}
			gs = Arrays.copyOf(nex, p);
			if(gs.length > 0 && gs[0][0] == 1){
				ans += gs[0][1];
			}
		}
		out.println(ans);
	}
	
	public static long gcd(long a, long b) {
		while (b > 0) {
			long c = a;
			a = b;
			b = c % b;
		}
		return a;
	}
	
	
	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