oj.uz

답안 #328677

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
328677 2020-11-17T15:46:03 Z phathnv Sjekira (COCI20_sjekira) C++11
110 / 110
 114 ms 2796 KB 
#include <bits/stdc++.h>

#define mp make_pair
#define X first
#define Y second
#define taskname "Sjekira"

using namespace std;

typedef long long ll;
typedef pair <int, int> ii;

const int N = 1e5 + 1;

struct DSU{
    int root[N], rnk[N], maxVal[N];
    void init(int n, int a[N]){
        for(int i = 1; i <= n; i++){
            root[i] = i;
            rnk[i] = 0;
            maxVal[i] = a[i];
        }
    }
    int getRoot(int u){
        if (u == root[u])
            return u;
        root[u] = getRoot(root[u]);
        return root[u];
    }
    int unite(int u, int v){
        u = getRoot(u);
        v = getRoot(v);
        if (rnk[u] < rnk[v])
            swap(u, v);
        int res = maxVal[u] + maxVal[v];
        root[v] = u;
        rnk[u] += (rnk[u] == rnk[v]);
        maxVal[u] = max(maxVal[u], maxVal[v]);
        return res;
    }
} dsu;

int n, a[N];
ii eds[N];

void readInput(){
    cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    for(int i = 1; i < n; i++)
        cin >> eds[i].X >> eds[i].Y;
}

void solve(){
    sort(eds + 1, eds + n, [&](const ii &ed1, const ii &ed2){
            return max(a[ed1.X], a[ed1.Y]) < max(a[ed2.X], a[ed2.Y]);
         });
    dsu.init(n, a);
    ll res = 0;
    for(int i = 1; i < n; i++)
        res += dsu.unite(eds[i].X, eds[i].Y);
    cout << res;
}

int main(){
    if (fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
        freopen(taskname".out", "w", stdout);
    }
    readInput();
    solve();
    return 0;
}

Compilation message

sjekira.cpp: In function 'int main()':
sjekira.cpp:67:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   67 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
sjekira.cpp:68:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   68 |         freopen(taskname".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 2284 KB Output is correct
2 Correct 81 ms 1924 KB Output is correct
3 Correct 67 ms 1772 KB Output is correct
4 Correct 85 ms 1900 KB Output is correct
5 Correct 114 ms 2668 KB Output is correct
6 Correct 112 ms 2796 KB Output is correct
7 Correct 97 ms 2412 KB Output is correct
8 Correct 96 ms 2176 KB Output is correct
9 Correct 57 ms 1516 KB Output is correct
10 Correct 110 ms 2684 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 108 ms 2284 KB Output is correct
7 Correct 81 ms 1924 KB Output is correct
8 Correct 67 ms 1772 KB Output is correct
9 Correct 85 ms 1900 KB Output is correct
10 Correct 114 ms 2668 KB Output is correct
11 Correct 112 ms 2796 KB Output is correct
12 Correct 97 ms 2412 KB Output is correct
13 Correct 96 ms 2176 KB Output is correct
14 Correct 57 ms 1516 KB Output is correct
15 Correct 110 ms 2684 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 2 ms 364 KB Output is correct
21 Correct 26 ms 876 KB Output is correct
22 Correct 21 ms 748 KB Output is correct
23 Correct 111 ms 2540 KB Output is correct
24 Correct 75 ms 1900 KB Output is correct
25 Correct 76 ms 2028 KB Output is correct
26 Correct 50 ms 1388 KB Output is correct
27 Correct 59 ms 1516 KB Output is correct
28 Correct 70 ms 2028 KB Output is correct
29 Correct 45 ms 1516 KB Output is correct
30 Correct 114 ms 2668 KB Output is correct