oj.uz

답안 #828516

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
828516 2023-08-17T10:41:51 Z TB_ Cities (BOI16_cities) C++17
100 / 100
 3121 ms 55148 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;

vvpl adj(100001);


int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    ll n, k, m, from, to, cost, score, pos;
    // map<int, int> trans;
    vi important(5, 0);
    cin >> n >> k >> m;
    fo(i, k){
        cin >> important[i];
        important[i]--;
        // trans[--important[i]] = i;
    }
    fo(i, m){
        cin >> from >> to >> cost;
        adj[--from].pb({--to, cost});
        adj[to].pb({from, cost});
    }

    vvl ans(1<<k, vl(n, 1e16));
    fo(i, k) ans[1<<i][important[i]] = 0;
    ll res = 1e18;
    for(int currMask = 1; currMask<(1<<k); currMask++){
        priority_queue<pl> pq;
        vi seen(n, 0);
        fo(i, n){
            for(int m = currMask; m; m-=LSOne(m)){
                ll v = LSOne(m);
                ans[currMask][i] = min(ans[currMask][i], ans[v][i]+ans[currMask-v][i]);
            }
            if(currMask == (1<<k)-1) res = min(res, ans[currMask][i]);
            pq.push(mp(-ans[currMask][i], i));
        }
        while(!pq.empty()){
            tie(score, pos) = pq.top();
            pq.pop();
            if(seen[pos] || ans[currMask][pos] < -score) continue;
            seen[pos] = 1;
            ans[currMask][pos]=-score;
            for(auto &[v, w] : adj[pos])
                pq.push(mp(score-w, v));
        }
    }
    cout << res;

    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 713 ms 36288 KB Output is correct
2 Correct 733 ms 35696 KB Output is correct
3 Correct 292 ms 20492 KB Output is correct
4 Correct 463 ms 29584 KB Output is correct
5 Correct 353 ms 33052 KB Output is correct
6 Correct 225 ms 29364 KB Output is correct
7 Correct 5 ms 2900 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 2952 KB Output is correct
2 Correct 9 ms 3028 KB Output is correct
3 Correct 5 ms 2820 KB Output is correct
4 Correct 8 ms 2900 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1469 ms 42568 KB Output is correct
2 Correct 1399 ms 41912 KB Output is correct
3 Correct 670 ms 26776 KB Output is correct
4 Correct 1217 ms 36696 KB Output is correct
5 Correct 1020 ms 30524 KB Output is correct
6 Correct 981 ms 31596 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2880 ms 55148 KB Output is correct
2 Correct 2830 ms 55112 KB Output is correct
3 Correct 3121 ms 54600 KB Output is correct
4 Correct 1456 ms 39444 KB Output is correct
5 Correct 2586 ms 43008 KB Output is correct
6 Correct 2132 ms 31756 KB Output is correct
7 Correct 1962 ms 31868 KB Output is correct