結果
問題 | No.896 友達以上恋人未満 |
ユーザー | uwi |
提出日時 | 2019-09-27 22:40:56 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 857 ms / 3,500 ms |
コード長 | 5,511 bytes |
コンパイル時間 | 3,886 ms |
コンパイル使用メモリ | 80,772 KB |
実行使用メモリ | 190,484 KB |
最終ジャッジ日時 | 2024-09-24 23:42:45 |
合計ジャッジ時間 | 7,567 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
50,004 KB |
testcase_01 | AC | 51 ms
49,892 KB |
testcase_02 | AC | 55 ms
50,284 KB |
testcase_03 | AC | 53 ms
50,236 KB |
testcase_04 | AC | 53 ms
50,240 KB |
testcase_05 | AC | 307 ms
89,076 KB |
testcase_06 | AC | 506 ms
87,172 KB |
testcase_07 | AC | 308 ms
88,492 KB |
testcase_08 | AC | 315 ms
88,496 KB |
testcase_09 | AC | 534 ms
122,064 KB |
testcase_10 | AC | 857 ms
190,484 KB |
ソースコード
package contest190927; 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 E3 { InputStream is; PrintWriter out; // String INPUT = ""; String INPUT = ""; void solve() { int m = ni(), n = ni(); long mulx = ni(), addx = ni(), muly = ni(), addy = ni(); int mod = ni(); int[] x = na(m); int[] y = na(m); int[] a = na(m); int[] b = na(m); long[] f = new long[mod+1]; for(int i = 0;i < m;i++)f[x[i]] += y[i]; int[] primes = sieveEratosthenes(mod); long px = x[m-1], py = y[m-1]; for(int i = m;i < n;i++) { long nx = (px*mulx+addx) &mod-1; long ny = (py*muly+addy) &mod-1; f[(int)nx] += ny; px = nx; py = ny; } for(int i = primes.length-1;i >= 0;i--) { int p = primes[i]; for(int j = mod/p;j > 0;j--) { f[j] += f[j*p]; } } f[0] = f[1]; long ans = 0; for(int i = 0;i < m;i++) { long la = f[a[i]] - ((long)a[i]*b[i] <= mod ? f[a[i]*b[i]] : 0); out.println(la); ans ^= la; } long pa = a[m-1], pb = b[m-1]; for(int i = m;i < n;i++) { long na = ((pa*mulx+addx+mod-1) &mod-1)+1; long nb = ((pb*muly+addy+mod-1) &mod-1)+1; pb = nb; pa = na; ans ^= f[(int)pa] - ((long)pa*pb <= mod ? f[(int)(pa*pb)] : 0); } out.println(ans); } public static int[] sieveEratosthenes(int n) { if (n <= 32) { int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 }; for (int i = 0; i < primes.length; i++) { if (n < primes[i]) { return Arrays.copyOf(primes, i); } } return primes; } int u = n + 32; double lu = Math.log(u); int[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)]; ret[0] = 2; int pos = 1; int[] isnp = new int[(n + 1) / 32 / 2 + 1]; int sup = (n + 1) / 32 / 2 + 1; int[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 }; for (int tp : tprimes) { ret[pos++] = tp; int[] ptn = new int[tp]; for (int i = (tp - 3) / 2; i < tp << 5; i += tp) ptn[i >> 5] |= 1 << (i & 31); for (int j = 0; j < sup; j += tp) { for (int i = 0; i < tp && i + j < sup; i++) { isnp[j + i] |= ptn[i]; } } } // 3,5,7 // 2x+3=n int[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14 }; int h = n / 2; for (int i = 0; i < sup; i++) { for (int j = ~isnp[i]; j != 0; j &= j - 1) { int pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27]; int p = 2 * pp + 3; if (p > n) break; ret[pos++] = p; if ((long) p * p > n) continue; for (int q = (p * p - 3) / 2; q <= h; q += p) isnp[q >> 5] |= 1 << q; } } return Arrays.copyOf(ret, pos); } 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 E3().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)); } }