Submission #627157

#	Time	Username	Problem	Language	Result	Execution time	Memory
627157		messiuuuuu	Toll (APIO13_toll)	C++14	56 / 100	169 ms	13232 KiB

toll

///
#include<bits/stdc++.h>
#define task "C"
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
using namespace std;
const int MAXN = 3e5 + 5;
const ll INF = 1e18 + 5;
const int MAXK = 25;

int n, k, m;
struct TEdge
{
    int u, v, w;
}es[MAXN], more[MAXK];
int a[MAXN];

void Input()
{
    cin >> n >> m >> k;
    for (int i = 1; i <= m; i++)
    {
        cin >> es[i].u >> es[i].v >> es[i].w;
    }
    for (int i = 1; i <= k; i++)
    {
        cin >> more[i].u >> more[i].v;
    }
    for (int i = 1; i <= n; i++)
        cin >> a[i];
}

int lab[MAXN], w[MAXK][MAXK];
bool inmst[MAXN];
vector<int> Adj[MAXK];
ll lab1[MAXN], sum[MAXK], res;
int labmau[MAXK], tplt;

int FindSet(int u)
{
    return lab[u] < 0 ? u : FindSet(lab[u]);
}

bool Unite(int u, int v)
{
    u = FindSet(u);
    v = FindSet(v);
    if (u == v)
        return 0;
    if (lab[u] > lab[v])
        swap(u, v);
    lab1[u] += lab1[v];
    lab[u] += lab[v];
    lab[v] = u;
    return 1;
}

int dep[MAXK], p[MAXK];

void DFS(int u)
{
    sum[u] = lab1[u];
    for (int v : Adj[u])
    {
        if (dep[v])
            continue;
        dep[v] = dep[u] + 1;
        p[v] = u;
        DFS(v);
        sum[u] += sum[v];
    }
}

void Cal(int u, int v, int w)
{
    if (dep[u] > dep[v])
        swap(u, v);
    while (dep[u] < dep[v])
    {
        res += sum[v] * w;
        sum[v] = 0;
        v = p[v];
    }
    while (u != v)
    {
        res += (sum[u] + sum[v]) * w;
        sum[u] = sum[v] = 0;
        u = p[u];
        v = p[v];
    }
}

void resetDsu()
{
    memset(lab, -1, sizeof(lab));
    for (int i = 1; i <= n; i++)
        lab1[i] = a[i];
}

void resetNen()
{
    for (int i = 1; i <= tplt; i++)
    {
        lab[i] = -1;
        lab1[i] = labmau[i];
    }
}

int ds[MAXN];

void Solve()
{
    resetDsu();
    for (int i = 1; i <= k; i++)
    {
        Unite(more[i].u, more[i].v);
    }
    sort(es + 1, es + 1 + m, [](const auto& i, const auto& j)
         {
            return i.w < j.w;
         });
    for (int i = 1; i <= m; i++)
    {
        if (Unite(es[i].u, es[i].v))
        {
            inmst[i] = 1;
        }
    }
    resetDsu();
    for (int i = 1; i <= m; i++)
    {
        if (inmst[i])
        {
            Unite(es[i].u, es[i].v);
        }
    }

    tplt = 0;
    for (int i = 1; i <= n; i++)
    {
        int u = FindSet(i);
        if (!ds[u])
        {
            ds[u] = ++tplt;
        }
        ds[i] = ds[u];
    }

    for (int i = 1; i <= n; i++)
    {
        assert(ds[i] <= i);
        if (lab[i] < 0)
        {
            labmau[ds[i]] = lab1[i];
        }
    }

    assert(tplt < MAXK);
    resetNen();

    //cout << tplt << '\n';
    //for (int i = 1; i <= n; i++)
    //    cout << ds[i] << ' ';
    //cout << '\n';

    vector<pair<int, int>> etplt;
    for (int i = 1; i <= m; i++)
    {
        if (!inmst[i])
        {
            int u = FindSet(ds[es[i].u]), v = FindSet(ds[es[i].v]);
            if (u > v)
                swap(u, v);
            assert(u < MAXK && v < MAXK);
            if (!w[u][v])
            {
                w[u][v] = es[i].w;
                etplt.pb({u, v});
                //cout << u << ' ' << v << ' ' << w[u][v] << '\n';
            }
        }
    }

    sort(etplt.begin(), etplt.end(), [](const auto& i, const auto& j)
         {
             return w[i.fi][i.se] < w[j.fi][j.se];
         });
    ll ans = 0;
    for (int mask = 1; mask < (1 << k); mask++)
    {
        for (int i = 0; i < k; i++)
        {
            if (mask & (1 << i))
            {
                Unite(ds[more[i + 1].u], ds[more[i + 1].v]);
            }
        }
        vector<int> in, out;
        for (int i = 0; i < etplt.size(); i++)
        {
            auto e = etplt[i];
            if (Unite(e.fi, e.se))
            {
                in.pb(i);
            } else
            {
                out.pb(i);
            }
        }
        resetNen();

        //cerr << in.size() << ' ' << out.size() << '\n';
        //cout << lab1[3] << '\n';

        for (int i : in)
        {
            auto e = etplt[i];
            Unite(e.fi, e.se);
            //cout << w[e.fi][e.se] << '\n';
        }
        for (int i = 0; i < k; i++)
        {
            if (mask & (1 << i))
            {
                int r = FindSet(ds[more[i + 1].u]), s = FindSet(ds[more[i + 1].v]);
                assert(r < MAXK && s < MAXK);
                Adj[r].pb(s);
                Adj[s].pb(r);
            }
        }
        //cout << lab1[FindSet(ds[4])] << '\n';
        dep[FindSet(ds[1])] = 1;
        DFS(FindSet(ds[1]));
        //cout << mask << ' ' << res << '\n';

        res = 0;
        for (int i : out)
        {
            auto e = etplt[i];
            int u = FindSet(e.fi), v = FindSet(e.se);
            assert(u < MAXK && v < MAXK);
            Cal(u, v, w[e.fi][e.se]);
        }
        ans = max(ans, res);

        for (int i = 1; i <= tplt; i++)
        {
            dep[i] = 0;
            Adj[i].clear();
        }
        resetNen();
    }
    cout << ans;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(task".INP","r"))
    {
        freopen(task".INP","r",stdin);
        //freopen(task".OUT","w",stdout);
    }
    Input();
    Solve();
}

Compilation message (stderr)

toll.cpp: In function 'void Solve()':
toll.cpp:202:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  202 |         for (int i = 0; i < etplt.size(); i++)
      |                         ~~^~~~~~~~~~~~~~
toll.cpp: In function 'int main()':
toll.cpp:265:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  265 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 16 / 16
• Subtask 2: 18 / 18
• Subtask 3: 22 / 22
• Subtask 4: 0 / 22
• Subtask 5: 0 / 22