oj.uz

Submission #767711

# Submission time Handle Problem Language Result Execution time Memory
767711 2023-06-27T05:33:47 Z Pichon5 Sjekira (COCI20_sjekira) C++17
110 / 110
 47 ms 7024 KB 
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <string>
#include <sstream>
#include <fstream>
#include <cmath>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define int long long
using namespace std;
const int tam=100005;
int v[tam];

bool cmp(pair<int,int> a,pair<int,int> b){
    return max(v[a.F],v[a.S])<max(v[b.F],v[b.S]);
}
int P[tam];
int majo[tam];
int _find(int x){
    if(P[x]==x)return x;
    return P[x]=_find(P[x]);
}
int res=0;
int _union(int a, int b){
    a=_find(a);b=_find(b);
    P[a]=b;
    int devuelvo=majo[a]+majo[b];
    majo[b]=max(majo[a],majo[b]);
    return devuelvo;
}

signed main(){
    fast
    int n,x,a,b;
    cin>>n;
    int res=0;
    vector<pair<int,int>>E;
    for(int i=1;i<=n;i++){
        P[i]=i;
        cin>>v[i];
        majo[i]=v[i];
    }
    for(int i=0;i<n-1;i++){
        cin>>a>>b;
        E.pb({a,b});
    }
    sort(E.begin(),E.end(),cmp);
    for(int i=0;i<E.size();i++){
        int a=E[i].F,b=E[i].S;
        int val=_union(a,b);
        // cout<<"val "<<val<<endl;
        res+=val;
    }
    cout<<res<<endl;
    return 0;
}

Compilation message

sjekira.cpp: In function 'int main()':
sjekira.cpp:62:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for(int i=0;i<E.size();i++){
      |                 ~^~~~~~~~~
sjekira.cpp:48:11: warning: unused variable 'x' [-Wunused-variable]
   48 |     int n,x,a,b;
      |           ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 328 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 6100 KB Output is correct
2 Correct 21 ms 4168 KB Output is correct
3 Correct 20 ms 4052 KB Output is correct
4 Correct 22 ms 5456 KB Output is correct
5 Correct 34 ms 6676 KB Output is correct
6 Correct 47 ms 7024 KB Output is correct
7 Correct 34 ms 6304 KB Output is correct
8 Correct 29 ms 5940 KB Output is correct
9 Correct 25 ms 3828 KB Output is correct
10 Correct 33 ms 6960 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 388 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 28 ms 6100 KB Output is correct
7 Correct 21 ms 4168 KB Output is correct
8 Correct 20 ms 4052 KB Output is correct
9 Correct 22 ms 5456 KB Output is correct
10 Correct 34 ms 6676 KB Output is correct
11 Correct 47 ms 7024 KB Output is correct
12 Correct 34 ms 6304 KB Output is correct
13 Correct 29 ms 5940 KB Output is correct
14 Correct 25 ms 3828 KB Output is correct
15 Correct 33 ms 6960 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 388 KB Output is correct
21 Correct 8 ms 2008 KB Output is correct
22 Correct 7 ms 1752 KB Output is correct
23 Correct 36 ms 6600 KB Output is correct
24 Correct 25 ms 5496 KB Output is correct
25 Correct 24 ms 5376 KB Output is correct
26 Correct 16 ms 3428 KB Output is correct
27 Correct 19 ms 3724 KB Output is correct
28 Correct 23 ms 5328 KB Output is correct
29 Correct 15 ms 3412 KB Output is correct
30 Correct 37 ms 6736 KB Output is correct