oj.uz

Submission #863848

# Submission time Handle Problem Language Result Execution time Memory
863848 2023-10-21T09:03:10 Z vjudge1 Sjekira (COCI20_sjekira) C++17
110 / 110
 46 ms 9600 KB 
#include <bits/stdc++.h>
#define int long long
#define pb push_back
using namespace std;
const int mod=1e9+7;
const int N=1e5+7;
int parent[N], h[N], a[N];
int maxi[N];
int Find(int i)
{
    if(parent[i]==i)
    {
        return i;
    }
    return parent[i]=Find(parent[i]);
}
int fm(int i)
{
    return maxi[Find(i)];
}
void unite(int i,int j)
{
    int x=Find(i),y=Find(j);
    if(x!=y)
    {
        maxi[y]=maxi[x]=max(maxi[x],maxi[y]);
        parent[y]=x;
    }
}

vector<int>v[N];
void solve()
{
    int n;
    cin>>n;
    for(int i=0; i<n; i++)
    {
        cin>>h[i];
    }
    for(int i=0; i<n-1; i++)
    {
        int x,y;
        cin>>x>>y;
        x--,y--;
        v[x].pb(y);
        v[y].pb(x);
    }
    for(int i=0; i<n; i++)
    {
        parent[i]=i;
        maxi[i]=h[i];
    }
    for(int i=0; i<n; i++)a[i]=i;
    sort(a,a+n,[&](int i,int j)->bool
    {
        return h[i]<h[j];
    });
    for(int i=0; i<n; i++)
    {
        sort(v[i].begin(),v[i].end(),[&](int i,int j)->bool
        {
            return h[i]<h[j];
        });
    }
    int ans=0;
    bool cx[n];
    memset(cx,0,n);
    for(int i=0; i<n; i++)
    {
        cx[a[i]]=1;
        for(int j:v[a[i]])
        {
            if(cx[j])
            {
                ans+=fm(a[i])+fm(j);
                unite(a[i],j);
            }
        }
    }
    cout<<ans<<"\n";
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
//    freopen("paradigm,inp", "r", stdin);
//    freopen("paradigm,out", "w", stdout);
    solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 8028 KB Output is correct
2 Correct 26 ms 7256 KB Output is correct
3 Correct 22 ms 7000 KB Output is correct
4 Correct 25 ms 7516 KB Output is correct
5 Correct 38 ms 9088 KB Output is correct
6 Correct 29 ms 9556 KB Output is correct
7 Correct 26 ms 8788 KB Output is correct
8 Correct 23 ms 8536 KB Output is correct
9 Correct 15 ms 7004 KB Output is correct
10 Correct 29 ms 9568 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 31 ms 8028 KB Output is correct
7 Correct 26 ms 7256 KB Output is correct
8 Correct 22 ms 7000 KB Output is correct
9 Correct 25 ms 7516 KB Output is correct
10 Correct 38 ms 9088 KB Output is correct
11 Correct 29 ms 9556 KB Output is correct
12 Correct 26 ms 8788 KB Output is correct
13 Correct 23 ms 8536 KB Output is correct
14 Correct 15 ms 7004 KB Output is correct
15 Correct 29 ms 9568 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 1 ms 4700 KB Output is correct
21 Correct 10 ms 5724 KB Output is correct
22 Correct 8 ms 5508 KB Output is correct
23 Correct 44 ms 9560 KB Output is correct
24 Correct 39 ms 8012 KB Output is correct
25 Correct 31 ms 7952 KB Output is correct
26 Correct 20 ms 6784 KB Output is correct
27 Correct 23 ms 7004 KB Output is correct
28 Correct 30 ms 8284 KB Output is correct
29 Correct 20 ms 6988 KB Output is correct
30 Correct 46 ms 9600 KB Output is correct