結果

問題 No.2642 Don't cut line!
ユーザー abap34abap34
提出日時 2024-02-15 02:14:53
言語 Julia
(1.10.2)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 4,745 bytes
コンパイル時間 126 ms
コンパイル使用メモリ 6,944 KB
実行使用メモリ 493,168 KB
最終ジャッジ日時 2024-04-09 14:35:19
合計ジャッジ時間 63,182 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 2,200 ms
482,220 KB
testcase_02 AC 2,173 ms
484,684 KB
testcase_03 AC 2,154 ms
490,456 KB
testcase_04 AC 2,107 ms
484,748 KB
testcase_05 AC 2,158 ms
493,168 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 2,118 ms
488,076 KB
testcase_17 AC 1,787 ms
450,360 KB
testcase_18 AC 1,831 ms
472,800 KB
testcase_19 AC 1,751 ms
413,992 KB
testcase_20 AC 1,515 ms
334,192 KB
testcase_21 AC 1,505 ms
340,152 KB
testcase_22 AC 1,774 ms
423,652 KB
testcase_23 AC 2,070 ms
481,384 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 1,719 ms
405,544 KB
testcase_28 AC 1,840 ms
475,728 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 AC 1,796 ms
427,788 KB
testcase_32 WA -
testcase_33 AC 1,268 ms
296,524 KB
testcase_34 AC 1,284 ms
296,356 KB
testcase_35 AC 1,267 ms
294,288 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

const INF = 10^16

struct UnionFind
    par::Vector{Int}
    size::Vector{Int}
    UnionFind(N) = new(collect(1:N), collect(1:N))
end

function root!(uf::UnionFind, x::Int)
    if uf.par[x] == x
        return x
    else
        return uf.par[x] = root!(uf, uf.par[x])
    end
end

function issame!(uf::UnionFind, x::Int, y::Int)
    return root!(uf, x) == root!(uf, y)
end

function unite!(uf::UnionFind, x::Int, y::Int)
    x = root!(uf, x)
    y = root!(uf, y)
    (x == y) && (return true)
    if (uf.size[x] < uf.size[y])
        uf.par[x] = y
        uf.size[y] += uf.size[x]
    else
        uf.par[y] = x
        uf.size[x] += uf.size[y]
    end
    return true
end


struct Edge
    from::Int
    to::Int
    weight::Int
    profit::Int
end

function reverse(edge::Edge)
    return Edge(edge.to, edge.from, edge.weight, edge.profit)
end

struct Graph
    edges::Vector{Vector{Edge}}
    function Graph(N)
        edges = [Vector{Edge}() for _ in 1:N]
        new(edges)
    end
end

function all_edges(graph::Graph)::Vector{Edge}
    return collect(Iterators.flatten(graph.edges))
end


function add!(graph::Graph, edge::Edge; has_dir=false)
    push!(graph.edges[edge.from], edge)

    if !has_dir
        rev_edge = reverse(edge)
        push!(graph.edges[edge.to], rev_edge)
    end
end


function as_rooted_tree(graph::Graph, root::Int)::Graph
    N = length(graph.edges)

    tree = Graph(N)

    function dfs(v, p)
        for u in graph.edges[v]
            if u.to != p
                add!(tree, u, has_dir=true)
                dfs(u.to, v)
            end
        end
    end

    dfs(root, -1)

    return tree
end

function kruskal(sorted_edges::Vector{Edge}, N; by=identity, rev=false)::Tuple{Graph,Int,Int}
    uf = UnionFind(N)

    graph = Graph(N)
    cost = 0
    profit = -1

    for edge in sorted_edges
        if !issame!(uf, edge.from, edge.to)
            unite!(uf, edge.from, edge.to)
            add!(graph, edge)
            cost += edge.weight
            profit = max(profit, edge.profit)
        end
    end

    return graph, cost, profit
end


struct LCA
    parent::Vector{Vector{Int}}
    dist::Vector{Vector{Int}}
    depth::Vector{Int}
    K::Int
    V::Int
    function LCA(graph::Graph; root=1)
        V = length(graph.edges)
        K = ceil(Int, log2(V))

        tree = as_rooted_tree(graph, root)

        parent = [fill(-1, V) for _ in 1:K]
        dist = [fill(-1, V) for _ in 1:K]
        depth = fill(-1, V)

        function dfs(v, p, d)
            depth[v] = d
            parent[1][v] = p
            for u in tree.edges[v]
                if u.to != p
                    dist[1][u.to] = u.weight
                    dfs(u.to, v, d + 1)
                end
            end
        end

        dfs(root, -1, 0)

        for k in 1:K-1
            for v in 1:V
                if parent[k][v] == -1
                    continue
                else
                    parent[k+1][v] = parent[k][parent[k][v]]
                    dist[k+1][v] = max(dist[k][v], dist[k][parent[k][v]])
                end
            end
        end

        return new(parent, dist, depth, K, V)
    end
end

function max_cost(lca::LCA, u::Int, v::Int)::Int
    cost = -INF

    if lca.depth[u] < lca.depth[v]
        u, v = v, u
    end

    diff = lca.depth[u] - lca.depth[v]

    for k in 0:lca.K-1
        if (diff >> k) & 1 == 1
            cost = max(cost, lca.dist[k+1][u])
            u = lca.parent[k+1][u]
        end
    end

    if u == v
        return cost
    end


    for k in lca.K:-1:1
        if lca.parent[k][u] != lca.parent[k][v]
            cost = max(cost, lca.dist[k][u])
            cost = max(cost, lca.dist[k][v])

            u = lca.parent[k][u]
            v = lca.parent[k][v]
        end
    end

    cost = max(cost, lca.dist[1][u])
    cost = max(cost, lca.dist[1][v])
    return cost
end




function main()
    N, K, C = parse.(Int, split(readline()))
    graph = Graph(N)

    for _ in 1:K
        u, v, w, p = parse.(Int, split(readline()))
        edge = Edge(u, v, w, p)
        add!(graph, edge)
    end

    sorted_edges = all_edges(graph)
    sort!(sorted_edges, by=(x -> x.profit), rev=true)

    mst, C_m, P_m = kruskal(sorted_edges, N, by=(x -> x.weight))

    mst_edges_set = Set{Edge}(all_edges(mst))

    mst_tree = as_rooted_tree(mst, 1)

    lca = LCA(mst_tree)

    for edge in sorted_edges
        P = edge.profit
        if (edge in mst_edges_set)
            C_add = 0
            C_rem = 0
        else
            u, v, C_add = edge.from, edge.to, edge.weight
            C_rem = max_cost(lca, u, v)
        end

        if C_m + C_add - C_rem <= C
            println(P)
            return
        end
    end

    println(-1)
end



main()
0