結果

問題 No.896 友達以上恋人未満
ユーザー uwiuwi
提出日時 2019-09-27 22:03:24
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,689 ms / 3,500 ms
コード長 4,088 bytes
コンパイル時間 5,444 ms
コンパイル使用メモリ 80,108 KB
実行使用メモリ 187,768 KB
最終ジャッジ日時 2023-10-24 19:23:29
合計ジャッジ時間 11,744 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
53,248 KB
testcase_01 AC 50 ms
53,320 KB
testcase_02 AC 48 ms
53,312 KB
testcase_03 AC 48 ms
53,312 KB
testcase_04 AC 48 ms
53,304 KB
testcase_05 AC 449 ms
89,296 KB
testcase_06 AC 630 ms
89,236 KB
testcase_07 AC 454 ms
89,292 KB
testcase_08 AC 470 ms
74,048 KB
testcase_09 AC 1,175 ms
122,128 KB
testcase_10 AC 2,689 ms
187,768 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 E2 {
	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];
		
		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 = 1;i <= mod;i++) {
			long s = 0;
			for(int j = i;j <= mod;j+=i) {
				s += f[j];
			}
			f[i] = s;
		}
		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);
	}
	
	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 E2().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