oj.uz

Submission #391272

# Submission time Handle Problem Language Result Execution time Memory
391272 2021-04-18T11:22:24 Z MrRobot_28 Sjekira (COCI20_sjekira) C++17
40 / 110
 107 ms 32372 KB 
#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define sz(a) (int)a.size()
#define ll long long
#define int long long
#define ld long double
const int N = 3e5 + 100;
int dsu[N];
int val[N];
int rang[N];
vector <pair <int, int> > vec[N];
int pred(int a)
{
    if(a == dsu[a]) return a;
    return dsu[a] = pred(dsu[a]);
}
void unite(int a, int b)
{
    a = pred(a);
    b = pred(b);
    if(rang[b] < rang[a])
    {
        swap(a, b);
    }
    dsu[b] = a;
    rang[a] += rang[b];
    val[a] = max(val[a], val[b]);
}
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    vector <pair <int, int> > a(n);
    vector <set <pair <int, int> > > st(n);
    for(int i = 0; i < n; i++)
    {
        cin >> a[i].X;
        val[i] = a[i].X;
        a[i].Y = i;
        dsu[i] = i;
        rang[i] = 1;
    }
    sort(a.begin(), a.end());
    vector <vector <int> > g(n);
    for(int i = 0; i < n - 1; i++)
    {
        int a, b;
        cin >> a>> b;
        a--;
        b--;
        vec[a].push_back({a, b});
        vec[b].push_back({b, a});
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for(int i = 0; i < n; i++)
    {
        for(auto to : g[i])
        {
            if(val[to] > val[i])
            {
                st[i].insert({val[to], to});
            }
        }
    }
    ll s = 0;
    for(int i = 0; i < n; i++)
    {
        int minto = -1;
        int v = a[i].Y;
        if(sz(st[v]) != 0)
        {
            pair <int, int> t = *st[v].begin();
            st[v].erase(t);
            s += t.X + val[v];
           // cout << t.X << " " << val[v] << "\n";
            if(sz(st[t.Y]) < sz(st[v]))
            {
                swap(st[t.Y], st[v]);
            }
            for(auto p : st[v])
            {
                st[t.Y].insert(p);
            }
        }
    }
    cout << s;
    return 0;
}

Compilation message

sjekira.cpp: In function 'int main()':
sjekira.cpp:74:13: warning: unused variable 'minto' [-Wunused-variable]
   74 |         int minto = -1;
      |             ^~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 27720 KB Output is correct
2 Correct 63 ms 22868 KB Output is correct
3 Correct 65 ms 22340 KB Output is correct
4 Correct 67 ms 24080 KB Output is correct
5 Correct 107 ms 32372 KB Output is correct
6 Incorrect 83 ms 32368 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7384 KB Output is correct
6 Correct 7 ms 7528 KB Output is correct
7 Correct 6 ms 7500 KB Output is correct
8 Correct 5 ms 7500 KB Output is correct
9 Correct 7 ms 7628 KB Output is correct
10 Correct 7 ms 7628 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7384 KB Output is correct
6 Correct 82 ms 27720 KB Output is correct
7 Correct 63 ms 22868 KB Output is correct
8 Correct 65 ms 22340 KB Output is correct
9 Correct 67 ms 24080 KB Output is correct
10 Correct 107 ms 32372 KB Output is correct
11 Incorrect 83 ms 32368 KB Output isn't correct
12 Halted 0 ms 0 KB -