oj.uz

답안 #973998

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973998 2024-05-02T14:43:35 Z canadavid1 Cities (BOI16_cities) C++17
51 / 100
 613 ms 262144 KB 
#include <iostream>
#include <vector>
#include <queue>

using Cost = long long;

struct uf
{
private:
    std::vector<int> data;
    int find(int val)
    {
        if (data[val] < 0) return val;
        return data[val] = find(data[val]);
    }
public:
    uf(int s) : data(s,-1) {}
    bool same(int a, int b)
    {
        return find(a)==find(b);
    }
    bool unite(int a, int b)
    {
        a = find(a);
        b = find(b);
        if (a==b) return false;
        if (-data[a] < -data[b]) std::swap(a,b);
        if (data[a] == data[b]) data[a]--;
        data[b] = a;
        return true;
    }
};

struct road
{
    int a,b;
    Cost cost;
};
struct city
{
    bool important=false;
    std::vector<std::pair<int,Cost>> neigh;
    Cost dist_to_important[5];
    std::vector<Cost> dist_to_all;
};

template<typename F>
void dijkstra(int start,std::vector<city>& cities, F callback)
{
    std::priority_queue<std::pair<Cost,int>> q;
    std::vector<bool> visit(cities.size(),0);
    q.emplace(0,start);
    while(q.size())
    {
        auto[cost,node] = q.top();q.pop();
        cost = -cost;
        if (visit[node]) continue;
        visit[node] = true;
        callback(cities[node],cost);
        for(auto[n,c] : cities[node].neigh) q.emplace(-cost-c,n);
    }
}

int main()
{
    std::cin.tie(0)->sync_with_stdio(false);
    int n,k,m;
    std::cin >> n >> k >> m;
    uf uf(n);
    std::vector<road> roads(m);
    std::vector<city> cities(n);
    std::vector<int> important(k);
    for(auto& i : important) 
    {
        std::cin >> i; i--;
        cities[i].important = true;
    }
    for(auto& r : roads) 
    {
        std::cin >> r.a >> r.b >> r.cost; r.a--; r.b--;
        cities[r.a].neigh.emplace_back(r.b,r.cost);
        cities[r.b].neigh.emplace_back(r.a,r.cost);
    }
    for(int i = 0; i < k; i++)
        dijkstra(important[i],cities,[i](city& c,Cost cost) {c.dist_to_important[i]=cost;});
    
    Cost c = 1ll<<62;
    if(k==2)
    {
        c = cities[important[1]].dist_to_important[0];
    }
    else if(k==3)
    {
        for(auto& n : cities) c = std::min(c,n.dist_to_important[0]+n.dist_to_important[1]+n.dist_to_important[2]);
    }
    else
    {
        for(auto& c : cities) c.dist_to_all.assign(n,1ll<<62);
        for(int i = 0; i < n; i++)
            dijkstra(i,cities,[i](city& c,Cost cost){c.dist_to_all[i]=cost;});
        
        if (k==4)
        {
            for(auto n : {1,2,3})
            for(auto& a: cities)
            for(auto& b: cities)
            {
                Cost co = 0;
                co += a.dist_to_important[0];
                co += a.dist_to_important[n];
                co += a.dist_to_all[&b-cities.data()];
                for(int i = 1; i < 4; i++) if(i!=n)
                    co += b.dist_to_important[i];
                c = std::min(c,co);
            }
        }
        else
        {
            for(auto e : {0,1,2,3,4})
            {
                int h = e == 0;
                for(auto h2 : {1,2,3,4})
                {
                    if (h2 == h || h2 == e) continue;
                    for(auto& a : cities)
                    for(auto& b : cities)
                    for(auto& C : cities)
                    {
                        Cost co = 0;
                        co += a.dist_to_important[h];
                        co += a.dist_to_important[h2];
                        co += a.dist_to_all[&b-cities.data()];
                        co += b.dist_to_important[e];
                        co += b.dist_to_all[&C-cities.data()];
                        for(int i = 0; i < 5; i++) if(i != h && i != e && i != h2)
                            co += C.dist_to_important[i];
                        c = std::min(c,co);
                    }
                }
            }
        }
        
    }
    std::cout << c << "\n";
    

}


/*
    3 points: one virtual, star graph, Y
    4 points: two virtual: >-<
    5 points: three virtual: >+< (but only the up of the plus)

*/

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 352 ms 31432 KB Output is correct
2 Correct 311 ms 30280 KB Output is correct
3 Correct 104 ms 16976 KB Output is correct
4 Correct 217 ms 27848 KB Output is correct
5 Correct 241 ms 30524 KB Output is correct
6 Correct 171 ms 29188 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 760 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 339 ms 8540 KB Output is correct
2 Correct 349 ms 8608 KB Output is correct
3 Correct 104 ms 8476 KB Output is correct
4 Correct 173 ms 2652 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 613 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 610 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -