oj.uz

Submission #328129

# Submission time Handle Problem Language Result Execution time Memory
328129 2020-11-15T12:33:51 Z hhhhaura Sjekira (COCI20_sjekira) C++14
110 / 110
 32 ms 3304 KB 
#include <bits/stdc++.h>
#pragma loop-opt(on)
#pragma GCC optmize("Ofast")

#define print(x) cout << #x <<" = " << x << endl
#define pprint(x) cout << #x <<" = (" << x.first << " , " << x.second <<" )\n"
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define ceil(a, b) ((a + b - 1) / b)
#define all(x) x.begin(), x.end()

#define MAXN 1000005
#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)

#define int long long int 
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())

using namespace std;
int n, aa, bb, mx, ans;
vector<int> a;
vector<pii> es;
int solve() {
	ans = mx = 0;
	rep(i, 1, n) mx = max(mx, a[i]), ans += a[i];
	rep(i, 0, n-2) {
		aa = es[i].first, bb = es[i].second;
		ans += max(a[aa], a[bb]);
	}
	ans -= mx;
	return ans;
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	cin >> n, a.resize(n + 1);
	rep(i, 1, n) cin >> a[i];
	rep(i, 1, n-1) cin >> aa >> bb, es.push_back(pii(aa, bb));
	cout << solve() <<"\n"; 
	return 0;
}

Compilation message

sjekira.cpp:2: warning: ignoring #pragma loop  [-Wunknown-pragmas]
    2 | #pragma loop-opt(on)
      | 
sjekira.cpp:3: warning: ignoring #pragma GCC optmize [-Wunknown-pragmas]
    3 | #pragma GCC optmize("Ofast")
      |

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 3176 KB Output is correct
2 Correct 19 ms 2028 KB Output is correct
3 Correct 18 ms 2028 KB Output is correct
4 Correct 21 ms 3048 KB Output is correct
5 Correct 30 ms 3288 KB Output is correct
6 Correct 31 ms 3304 KB Output is correct
7 Correct 27 ms 3176 KB Output is correct
8 Correct 27 ms 3176 KB Output is correct
9 Correct 16 ms 1900 KB Output is correct
10 Correct 30 ms 3304 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 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 0 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 0 ms 364 KB Output is correct
6 Correct 25 ms 3176 KB Output is correct
7 Correct 19 ms 2028 KB Output is correct
8 Correct 18 ms 2028 KB Output is correct
9 Correct 21 ms 3048 KB Output is correct
10 Correct 30 ms 3288 KB Output is correct
11 Correct 31 ms 3304 KB Output is correct
12 Correct 27 ms 3176 KB Output is correct
13 Correct 27 ms 3176 KB Output is correct
14 Correct 16 ms 1900 KB Output is correct
15 Correct 30 ms 3304 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 8 ms 1136 KB Output is correct
22 Correct 6 ms 1136 KB Output is correct
23 Correct 32 ms 3304 KB Output is correct
24 Correct 23 ms 3048 KB Output is correct
25 Correct 22 ms 3048 KB Output is correct
26 Correct 14 ms 1900 KB Output is correct
27 Correct 20 ms 1900 KB Output is correct
28 Correct 21 ms 3048 KB Output is correct
29 Correct 14 ms 1900 KB Output is correct
30 Correct 31 ms 3304 KB Output is correct