結果
問題 | No.1404 誕生日プレゼント |
ユーザー | 37zigen |
提出日時 | 2021-05-10 05:21:40 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,249 ms / 3,153 ms |
コード長 | 5,195 bytes |
コンパイル時間 | 2,874 ms |
コンパイル使用メモリ | 83,892 KB |
実行使用メモリ | 77,268 KB |
最終ジャッジ日時 | 2023-10-19 13:07:03 |
合計ジャッジ時間 | 51,545 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 106 ms
56,416 KB |
testcase_01 | AC | 72 ms
54,524 KB |
testcase_02 | AC | 104 ms
53,108 KB |
testcase_03 | AC | 162 ms
54,796 KB |
testcase_04 | AC | 183 ms
56,840 KB |
testcase_05 | AC | 198 ms
57,012 KB |
testcase_06 | AC | 238 ms
57,728 KB |
testcase_07 | AC | 244 ms
57,700 KB |
testcase_08 | AC | 244 ms
57,728 KB |
testcase_09 | AC | 272 ms
58,172 KB |
testcase_10 | AC | 287 ms
58,148 KB |
testcase_11 | AC | 284 ms
58,052 KB |
testcase_12 | AC | 335 ms
60,812 KB |
testcase_13 | AC | 1,234 ms
77,260 KB |
testcase_14 | AC | 1,227 ms
77,256 KB |
testcase_15 | AC | 1,218 ms
77,252 KB |
testcase_16 | AC | 1,220 ms
77,256 KB |
testcase_17 | AC | 1,227 ms
77,252 KB |
testcase_18 | AC | 1,225 ms
77,264 KB |
testcase_19 | AC | 1,227 ms
77,260 KB |
testcase_20 | AC | 1,225 ms
77,240 KB |
testcase_21 | AC | 1,236 ms
77,268 KB |
testcase_22 | AC | 1,220 ms
77,260 KB |
testcase_23 | AC | 149 ms
56,692 KB |
testcase_24 | AC | 140 ms
56,692 KB |
testcase_25 | AC | 155 ms
56,580 KB |
testcase_26 | AC | 383 ms
63,852 KB |
testcase_27 | AC | 122 ms
56,076 KB |
testcase_28 | AC | 1,249 ms
77,212 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.ArrayList; import java.util.Arrays; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) { new Main().run(); } long pow(long a, long n) { return n!=0?pow(a*a%p,n/2)*(n%2==1?a:1)%p : 1; } long inv(long a) { return pow(a,p-2); } class Pair { long u, v; public Pair(long u, long v) { this.u=u; this.v=v; } @Override public String toString() { return "1 "+(u+1)+" "+(v+1); } } void add(ArrayList<Pair> ans, long[] A, int i, int j) { A[i]=(A[i]+A[j])%p; ans.add(new Pair(i, j)); } // A[t] == B[t] に 18*2 step でする。 void solve2(ArrayList<Pair> ans, long[] A, long[] B, int s, int t) { long a=A[t], a2=A[s]; long b=B[t]; assert(a!=0 && A[s]==B[s]); long x; if (a==0) x=p; else { long c=a2*inv(a)%p; x=inv(c)*(b*inv(a)%p+p-pow(2,17))%p; } for (int shift=17;shift>=0;--shift) { if ((x>>shift)%2==1) add(ans, A, t, s); if (shift>0) add(ans, A, t, t); } assert(A[t]==B[t]); } final long p=223577; void run() { FastScanner sc = new FastScanner(); int N=sc.nextInt(); sc.nextLong(); long[] A=new long[N]; long[] B=new long[N]; for (int i=0;i<N;++i) A[i]=sc.nextLong(); for (int i=0;i<N;++i) B[i]=sc.nextLong(); boolean za=Arrays.stream(A).allMatch(x->x==0); boolean zb=Arrays.stream(B).allMatch(x->x==0); if (za||zb) { if (za) { System.out.println(zb?0:-1); } else { System.out.println(za?0:-1); } } else if (N==1) { long a=A[0],b=B[0]; for (int i=0;i<p-1;++i) { if (pow(2,i)*a%p==b) { System.out.println(i+1); for (int j=0;j<i;++j) System.out.println(1+" "+1+" "+1); System.out.println(2); return; } } System.out.println(-1); } else { ArrayList<Pair> ans=new ArrayList<Main.Pair>(); int sqrtp=(int)Math.ceil(Math.sqrt(p)); if (N>2*sqrtp) { int s0=N-1; while (A[s0]==0) --s0; if (s0<2*sqrtp) { add(ans,A,2*sqrtp,s0); s0=2*sqrtp; } for (int shift=0;shift<=17;++shift) { for (int i=0;i<sqrtp;++i) { long x=((i+1)+p-A[i])*inv(A[s0])%p; if (x%2==1) add(ans, A, i, s0); } for (int i=sqrtp;i<2*sqrtp;++i) { long x=(sqrtp*(i-sqrtp+1)+p-A[i])*inv(A[s0])%p; if (x%2==1) add(ans, A, i, s0); } add(ans, A, s0, s0); } for (int i=2*sqrtp;i<N;++i) { long diff=(p+B[i]-A[i])%p; if (diff>=sqrtp) { add(ans, A, i, sqrtp-1+(int)(diff/sqrtp)); } diff %= sqrtp; if (diff>0) add(ans, A, i, (int)diff-1); assert(A[i]==B[i]); } } int s1=0; int s0=0; while (A[s0]==0) ++s0; while (B[s1]==0) ++s1; if (s0==s1) { int ns0=(s0+1)%N; if (A[ns0]==0) add(ans, A, ns0, s0); s0=ns0; } assert(A[s0]>0 && B[s1]>0 && s0 != s1); for (int shift=0;shift<=17;++shift) { for (int i=0;i<N;++i) { if (i!=s0) { // A[i]=B[i]-A[s]x // x=(B[i]-A[i])/A[s] long x=(B[i]+p-A[i])*inv(A[s0])%p; if (x%2==1) add(ans, A, i, s0); } } add(ans, A, s0, s0); } // A[s1] != 0 を仮定 solve2(ans, A, B, s1, s0); assert(Arrays.equals(A, B)); System.out.println(ans.size()+1); for (Pair query:ans) { System.out.println(query); } System.out.println(2); } } static 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()); } }