#544383 (Java21) No.1210 XOR Grid

提出ソース

結果

問題	No.1210 XOR Grid
ユーザー	CuriousFairy315
提出日時	2020-08-30 16:23:04
言語	Java21 (openjdk 21)
結果	RE
実行時間	-
コード長	9,184 bytes
コンパイル時間	3,247 ms
コンパイル使用メモリ	93,800 KB
実行使用メモリ	56,180 KB
最終ジャッジ日時	2024-11-15 11:06:49
合計ジャッジ時間	14,174 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	66 ms 50,912 KB
testcase_01	AC	69 ms 51,248 KB
testcase_02	AC	64 ms 50,600 KB
testcase_03	AC	64 ms 50,956 KB
testcase_04	AC	65 ms 51,244 KB
testcase_05	AC	65 ms 50,912 KB
testcase_06	AC	67 ms 50,768 KB
testcase_07	AC	65 ms 51,104 KB
testcase_08	AC	65 ms 51,148 KB
testcase_09	AC	66 ms 51,084 KB
testcase_10	AC	64 ms 50,972 KB
testcase_11	AC	65 ms 51,372 KB
testcase_12	AC	65 ms 50,828 KB
testcase_13	AC	65 ms 51,064 KB
testcase_14	AC	72 ms 51,300 KB
testcase_15	AC	73 ms 51,304 KB
testcase_16	AC	78 ms 51,116 KB
testcase_17	AC	68 ms 51,160 KB
testcase_18	AC	68 ms 51,092 KB
testcase_19	RE	-
testcase_20	AC	65 ms 37,496 KB
testcase_21	AC	64 ms 37,736 KB
testcase_22	AC	65 ms 37,928 KB
testcase_23	RE	-
testcase_24	AC	65 ms 38,044 KB
testcase_25	AC	229 ms 44,600 KB
testcase_26	RE	-
testcase_27	RE	-
testcase_28	AC	237 ms 44,644 KB
testcase_29	RE	-
testcase_30	AC	217 ms 44,272 KB
testcase_31	RE	-
testcase_32	AC	222 ms 44,728 KB
testcase_33	RE	-
testcase_34	AC	65 ms 38,092 KB
testcase_35	AC	66 ms 38,268 KB
testcase_36	AC	161 ms 43,760 KB
testcase_37	RE	-
testcase_38	RE	-
testcase_39	AC	162 ms 43,672 KB
testcase_40	AC	179 ms 43,684 KB
testcase_41	RE	-
testcase_42	AC	256 ms 44,808 KB
testcase_43	AC	255 ms 44,880 KB
testcase_44	AC	257 ms 44,940 KB
testcase_45	RE	-
testcase_46	AC	274 ms 44,936 KB
testcase_47	AC	198 ms 46,780 KB
testcase_48	AC	195 ms 46,480 KB
testcase_49	AC	71 ms 38,212 KB
testcase_50	AC	234 ms 46,088 KB
testcase_51	AC	246 ms 44,852 KB
testcase_52	RE	-
testcase_53	AC	250 ms 44,868 KB
testcase_54	RE	-
testcase_55	AC	252 ms 48,072 KB
testcase_56	AC	230 ms 44,448 KB
testcase_57	AC	220 ms 48,272 KB
testcase_58	AC	70 ms 38,072 KB
testcase_59	AC	65 ms 37,992 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code


import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.BitSet;
import java.util.NoSuchElementException;

public class Main {

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

	public Main() {
		InputChecker ic = new InputChecker(System.in);
		java.io.PrintWriter out = new java.io.PrintWriter(System.out);
		solve(ic, out);
		out.flush();
	}

	public void solve(InputChecker ic, java.io.PrintWriter out) {
		int N = ic.nextInt(1, exponent10(2, 5));
		ic.nextChar(' ');
		int M = ic.nextInt(1, exponent10(2, 5));
		ic.nextChar(' ');
		int X = ic.nextInt(1, 60);
		ic.readNewLine();
		long[] A = new long[N], B = new long[N];
		A[0] = ic.nextLong(0, pow(2L, X) - 1);
		for (int i = 1;i < N;++ i) {
			ic.nextChar(' ');
			A[i]  = ic.nextLong(0, pow(2L, X) - 1);
		}
		ic.readNewLine();
		B[0] =ic.nextLong(0, pow(2L, X) - 1);
		for (int i = 1;i < M;++ i) {
			ic.nextChar(' ');
			B[i]  = ic.nextLong(0, pow(2L, X) - 1);
		}
		ic.readNewLine();
		ic.checkEOF();
		if (Arrays.stream(A).reduce(0, (l, r) -> l ^ r) != Arrays.stream(B).reduce(0, (l, r) -> l ^ r)) {
			out.println(0);
		} else {
			final int MOD = 1_000_000_007;
			int ans = pow(2, X, MOD);
			ans = pow(ans, N - 1, MOD);
			ans = pow(ans, M - 1, MOD);
			out.println(ans);
		}

	}

	private int add(int a, int b, int mod) {
		return (a + b) % mod;
	}

	private int sub(int a, int b, int mod) {
		return (a - b + mod) % mod;
	}

	private int mul(int a, int b, int mod) {
		return (int)((long)a * b % mod);
	}

	private int div(int a, int b, int mod) {
		return mul(a, pow(b, mod - 2, mod), mod);
	}

	private int pow(int a, int b, int mod) {
		int ans = 1;
		for (int mul = a;b > 0;b >>= 1, mul = mul(mul, mul, mod)) if ((b & 1) != 0) ans = mul(ans, mul, mod);
		return ans;
	}

	public static int exponent10(int n, int e) {
		return n * pow(10, e);
	}

	public static long exponent10L(int n, int e) {
		return n * pow(10L, e);
	}

	public static int pow(int a, int b) {
		int ans = 1;
		for (int mul = a;b > 0;b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
		return ans;
	}

	public static long pow(long a, long b) {
		long ans = 1;
		for (long mul = a;b > 0;b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
		return ans;
	}

	public static class CharSet {
		private final BitSet set = new BitSet(256);

		public void add(char... c) {
			for (char i : c) set.set(i);
		}

		public void add(CharSet... s) {
			for (CharSet i : s) set.or(i.set);
		}

		public boolean contains(char... c) {
			for (char i : c) if (!set.get(i)) return false;
			return true;
	 	}

		public boolean contains(String s) {
			return contains(s.toCharArray());
	 	}

		private static final class Chars extends CharSet {
			public Chars(char... c) {
				super.add(c);
			}
			public Chars(CharSet... s) {
				super.add(s);
			}
			@Override
			public void add(char... c) {
				throw new UnsupportedOperationException();
			}
			@Override
			public void add(CharSet... s) {
				throw new UnsupportedOperationException();
			}
		}

		public static final CharSet NUMBER = new Chars('0','1','2','3','4','5','6','7','8','9');
		public static final CharSet LOWER = new Chars('a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z');
		public static final CharSet UPPER = new Chars('A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z');
		public static final CharSet ALPHABET = new Chars(LOWER, UPPER);

	}
	public static class InputChecker {
		private InputStream in;
		private final byte[] buffer = new byte[1024];
		private final byte[] undo = new byte[1024];
		private int undoSize = 0;
		private int read = 0;
		private int length = 0;

		public InputChecker(InputStream in) {
			this.in = in;
		}

		public final void setInputStream(InputStream in) {
			this.in = in;
		}

		public final void setInputStream(File in) {
			try {
				this.in = new FileInputStream(in);
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
		}

		private boolean hasNextByte() {
			if (undoSize > 0) return true;
			if (read < length) return true;
			read = 0;
			try {
				length = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			return length > 0;
		}

		private byte readByte() {
			if (hasNextByte()) return undoSize > 0 ? undo[--undoSize] : buffer[read++];
			throw new NoSuchElementException();
		}

		private void undo(byte b) {
			undo[undoSize ++] = b;
		}

		private void undo(char c) {
			if ((c & 0xFF80) == 0) {
				undo((byte)c);
				return;
			}
			undo((byte)(c & 0x3F | 0x80));
			if ((c & 0xF800) == 0) {
				undo((byte)(c >> 6 & 0x1F | 0xC0));
			} else {
				undo((byte)(c >> 6 & 0x3F | 0x80));
				undo((byte)(c >> 12 | 0xE0));
			}
		}

		public final boolean hasNext() {
			return hasNextByte();
		}

		public final char nextChar() {
			byte b = readByte();
			if ((b & 0x80) == 0) return (char)b;
			if ((b & 0x20) == 0) return (char)((b & 0x1F) << 6 | (readByte() & 0x3F));
			return (char)((b & 0xF) << 12 | (readByte() & 0x3F) << 6 | (readByte() & 0x3F));
		}

		public final char nextChar(char estimate) {
			char c = nextChar();
			if (estimate == c) return estimate;
			undo(c);
			throw new AssertionError();
		}

		public final char nextChar(CharSet estimate) {
			char c = nextChar();
			if (estimate.contains(c)) return c;
			undo(c);
			throw new AssertionError();
		}

		public final void readNewLine() {
			char c = nextChar();
			if (c == '\r') {
				c = nextChar();
				if (c != '\n') undo(c);
				return;
			} else if (c == '\n') return;
			undo(c);
			throw new AssertionError();
		}

		public final void checkEOF() {
			if (hasNextByte()) throw new AssertionError();
		}

		public final String next(CharSet contains) {
			StringBuilder sb = new StringBuilder();
			try {
				do {
					char c = nextChar();
					if (!contains.contains(c)) {
						undo(c);
						return sb.toString();
					}
					sb.append(c);
				} while(true);
			} catch (NoSuchElementException e) {
				if (sb.length() <= 0) throw new AssertionError();
				return sb.toString();
			}
		}

		public final int nextInt() {
			byte b = readByte();
			int n = 0;
			if (b == '-') {
				if (!isNumber(b = readByte())) {
					undo(b);
					throw new NumberFormatException();
				}
				try {
					if (b == '0') {
						if (!isNumber(b = readByte())) {
							undo(b);
							return 0;
						}
						throw new NumberFormatException();
					}
					do n = Math.addExact(Math.multiplyExact(n, 10), '0' - b); while(isNumber(b = readByte()));
					undo(b);
				} catch (NoSuchElementException e) {
				}
				return n;
			}
			if (!isNumber(b)) {
				undo(b);
				throw new NumberFormatException();
			}
			try {
				if (b == '0') {
					if (!isNumber(b = readByte())) {
						undo(b);
						return 0;
					}
					throw new NumberFormatException();
				}
				do n = Math.addExact(Math.multiplyExact(n, 10), b - '0'); while(isNumber(b = readByte()));
				undo(b);
			} catch (NoSuchElementException e) {
			}
			return n;
		}

		public final int nextInt(int min, int max) {
			int n = nextInt();
			if (min <= n && n <= max) return n;
			throw new NumberFormatException();
		}

		private static boolean isNumber(byte c) {
			return '0' <= c && c <= '9';
		}

		public final long nextLong() {
			byte b = readByte();
			long n = 0;
			if (b == '-') {
				if (!isNumber(b = readByte())) {
					undo(b);
					throw new NumberFormatException();
				}
				try {
					if (b == '0') {
						if (!isNumber(b = readByte())) {
							undo(b);
							return 0;
						}
						throw new NumberFormatException();
					}
					do n = Math.addExact(Math.multiplyExact(n, 10), '0' - b); while(isNumber(b = readByte()));
					undo(b);
				} catch (NoSuchElementException e) {
				}
				return n;
			}
			if (!isNumber(b)) {
				undo(b);
				throw new NumberFormatException();
			}
			try {
				if (b == '0') {
					if (!isNumber(b = readByte())) {
						undo(b);
						return 0;
					}
					throw new NumberFormatException();
				}
				do n = Math.addExact(Math.multiplyExact(n, 10), b - '0'); while(isNumber(b = readByte()));
				undo(b);
			} catch (NoSuchElementException e) {
			}
			return n;
		}

		public final long nextLong(long min, long max) {
			long n = nextLong();
			if (min <= n && n <= max) return n;
			throw new NumberFormatException();
		}

		public final double nextDouble() {
			StringBuilder sb = new StringBuilder();
			byte b = readByte();
			if (b == '-') {
				sb.append(b);
				b = readByte();
			}
			if (b == '0') {
				sb.append(b);
				b = readByte();
			} else {
				while(isNumber(b)) {
					sb.append(b);
					b = readByte();
				}
			}
			if (b == '.') {
				sb.append(b);
				b = readByte();
				while(isNumber(b)) {
					sb.append(b);
					b = readByte();
				}
			}
			if (b == 'e' || b == 'E') {
				sb.append(b);
				b = readByte();
				if (b == '-' || b == '+') {
					sb.append(b);
					b = readByte();
				}
				while(isNumber(b)) {
					sb.append(b);
					b = readByte();
				}
			}
			undo(b);
			return Double.parseDouble(sb.toString());
		}
	}
}

yukicoder

結果

テストケース

ソースコード