結果
問題 | No.1036 Make One With GCD 2 |
ユーザー | 37zigen |
提出日時 | 2020-05-11 12:25:38 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,529 ms / 2,000 ms |
コード長 | 3,463 bytes |
コンパイル時間 | 3,723 ms |
コンパイル使用メモリ | 74,556 KB |
実行使用メモリ | 69,580 KB |
最終ジャッジ日時 | 2023-10-14 20:29:44 |
合計ジャッジ時間 | 27,507 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 856 ms
68,980 KB |
testcase_01 | AC | 441 ms
68,796 KB |
testcase_02 | AC | 538 ms
68,824 KB |
testcase_03 | AC | 189 ms
56,788 KB |
testcase_04 | AC | 258 ms
61,200 KB |
testcase_05 | AC | 42 ms
49,156 KB |
testcase_06 | AC | 42 ms
49,040 KB |
testcase_07 | AC | 231 ms
57,184 KB |
testcase_08 | AC | 205 ms
56,784 KB |
testcase_09 | AC | 587 ms
67,304 KB |
testcase_10 | AC | 557 ms
61,612 KB |
testcase_11 | AC | 597 ms
69,132 KB |
testcase_12 | AC | 555 ms
61,180 KB |
testcase_13 | AC | 773 ms
61,864 KB |
testcase_14 | AC | 777 ms
66,596 KB |
testcase_15 | AC | 726 ms
61,948 KB |
testcase_16 | AC | 734 ms
61,680 KB |
testcase_17 | AC | 751 ms
61,864 KB |
testcase_18 | AC | 47 ms
49,152 KB |
testcase_19 | AC | 57 ms
50,808 KB |
testcase_20 | AC | 71 ms
51,036 KB |
testcase_21 | AC | 60 ms
51,044 KB |
testcase_22 | AC | 713 ms
61,736 KB |
testcase_23 | AC | 567 ms
62,132 KB |
testcase_24 | AC | 734 ms
62,308 KB |
testcase_25 | AC | 690 ms
62,176 KB |
testcase_26 | AC | 722 ms
61,760 KB |
testcase_27 | AC | 42 ms
49,044 KB |
testcase_28 | AC | 41 ms
49,152 KB |
testcase_29 | AC | 41 ms
49,040 KB |
testcase_30 | AC | 41 ms
49,128 KB |
testcase_31 | AC | 43 ms
49,292 KB |
testcase_32 | AC | 45 ms
49,144 KB |
testcase_33 | AC | 42 ms
49,140 KB |
testcase_34 | AC | 44 ms
49,084 KB |
testcase_35 | AC | 41 ms
49,020 KB |
testcase_36 | AC | 41 ms
49,424 KB |
testcase_37 | AC | 42 ms
49,208 KB |
testcase_38 | AC | 533 ms
69,012 KB |
testcase_39 | AC | 1,529 ms
69,348 KB |
testcase_40 | AC | 569 ms
61,976 KB |
testcase_41 | AC | 1,027 ms
69,580 KB |
testcase_42 | AC | 1,016 ms
69,100 KB |
testcase_43 | AC | 982 ms
69,148 KB |
testcase_44 | AC | 1,014 ms
68,716 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.NoSuchElementException; public class Main{ public static void main(String[] args) { new Main().run(); } class SegTree { int n=1; long[] v; public SegTree(int n) { while (this.n<n) this.n*=2; v=new long[2*this.n]; } void setVal(int k,long val) { k+=n; v[k]=val; while (k!=1) { k/=2; v[k]=gcd(v[2*k],v[2*k+1]); } } long query(int a,int b) { return query(1,n+1,a+1,b+1,1); } long query(int l,int r,int a,int b,int k) { if (r<=a||b<=l) { return 0; } else if (a<=l&&r<=b) { return v[k]; } else { long vl=query(l,(l+r)/2,a,b,2*k); long vr=query((l+r)/2,r,a,b,2*k+1); return gcd(vl,vr); } } } long gcd(long a,long b) { return a==0?b:gcd(b%a,a); } void run() { FastScanner sc=new FastScanner(); int N=sc.nextInt(); long[] A=new long[N]; SegTree seg=new SegTree(N+1); for (int i=0;i<N;++i) { A[i]=sc.nextLong(); seg.setVal(i, A[i]); } long ans=0; int t=0; for (int s=0;s<N;++s) { t=Math.max(t, s); long cur=seg.query(s, t); while (cur!=1 && t<N) { cur=gcd(cur,A[t++]); } if (cur==1) { ans+=N-(t-1); } } System.out.println(ans); } void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));} } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next());} }