Submission #1215395

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215395		jerzyk	Security Guard (JOI23_guard)	C++20	37 / 100	185 ms	33096 KiB

guard

#include <bits/stdc++.h>

using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1'000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1'000'000'007LL;
const int N = 1<<18;
int vis[N];
vector<int> ed[N];
int tab[N];
ll dps[N], dpm[N];
ll ans = I;

void DFS(int v)
{
    vis[v] = 1;
    dps[v] = ((ll)ed[v].size() - 1LL) * (ll)tab[v];
    for(int i = 0; i < (int)ed[v].size(); ++i)
    {
        int ne = ed[v][i];
        if(vis[ne]) continue;
        DFS(ne);
        dps[v] += dps[ne];
        dpm[v] = max(dpm[v], dpm[ne] + (ll)(tab[ne] - tab[v]));
    }
    vis[v] = 0;
}

void DFSP(int v)
{
    vis[v] = 1;
    ll m1 = 0LL, m2 = 0LL;
    for(int i = 0; i < (int)ed[v].size(); ++i)
    {
        int ne = ed[v][i];
        ll a = max(0LL, dpm[ne] + (ll)(tab[ne] - tab[v]));
        if(a > m1) swap(a, m1);
        if(a > m2) swap(a, m2);
    }
    ans = min(ans, dps[1] + (ll)tab[v] + m1);
    for(int i = 0; i < (int)ed[v].size(); ++i)
    {
        int ne = ed[v][i];
        if(vis[ed[v][i]]) continue;
        ll a = max(0LL, dpm[ne] + (ll)(tab[ne] - tab[v]));
        dpm[v] = m1;
        if(a == m1) dpm[v] = m2;
        DFSP(ed[v][i]);
    }
    vis[v] = 0;
}

void Solve()
{
    int n, m, a, b, q;
    cin >> n >> m >> q;
    for(int i = 1; i <= n; ++i)
        cin >> tab[i];
    for(int i = 1; i <= m; ++i)
    {
        cin >> a >> b;
        ed[a].pb(b); ed[b].pb(a);
    }
    DFS(1);
    DFSP(1);
    cout << ans << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //int t; cin >> t;
    //while(t--)
        Solve();

    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 12 / 12
• Subtask 4: 0 / 13
• Subtask 5: 0 / 8
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24