oj.uz

Submission #947154

# Submission time Handle Problem Language Result Execution time Memory
947154 2024-03-15T15:08:40 Z NK_ Sjekira (COCI20_sjekira) C++17
110 / 110
 16 ms 4820 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define pb push_back

template<class T> using V = vector<T>;
template<class T, size_t SZ> using AR = array<T, SZ>;

struct Scanner {
    FILE* stream;
    Scanner(FILE* s) : stream(s) {}
    char buf[1 << 20], * l = buf, * r = buf;
    bool flush() { l = buf; r = l + fread(buf, 1, 1 << 20, stream); return l == r; }
    void get(char& c) { c = l == r && flush() ? ' ' : *l++; }
    friend Scanner& operator >>(Scanner& in, char& c) { return in.get(c), in; }
    friend Scanner& operator >>(Scanner& in, char* s) {
        for (in.get(s[0]); isspace(s[0]); in.get(s[0]));
        for (int i = 0; !isspace(s[i]) || (s[i] = '\0'); i++) in.get(s[i + 1]);
        return in;
    }
    friend Scanner& operator >>(Scanner& in, std::string& s) {
        char c;
        for (in.get(c); isspace(c); in.get(c));
        for (s = ""; !isspace(c); in.get(c)) s += c;
        return in;
    }
    template <class T, std::enable_if_t<std::is_integral_v<T>, int> = 0>
    friend Scanner& operator >>(Scanner& in, T& x) {
        char c, f = '+';
        for (in.get(c); !isdigit(c); in.get(c))
            if constexpr (std::is_signed_v<T>) f = c;
        for (x = 0; isdigit(c); in.get(c)) x = x * (1 << 1) + x * (1 << 3) + c - '0';
        if constexpr (std::is_signed_v<T>) x = f == '-' ? -x : x;
        return in;
    }
    template <class T, std::enable_if_t<std::is_floating_point_v<T>, int> = 0>
    friend Scanner& operator >>(Scanner& in, T& x) {
        std::string s; in >> s; x = std::stod(s);
        return in;
    }
    template <class T, class U>
    friend Scanner& operator >>(Scanner& in, std::pair<T, U>& a) {
        return in >> a.first >> a.second;
    }
    template <class T, size_t S>
    friend Scanner& operator >>(Scanner& in, std::array<T, S>& a) {
        for (int i = 0, n = S; i < n; i++) in >> a[i];
        return in;
    }
    template <class T>
    friend Scanner& operator >>(Scanner& in, std::vector<T>& a) {
        for (int i = 0, n = a.size(); i < n; i++) in >> a[i];
        return in;
    }
};
 
struct Printer {
    FILE* stream;
    Printer(FILE* s) : stream(s) {}
    char buf[1 << 20], * l = buf, * r = buf + (1 << 20) - 1;
    int format = 0, precision = 15;
    ~Printer() { flush(); }
    void flush() { fwrite(buf, 1, l - buf, stream); l = buf; }
    void put(const char& c) { *l++ = c; if (l == r) flush(); }
    friend Printer& operator <<(Printer& out, const char& c) { return out.put(c), out; }
    friend Printer& operator <<(Printer& out, const char* s) {
        for (int i = 0; s[i] != '\0'; i++) out.put(s[i]);
        return out;
    }
    friend Printer& operator <<(Printer& out, const std::string& s) {
        for (int i = 0, n = s.size(); i < n; i++) out.put(s[i]);
        return out;
    }
    template <class T, std::enable_if_t<std::is_integral_v<T>, int> = 0>
    friend Printer& operator <<(Printer& out, T x) {
        static char s[40];
        static int i = 0;
        if (x == 0) { out.put('0'); return out; }
        if constexpr (std::is_signed_v<T>) x = x < 0 ? out.put('-'), -x : x;
        while (x > 0) s[++i] = x % 10 + '0', x /= 10;
        while (i > 0) out.put(s[i--]);
        return out;
    }
    template <class T, std::enable_if_t<std::is_floating_point_v<T>, int> = 0>
    friend Printer& operator <<(Printer& out, T x) {
        std::ostringstream oss;
        oss << std::fixed << std::setprecision(out.precision) << x;
        return out << oss.str();
    }
    template <class T, class U>
    friend Printer& operator <<(Printer& out, const std::pair<T, U>& a) {
        return out << a.first << " \n"[out.format > 1] << a.second;
    }
    template <class T, size_t S>
    friend Printer& operator <<(Printer& out, const std::array<T, S>& a) {
        out << a[0];
        for (int i = 1, n = S; i < n; i++) out << " \n"[out.format > 1] << a[i];
        return out;
    }
    template <class T>
    friend Printer& operator <<(Printer& out, const std::vector<T>& a) {
        if (!a.empty()) out << a[0];
        for (int i = 1, n = a.size(); i < n; i++) out << " \n"[out.format > 0] << a[i];
        return out;
    }
};

Scanner in(stdin);
Printer out(stdout);

using ll = long long;

const int nax = 1e5+5;
int e[nax], mx[nax];

int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
void unite(int x, int y) {
	x = get(x), y = get(y);

	if (e[x] > e[y]) swap(x, y);
	e[x] += e[y]; e[y] = x; mx[x] = max(mx[x], mx[y]);
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N; in >> N;

	for(int i = 0; i < N; i++) {
		in >> mx[i];
		e[i] = -1;
	}

	V<AR<int, 3>> E; for(int i = 0; i < N - 1; i++) {
		int u, v; in >> u >> v; --u, --v;
		E.pb({max(mx[u], mx[v]), u, v});
	}

	sort(begin(E), end(E));

	ll ans = 0;
	for(auto& [w, u, v] : E) {
		ans += mx[get(u)] + mx[get(v)];
		unite(u, v);
	}

	out << ans << nl;

	exit(0-0);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 4820 KB Output is correct
2 Correct 9 ms 4184 KB Output is correct
3 Correct 9 ms 4180 KB Output is correct
4 Correct 10 ms 4816 KB Output is correct
5 Correct 15 ms 4820 KB Output is correct
6 Correct 15 ms 4820 KB Output is correct
7 Correct 13 ms 4820 KB Output is correct
8 Correct 12 ms 4816 KB Output is correct
9 Correct 8 ms 4184 KB Output is correct
10 Correct 13 ms 4816 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 14 ms 4820 KB Output is correct
7 Correct 9 ms 4184 KB Output is correct
8 Correct 9 ms 4180 KB Output is correct
9 Correct 10 ms 4816 KB Output is correct
10 Correct 15 ms 4820 KB Output is correct
11 Correct 15 ms 4820 KB Output is correct
12 Correct 13 ms 4820 KB Output is correct
13 Correct 12 ms 4816 KB Output is correct
14 Correct 8 ms 4184 KB Output is correct
15 Correct 13 ms 4816 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 4 ms 3100 KB Output is correct
22 Correct 3 ms 3096 KB Output is correct
23 Correct 15 ms 4816 KB Output is correct
24 Correct 11 ms 4820 KB Output is correct
25 Correct 11 ms 4820 KB Output is correct
26 Correct 7 ms 3928 KB Output is correct
27 Correct 8 ms 4184 KB Output is correct
28 Correct 15 ms 4816 KB Output is correct
29 Correct 8 ms 3928 KB Output is correct
30 Correct 16 ms 4820 KB Output is correct