結果

問題 No.896 友達以上恋人未満
ユーザー 37zigen37zigen
提出日時 2018-03-01 13:47:27
言語 Java21
(openjdk 21)
結果
MLE  
実行時間 -
コード長 4,097 bytes
コンパイル時間 2,103 ms
コンパイル使用メモリ 74,388 KB
実行使用メモリ 319,032 KB
最終ジャッジ日時 2023-09-02 12:37:20
合計ジャッジ時間 10,140 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
48,992 KB
testcase_01 AC 46 ms
49,056 KB
testcase_02 AC 46 ms
49,104 KB
testcase_03 AC 45 ms
49,396 KB
testcase_04 AC 46 ms
49,604 KB
testcase_05 AC 601 ms
121,460 KB
testcase_06 AC 1,374 ms
120,980 KB
testcase_07 AC 633 ms
122,128 KB
testcase_08 AC 627 ms
121,120 KB
testcase_09 AC 1,239 ms
187,584 KB
testcase_10 MLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		FastScanner sc = new FastScanner();
		int M = (int) sc.nextLong();
		int N = (int) sc.nextLong();
		long mulX = sc.nextLong();
		long addX = sc.nextLong();
		long mulY = sc.nextLong();
		long addY = sc.nextLong();
		long MOD = sc.nextLong();
		long[] X = new long[M];
		long[] Y = new long[M];
		long[] A = new long[M];
		long[] B = new long[M];
		long[] z = new long[(int) MOD];
		for (int i = 0; i < M; ++i)
			X[i] = sc.nextLong();
		for (int i = 0; i < M; ++i)
			Y[i] = sc.nextLong();
		for (int i = 0; i < M; ++i)
			A[i] = sc.nextLong();
		for (int i = 0; i < M; ++i)
			B[i] = sc.nextLong();
		for (int i = 0; i < M; ++i) {
			add(z, X[i], Y[i]);
		}
		{
			long X_ = X[M - 1] & (MOD - 1);
			long Y_ = Y[M - 1] & (MOD - 1);
			long A_ = A[M - 1] & (MOD - 1);
			long B_ = B[M - 1] & (MOD - 1);
			for (int i = M; i < N; ++i) {
				X_ = X_ * mulX + addX & MOD - 1;
				Y_ = Y_ * mulY + addY & MOD - 1;
				A_ = ((A_ * mulX & MOD - 1) + addX + MOD - 1 & MOD - 1) + 1;
				B_ = ((B_ * mulY & MOD - 1) + addY + MOD - 1 & MOD - 1) + 1;
				add(z, X_, Y_);
			}
		}
		rec = new long[(int) MOD];
		Arrays.fill(rec, -1);
		long all = 0;

		{
			long X_ = X[M - 1] & (MOD - 1);
			long Y_ = Y[M - 1] & (MOD - 1);
			long A_ = A[M - 1] & (MOD - 1);
			long B_ = B[M - 1] & (MOD - 1);
			for (int i = M; i < N; ++i) {
				X_ = X_ * mulX + addX & MOD - 1;
				Y_ = Y_ * mulY + addY & MOD - 1;
				A_ = ((A_ * mulX & MOD - 1) + addX + MOD - 1 & MOD - 1) + 1;
				B_ = ((B_ * mulY & MOD - 1) + addY + MOD - 1 & MOD - 1) + 1;
				all ^= f(A_, z) - f(A_ * B_, z);
			}
		}

		PrintWriter pw = new PrintWriter(System.out);
		for (int i = 0; i < M; ++i) {
			long v = (f(A[i], z) - f(A[i] * B[i], z));
			pw.println(v);
			all ^= v;
		}
		pw.println(all);
		pw.close();
	}

	long f(long v, long[] z) {
		if (v >= z.length)
			return 0;
		if (rec[(int) v] != -1)
			return rec[(int) v];
		rec[(int) v] = 0;
		for (int j = (int) v; j < z.length; j += v) {
			rec[(int) v] += z[j];
		}
		return rec[(int) v];
	}

	long[] rec;

	void add(long[] arr, long idx, long v) {
		if (idx >= arr.length)
			return;
		arr[(int) idx] += v;
	}

	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 boolean isPrintableChar(int c) {
			return 33 <= c && c <= 126;
		}

		private void skipUnprintable() {
			while (hasNextByte() && !isPrintableChar(buffer[ptr]))
				ptr++;
		}

		public boolean hasNext() {
			skipUnprintable();
			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();
			}
		}
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}
0