oj.uz

Submission #332601

# Submission time Handle Problem Language Result Execution time Memory
332601 2020-12-02T23:17:37 Z souvenir_vayne Sjekira (COCI20_sjekira) C++14
110 / 110
 56 ms 7148 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <chrono>
#define pb push_back
#define INF 0x3f3f3f3f
//#define LINF 0x3f3f3f3f3f3f3f3f
//#define endl '\n'
#define ll long long
#define f first
#define int long long
#define fin cin
#define fout cout
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout << "DEBUG " << x << endl
#define debug2(x, y) cout << "DEBUG " << x << " " << y << endl
#define debug3(x, y, z) cout << "DEBUG " << x << " " << y << " " << z<< endl
#define debug4(x, y, z, o) cout << "DEBUG " << x << " " << y << " " << z<< " " << o << endl
#define all(x) x.begin(), x.end()
#define left vadia
#define lb lower_bound
#define right puta
using namespace std;
using namespace __gnu_pbds;
void setIO(string s) {
  ios_base::sync_with_stdio(0); cin.tie(0);
  freopen((s+".in").c_str(),"r",stdin);
  freopen((s+".out").c_str( ),"w",stdout);
}
typedef pair<ll, ll> pii;
typedef vector<vector<char>> mat;
typedef pair<int, string> pis;
const ll mod = 1e9+7;
typedef vector<int> vi;
typedef pair<int, pair<int, int>> piii;

const int MAXN = 1e5+5;
int p[MAXN], pai[MAXN];

bool cmp(pii a, pii b) {
    return max(p[a.f], p[a.s]) < max(p[b.f], p[b.s]);
}

int ans = 0;

int find(int x) {
    if(pai[x] == x)
        return x;
    else return pai[x] = find(pai[x]);
}

void query(int a, int b) {
    a = find(a), b = find(b);
    if(a != b) {
        if(p[a] < p[b])
            swap(a, b);
        ans += p[a] + p[b];
        pai[b] = a;
    }
}

int32_t main() {

    FAST;
    int n;
    cin >> n;

    for(int i = 1; i <= n; i++) {
        cin >> p[i];
        pai[i] = i;
    }

    vector<pii> e(n-1);
    for(pii &i : e)
        cin >> i.f >> i.s;
    sort(all(e), cmp);

    for(pii &i : e)
        query(i.f, i.s);

    cout << ans << endl;



}

Compilation message

sjekira.cpp: In function 'void setIO(std::string)':
sjekira.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   27 |   freopen((s+".in").c_str(),"r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sjekira.cpp:28:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   28 |   freopen((s+".out").c_str( ),"w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 4204 KB Output is correct
2 Correct 30 ms 3584 KB Output is correct
3 Correct 29 ms 3436 KB Output is correct
4 Correct 32 ms 3840 KB Output is correct
5 Correct 50 ms 5612 KB Output is correct
6 Correct 55 ms 7148 KB Output is correct
7 Correct 46 ms 5752 KB Output is correct
8 Correct 42 ms 5484 KB Output is correct
9 Correct 28 ms 3820 KB Output is correct
10 Correct 50 ms 6764 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 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 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 39 ms 4204 KB Output is correct
7 Correct 30 ms 3584 KB Output is correct
8 Correct 29 ms 3436 KB Output is correct
9 Correct 32 ms 3840 KB Output is correct
10 Correct 50 ms 5612 KB Output is correct
11 Correct 55 ms 7148 KB Output is correct
12 Correct 46 ms 5752 KB Output is correct
13 Correct 42 ms 5484 KB Output is correct
14 Correct 28 ms 3820 KB Output is correct
15 Correct 50 ms 6764 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 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 12 ms 1516 KB Output is correct
22 Correct 10 ms 1388 KB Output is correct
23 Correct 51 ms 5376 KB Output is correct
24 Correct 47 ms 3820 KB Output is correct
25 Correct 35 ms 3820 KB Output is correct
26 Correct 23 ms 2668 KB Output is correct
27 Correct 33 ms 3052 KB Output is correct
28 Correct 35 ms 3692 KB Output is correct
29 Correct 26 ms 2668 KB Output is correct
30 Correct 56 ms 5612 KB Output is correct