제출 #922343

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
922343		Shayan86	Sjekira (COCI20_sjekira)	C++14	110 / 110	27 ms	3168 KiB

sjekira

#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// Ofast, O0, O1, O2, O3, unroll-loops, fast-math, trapv

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define Mp          make_pair
#define sep         ' '
#define endl        '\n'
#define F	        first
#define S	        second
#define pb          push_back
#define all(x)      (x).begin(),(x).end()
#define kill(res)	cout << res << '\n', exit(0);
#define set_dec(x)	cout << fixed << setprecision(x);
#define fast_io     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io     freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout);

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll N = 1e5 + 50;
const ll Mod = 1e9 + 7;

ll n, t[N];

int main(){
    fast_io;

    cin >> n;

    ll res = 0, mx = 0;
    for(int i = 1; i <= n; i++){
        cin >> t[i];
        res += t[i]; mx = max(mx, t[i]);
    }
    res -= mx;

    int u, v;
    for(int i = 1; i < n; i++){
        cin >> u >> v;
        res += max(t[u], t[v]);
    }

    cout << res;

}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 30 / 30
• Subtask 4: 60 / 60