結果
問題 | No.1210 XOR Grid |
ユーザー | CuriousFairy315 |
提出日時 | 2020-08-30 16:29:35 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 235 ms / 2,000 ms |
コード長 | 9,184 bytes |
コンパイル時間 | 3,932 ms |
コンパイル使用メモリ | 101,060 KB |
実行使用メモリ | 59,616 KB |
最終ジャッジ日時 | 2023-08-09 15:18:16 |
合計ジャッジ時間 | 13,113 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
50,932 KB |
testcase_01 | AC | 54 ms
50,548 KB |
testcase_02 | AC | 54 ms
50,672 KB |
testcase_03 | AC | 56 ms
50,548 KB |
testcase_04 | AC | 55 ms
50,540 KB |
testcase_05 | AC | 55 ms
50,468 KB |
testcase_06 | AC | 55 ms
50,612 KB |
testcase_07 | AC | 55 ms
48,648 KB |
testcase_08 | AC | 55 ms
50,468 KB |
testcase_09 | AC | 55 ms
50,552 KB |
testcase_10 | AC | 55 ms
50,624 KB |
testcase_11 | AC | 55 ms
50,552 KB |
testcase_12 | AC | 57 ms
50,636 KB |
testcase_13 | AC | 56 ms
50,608 KB |
testcase_14 | AC | 56 ms
50,668 KB |
testcase_15 | AC | 57 ms
50,536 KB |
testcase_16 | AC | 56 ms
50,616 KB |
testcase_17 | AC | 57 ms
50,552 KB |
testcase_18 | AC | 56 ms
50,532 KB |
testcase_19 | AC | 57 ms
50,672 KB |
testcase_20 | AC | 56 ms
50,652 KB |
testcase_21 | AC | 57 ms
50,540 KB |
testcase_22 | AC | 56 ms
50,552 KB |
testcase_23 | AC | 56 ms
50,732 KB |
testcase_24 | AC | 58 ms
50,620 KB |
testcase_25 | AC | 186 ms
55,584 KB |
testcase_26 | AC | 179 ms
55,260 KB |
testcase_27 | AC | 161 ms
54,404 KB |
testcase_28 | AC | 178 ms
55,600 KB |
testcase_29 | AC | 174 ms
55,108 KB |
testcase_30 | AC | 155 ms
54,328 KB |
testcase_31 | AC | 163 ms
54,428 KB |
testcase_32 | AC | 165 ms
54,340 KB |
testcase_33 | AC | 57 ms
50,668 KB |
testcase_34 | AC | 57 ms
50,624 KB |
testcase_35 | AC | 58 ms
50,528 KB |
testcase_36 | AC | 131 ms
54,996 KB |
testcase_37 | AC | 134 ms
54,464 KB |
testcase_38 | AC | 133 ms
54,736 KB |
testcase_39 | AC | 135 ms
55,252 KB |
testcase_40 | AC | 155 ms
56,760 KB |
testcase_41 | AC | 170 ms
58,708 KB |
testcase_42 | AC | 233 ms
57,548 KB |
testcase_43 | AC | 220 ms
57,368 KB |
testcase_44 | AC | 227 ms
56,032 KB |
testcase_45 | AC | 235 ms
57,264 KB |
testcase_46 | AC | 234 ms
57,588 KB |
testcase_47 | AC | 181 ms
58,168 KB |
testcase_48 | AC | 182 ms
59,616 KB |
testcase_49 | AC | 58 ms
50,692 KB |
testcase_50 | AC | 231 ms
58,292 KB |
testcase_51 | AC | 204 ms
56,448 KB |
testcase_52 | AC | 198 ms
56,620 KB |
testcase_53 | AC | 209 ms
56,828 KB |
testcase_54 | AC | 175 ms
57,308 KB |
testcase_55 | AC | 228 ms
57,836 KB |
testcase_56 | AC | 175 ms
55,112 KB |
testcase_57 | AC | 193 ms
57,396 KB |
testcase_58 | AC | 60 ms
50,660 KB |
testcase_59 | AC | 56 ms
50,560 KB |
ソースコード
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[M]; 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()); } } }