oj.uz

답안 #776470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
776470 2023-07-08T00:57:20 Z horiiseun Cities (BOI16_cities) C++17
100 / 100
 2648 ms 59292 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <bitset>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
 
#define ll long long
#define f first
#define s second
 
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
 
template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
 
template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}
 
template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
 
template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
 
template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
void _print() { cerr << "]\n"; }
 
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}
 
#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
    #define D(...)
#endif

int n, m, k, mp[100005], idx;
vector<pair<int, int>> adj[100005];
ll dp[100005][50], ans;

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> k >> m;
    fill(mp, mp + 100005, -1);
    for (int i = 0, x; i < k; i++) {
        cin >> x;
        mp[x] = idx++;
    }
    for (int i = 0, a, b, c; i < m; i++) {
        cin >> a >> b >> c;
        adj[a].push_back({b, c});
        adj[b].push_back({a, c});
    }

    fill(&dp[0][0], &dp[0][0] + sizeof(dp) / sizeof(dp[0][0]), 1e18);
    for (int i = 0; i < 100005; i++) {
        if (mp[i] != -1) {
            dp[i][1 << mp[i]] = 0;
        }
        dp[i][0] = 0;
    }

    for (int i = 1; i < 1 << k; i++) {
        for (int j = 1; j <= n; j++) {
            for (int msk = 1; msk <= i; msk++) {
                if ((i | msk) == i) {
                    dp[j][i] = min(dp[j][i], dp[j][msk] + dp[j][i ^ msk]);
                }
            }
        }
        priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
        for (int j = 1; j <= n; j++) {
            pq.push({dp[j][i], j});
        }
        while (!pq.empty()) {
            pair<ll, int> curr = pq.top();
            pq.pop();
            if (curr.f > dp[curr.s][i]) continue;
            for (auto [nx, d] : adj[curr.s]) {
                if (curr.f + d < dp[nx][i]) {
                    dp[nx][i] = curr.f + d;
                    pq.push({dp[nx][i], nx});
                }
            }
        }
    }

    ans = 1e18;
    for (int i = 1; i <= n; i++) {
        ans = min(ans, dp[i][(1 << k) - 1]);
    }

    cout << ans << "\n";

}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 42108 KB Output is correct
2 Correct 17 ms 42196 KB Output is correct
3 Correct 20 ms 42196 KB Output is correct
4 Correct 17 ms 42196 KB Output is correct
5 Correct 22 ms 42156 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 591 ms 59180 KB Output is correct
2 Correct 595 ms 59168 KB Output is correct
3 Correct 391 ms 51044 KB Output is correct
4 Correct 62 ms 50308 KB Output is correct
5 Correct 283 ms 59180 KB Output is correct
6 Correct 61 ms 50276 KB Output is correct
7 Correct 17 ms 42232 KB Output is correct
8 Correct 17 ms 42288 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 42324 KB Output is correct
2 Correct 19 ms 42260 KB Output is correct
3 Correct 19 ms 42256 KB Output is correct
4 Correct 19 ms 42324 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1262 ms 59180 KB Output is correct
2 Correct 1292 ms 59148 KB Output is correct
3 Correct 941 ms 51216 KB Output is correct
4 Correct 593 ms 55932 KB Output is correct
5 Correct 138 ms 52368 KB Output is correct
6 Correct 80 ms 52040 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2648 ms 59176 KB Output is correct
2 Correct 2562 ms 59168 KB Output is correct
3 Correct 2565 ms 59292 KB Output is correct
4 Correct 1708 ms 51148 KB Output is correct
5 Correct 1188 ms 55784 KB Output is correct
6 Correct 211 ms 52396 KB Output is correct
7 Correct 91 ms 52024 KB Output is correct