Submission #968809

#	Time	Username	Problem	Language	Result	Execution time	Memory
968809		blackslex	Cities (BOI16_cities)	C++17	0 / 100	114 ms	3556 KiB

cities

#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using tp = tuple<ll, int, int>;

int n, m, k, x, y;
ll z;

int main() {
    scanf("%d %d %d", &n, &k, &m);
    vector<int> c(k);
    vector<tp> v(m);
    for (auto &e: c) scanf("%d", &e), e--;
    for (auto &[z, x, y]: v) scanf("%d %d %lld", &x, &y, &z), x--, y--;
    sort(v.begin(), v.end());
    ll ans = 1e9;
    auto get = [&] (int msk) {
        for (auto &e: c) if (!(msk & (1 << e))) return;
        vector<int> par(n); iota(par.begin(), par.end(), 0);
        function<int(int)> fset = [&] (int a) {return (par[a] == a ? a : par[a] = fset(par[a]));};
        ll cur = 0;
        for (auto &[z, x, y]: v) {
            if (!(msk & (1 << x)) || !(msk & (1 << y))) continue;
            if (fset(x) != fset(y)) par[fset(x)] = fset(y), cur += z;
        }
        for (auto &e: c) for (auto &E: c) if (fset(e) != fset(E)) return;
        ans = min(ans, cur);
    };
    for (int i = 0; i < (1 << n); i++) get(i);
    printf("%lld", ans);
}

Compilation message (stderr)

cities.cpp: In function 'int main()':
cities.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d %d %d", &n, &k, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
cities.cpp:14:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     for (auto &e: c) scanf("%d", &e), e--;
      |                      ~~~~~^~~~~~~~~~
cities.cpp:15:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     for (auto &[z, x, y]: v) scanf("%d %d %lld", &x, &y, &z), x--, y--;
      |                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 22
• Subtask 2: 0 / 14
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 26