Submission #1356018

#	Time	Username	Problem	Language	Result	Execution time	Memory
1356018		alexdd	Security Guard (JOI23_guard)	C++20	0 / 100	22 ms	3472 KiB

guard

#include <bits/stdc++.h>
using namespace std;
#define int long long
int n,m,q;
int s[200005], needed[200005];
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>m>>q;
    for(int i=1;i<=n;i++)
        cin>>s[i];

    int rez = 0;
    int u,v;
    for(int i=1;i<=m;i++)
    {
        cin>>u>>v;
        if(s[u] < s[v])
        {
            rez += s[u];
            needed[u] = max(needed[u], s[v] - s[u]);
        }
        else
        {
            rez += s[v];
            needed[v] = max(needed[v], s[u] - s[v]);
        }
    }

    assert(m == n-1);
    assert(q == 0);

    for(int i=1;i<=n;i++)
        rez += needed[i];
    cout<<rez;

    return 0;
}

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