結果
問題 | No.1142 XOR と XOR |
ユーザー | semisagi |
提出日時 | 2020-07-31 22:07:36 |
言語 | Swift (5.10.0) |
結果 |
AC
|
実行時間 | 174 ms / 2,000 ms |
コード長 | 3,533 bytes |
コンパイル時間 | 8,400 ms |
コンパイル使用メモリ | 131,296 KB |
実行使用メモリ | 27,644 KB |
最終ジャッジ日時 | 2023-08-07 22:01:54 |
合計ジャッジ時間 | 12,722 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 14 ms
7,808 KB |
testcase_01 | AC | 13 ms
7,772 KB |
testcase_02 | AC | 13 ms
7,896 KB |
testcase_03 | AC | 174 ms
26,668 KB |
testcase_04 | AC | 122 ms
19,436 KB |
testcase_05 | AC | 105 ms
18,104 KB |
testcase_06 | AC | 128 ms
25,312 KB |
testcase_07 | AC | 106 ms
25,632 KB |
testcase_08 | AC | 155 ms
27,292 KB |
testcase_09 | AC | 151 ms
27,644 KB |
testcase_10 | AC | 151 ms
27,248 KB |
testcase_11 | AC | 13 ms
7,796 KB |
testcase_12 | AC | 13 ms
7,848 KB |
testcase_13 | AC | 13 ms
7,792 KB |
testcase_14 | AC | 88 ms
20,672 KB |
testcase_15 | AC | 86 ms
20,612 KB |
testcase_16 | AC | 19 ms
8,392 KB |
testcase_17 | AC | 87 ms
22,780 KB |
testcase_18 | AC | 31 ms
10,284 KB |
testcase_19 | AC | 132 ms
24,480 KB |
testcase_20 | AC | 87 ms
17,020 KB |
testcase_21 | AC | 60 ms
12,992 KB |
testcase_22 | AC | 39 ms
11,124 KB |
testcase_23 | AC | 119 ms
23,904 KB |
testcase_24 | AC | 133 ms
25,020 KB |
testcase_25 | AC | 86 ms
16,272 KB |
testcase_26 | AC | 124 ms
23,368 KB |
testcase_27 | AC | 104 ms
22,128 KB |
ソースコード
fileprivate struct Scanner { private var elements = [String]() private var index = 0 mutating func peek() -> String { while elements.count == index { elements = readLine()!.split(separator: " ").map(String.init) index = 0 } return elements[index] } mutating func next() -> String { let value = peek() index += 1 return value } mutating func nextInt() -> Int { return Int(next())! } mutating func nextDouble() -> Double { return Double(next())! } } fileprivate let MOD = 1000000007 fileprivate struct Zn { let n: Int init(_ n: Int) { self.n = n } static func + (lhs: Self, rhs: Self) -> Self { let n = lhs.n + rhs.n return Zn(n < MOD ? n : n - MOD) } static func - (lhs: Self, rhs: Self) -> Self { let n = lhs.n - rhs.n return Zn(n >= 0 ? n : n + MOD) } static func * (lhs: Self, rhs: Self) -> Self { Zn((lhs.n * rhs.n) % MOD) } static func += (lhs: inout Self, rhs: Self) { lhs = lhs + rhs } static func -= (lhs: inout Self, rhs: Self) { lhs = lhs - rhs } static func *= (lhs: inout Self, rhs: Self) { lhs = lhs * rhs } func pow(_ n: Int) -> Self { if n == 0 { return Zn(1) } else if n % 2 == 1 { return self * self.pow(n - 1) } else { return (self * self).pow(n / 2) } } var inverse: Self { self.pow(MOD - 2) } } fileprivate struct Array2D<Element> { let n1: Int let n2: Int private var elements: [Element] init(repeating: Element, _ n1: Int, _ n2: Int) { self.n1 = n1 self.n2 = n2 self.elements = [Element](repeating: repeating, count: n1 * n2) } subscript(i: Int, j: Int) -> Element { get { elements[i * n2 + j] } set { elements[i * n2 + j] = newValue } } } func main() { var scanner = Scanner() let N = scanner.nextInt() let M = scanner.nextInt() let K = scanner.nextInt() let A = (0 ..< N).map { _ in scanner.nextInt() } let B = (0 ..< M).map { _ in scanner.nextInt() } var S = [0] for i in 0 ..< N { S.append(S.last! ^ A[i]) } var T = [0] for i in 0 ..< M { T.append(T.last! ^ B[i]) } var F = [Int](repeating: 0, count: 1024) var G = [Int](repeating: 0, count: 1024) S.forEach { F[$0] += 1 } T.forEach { G[$0] += 1 } func f(dp: [Zn], array A: [Int]) -> [Zn] { var result = [Zn](repeating: Zn(0), count: 1024) for i in 0 ..< 1024 { for j in 0 ..< 1024 { result[i ^ j] += dp[i] * Zn(A[j]) } } return result } func solve(array F: [Int]) -> Zn { var result = Zn(0) for i in 0 ..< 1024 { result += Zn(F[i]) * Zn(F[K ^ i]) } return result } var dp = [Zn](repeating: Zn(0), count: 1024) dp[0] = Zn(1) dp = f(dp: dp, array: F) dp = f(dp: dp, array: F) dp = f(dp: dp, array: G) dp = f(dp: dp, array: G) var answer = dp[K] if K == 0 { answer += Zn(N + 1) * Zn(M + 1) } answer -= solve(array: F) * Zn(M + 1) answer -= solve(array: G) * Zn(N + 1) answer *= Zn(4).inverse print(answer.n) } main()