結果

問題 No.1266 7 Colors
ユーザー semisagisemisagi
提出日時 2020-10-23 22:24:55
言語 Swift
(5.10.0)
結果
AC  
実行時間 651 ms / 3,000 ms
コード長 2,856 bytes
コンパイル時間 4,407 ms
コンパイル使用メモリ 132,468 KB
実行使用メモリ 26,532 KB
最終ジャッジ日時 2023-09-28 16:22:57
合計ジャッジ時間 16,743 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
7,776 KB
testcase_01 AC 3 ms
7,812 KB
testcase_02 AC 3 ms
7,940 KB
testcase_03 AC 481 ms
12,672 KB
testcase_04 AC 604 ms
21,464 KB
testcase_05 AC 492 ms
13,368 KB
testcase_06 AC 616 ms
22,928 KB
testcase_07 AC 639 ms
24,744 KB
testcase_08 AC 599 ms
21,848 KB
testcase_09 AC 562 ms
18,948 KB
testcase_10 AC 558 ms
17,948 KB
testcase_11 AC 516 ms
14,628 KB
testcase_12 AC 526 ms
15,612 KB
testcase_13 AC 536 ms
16,600 KB
testcase_14 AC 504 ms
13,204 KB
testcase_15 AC 651 ms
25,112 KB
testcase_16 AC 533 ms
15,924 KB
testcase_17 AC 639 ms
24,280 KB
testcase_18 AC 527 ms
25,708 KB
testcase_19 AC 534 ms
26,504 KB
testcase_20 AC 536 ms
26,532 KB
testcase_21 AC 341 ms
9,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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())!
    }
}

struct UnionFind {
    var parent: [Int]
    var count: [Int]

    init(_ n: Int) {
        parent = Array(0 ..< n)
        count = [Int](repeating: 1, count: n)
    }

    mutating func find(_ v: Int) -> Int {
        if v == parent[v] {
            return v
        }
        parent[v] = find(parent[v])
        return parent[v]
    }

    mutating func union(_ u: Int, _ v: Int) {
        var u = find(u)
        var v = find(v)
        guard u != v else { return }
        if count[u] < count[v] {
            swap(&u, &v)
        }
        count[u] += count[v]
        parent[v] = u
    }

    mutating func count(_ u: Int) -> Int {
        count[find(u)]
    }
}

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
        }
    }
}

var scanner = Scanner()
let N = scanner.nextInt()
let M = scanner.nextInt()
let Q = scanner.nextInt()
var colors = Array2D(repeating: false, N, 7)
for i in 0 ..< N {
    let s = [Character](scanner.next())
    for j in 0 ..< 7 {
        colors[i, j] = s[j] == "1"
    }
}

var G = [[Int]](repeating: [Int](), count: N)
for _ in 0 ..< M {
    let u = scanner.nextInt() - 1
    let v = scanner.nextInt() - 1
    G[u].append(v)
    G[v].append(u)
}

var uf = UnionFind(N * 7)

func union(u: Int) {
    for i in 0 ..< 7 {
        let j = (i + 1) % 7
        if colors[u, i] && colors[u, j] {
            uf.union(u * 7 + i, u * 7 + j)
        }
    }
    for v in G[u] {
        for i in 0 ..< 7 {
            if colors[u, i] && colors[v, i] {
                uf.union(u * 7 + i, v * 7 + i)
            }
        }
    }
}

for u in 0 ..< N {
    union(u: u)
}

for _ in 0 ..< Q {
    switch scanner.nextInt() {
    case 1:
        let x = scanner.nextInt() - 1
        let y = scanner.nextInt() - 1
        colors[x, y] = true
        union(u: x)

    default:
        let x = scanner.nextInt() - 1
        let _ = scanner.nextInt()
        print(uf.count(x * 7))
    }
}
0