oj.uz

답안 #863847

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
863847 2023-10-21T09:02:14 Z vjudge1 Sjekira (COCI20_sjekira) C++17
110 / 110
 44 ms 9672 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];
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];
    }
    int a[n];
    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);
    
    solve();
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 8028 KB Output is correct
2 Correct 24 ms 7312 KB Output is correct
3 Correct 23 ms 7000 KB Output is correct
4 Correct 25 ms 7504 KB Output is correct
5 Correct 40 ms 9096 KB Output is correct
6 Correct 31 ms 9556 KB Output is correct
7 Correct 26 ms 8796 KB Output is correct
8 Correct 24 ms 8540 KB Output is correct
9 Correct 16 ms 7108 KB Output is correct
10 Correct 35 ms 9560 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 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 2 ms 4696 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 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 33 ms 8028 KB Output is correct
7 Correct 24 ms 7312 KB Output is correct
8 Correct 23 ms 7000 KB Output is correct
9 Correct 25 ms 7504 KB Output is correct
10 Correct 40 ms 9096 KB Output is correct
11 Correct 31 ms 9556 KB Output is correct
12 Correct 26 ms 8796 KB Output is correct
13 Correct 24 ms 8540 KB Output is correct
14 Correct 16 ms 7108 KB Output is correct
15 Correct 35 ms 9560 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 2 ms 4696 KB Output is correct
21 Correct 10 ms 5724 KB Output is correct
22 Correct 8 ms 5468 KB Output is correct
23 Correct 43 ms 9344 KB Output is correct
24 Correct 30 ms 7760 KB Output is correct
25 Correct 29 ms 7860 KB Output is correct
26 Correct 19 ms 6744 KB Output is correct
27 Correct 23 ms 7000 KB Output is correct
28 Correct 30 ms 8204 KB Output is correct
29 Correct 21 ms 7000 KB Output is correct
30 Correct 44 ms 9672 KB Output is correct