結果
問題 | No.1036 Make One With GCD 2 |
ユーザー | 37zigen |
提出日時 | 2020-05-11 12:30:39 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,619 bytes |
コンパイル時間 | 5,362 ms |
コンパイル使用メモリ | 76,204 KB |
実行使用メモリ | 69,204 KB |
最終ジャッジ日時 | 2023-09-25 10:30:37 |
合計ジャッジ時間 | 29,222 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 958 ms
67,600 KB |
testcase_01 | AC | 436 ms
69,172 KB |
testcase_02 | AC | 1,484 ms
69,204 KB |
testcase_03 | AC | 241 ms
57,672 KB |
testcase_04 | AC | 327 ms
61,396 KB |
testcase_05 | AC | 43 ms
49,028 KB |
testcase_06 | AC | 43 ms
48,968 KB |
testcase_07 | AC | 263 ms
57,976 KB |
testcase_08 | AC | 240 ms
57,760 KB |
testcase_09 | AC | 692 ms
67,172 KB |
testcase_10 | AC | 649 ms
61,480 KB |
testcase_11 | AC | 709 ms
68,952 KB |
testcase_12 | AC | 644 ms
62,080 KB |
testcase_13 | AC | 964 ms
62,212 KB |
testcase_14 | AC | 978 ms
67,632 KB |
testcase_15 | AC | 912 ms
62,288 KB |
testcase_16 | AC | 955 ms
62,228 KB |
testcase_17 | AC | 935 ms
62,164 KB |
testcase_18 | AC | 51 ms
49,132 KB |
testcase_19 | AC | 71 ms
51,388 KB |
testcase_20 | AC | 63 ms
50,904 KB |
testcase_21 | AC | 63 ms
51,484 KB |
testcase_22 | AC | 892 ms
61,776 KB |
testcase_23 | AC | 716 ms
61,980 KB |
testcase_24 | AC | 966 ms
62,140 KB |
testcase_25 | AC | 893 ms
62,104 KB |
testcase_26 | AC | 928 ms
62,300 KB |
testcase_27 | AC | 42 ms
49,256 KB |
testcase_28 | AC | 42 ms
47,040 KB |
testcase_29 | AC | 42 ms
49,348 KB |
testcase_30 | AC | 42 ms
49,160 KB |
testcase_31 | AC | 47 ms
49,032 KB |
testcase_32 | AC | 45 ms
49,112 KB |
testcase_33 | AC | 43 ms
49,104 KB |
testcase_34 | AC | 44 ms
49,288 KB |
testcase_35 | AC | 42 ms
49,060 KB |
testcase_36 | AC | 42 ms
49,628 KB |
testcase_37 | AC | 43 ms
49,020 KB |
testcase_38 | TLE | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
ソースコード
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) { if (a>b) return gcd(b,a); if (a==0) return b; if (a%2==0 && b%2==0) return 2*gcd(a/2,b/2); if (a%2==0) return gcd(a/2,b); if (b%2==0) return gcd(a,b/2); return 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());} }