oj.uz

Submission #868663

# Submission time Handle Problem Language Result Execution time Memory
868663 2023-11-01T09:11:16 Z SmuggingSpun Sjekira (COCI20_sjekira) C++14
110 / 110
 19 ms 3132 KB 
#include<bits/stdc++.h>
#define taskname "paradigm"
using namespace std;
typedef long long ll;
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
		freopen(taskname".out", "w", stdout);
	}
	int n; cin >> n; ll ans = 0; vector<int>a(n); for(int& x : a) cin >> x, ans += x;
	for(int i = 1; i < n; i++){
		int u, v; cin >> u >> v; ans += max(a[u - 1], a[v - 1]);
	}
	cout << ans - *max_element(a.begin(), a.end());
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2260 KB Output is correct
2 Correct 12 ms 1884 KB Output is correct
3 Correct 12 ms 1884 KB Output is correct
4 Correct 13 ms 1884 KB Output is correct
5 Correct 19 ms 2760 KB Output is correct
6 Correct 19 ms 2900 KB Output is correct
7 Correct 16 ms 2396 KB Output is correct
8 Correct 15 ms 2396 KB Output is correct
9 Correct 10 ms 1624 KB Output is correct
10 Correct 18 ms 3132 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 15 ms 2260 KB Output is correct
7 Correct 12 ms 1884 KB Output is correct
8 Correct 12 ms 1884 KB Output is correct
9 Correct 13 ms 1884 KB Output is correct
10 Correct 19 ms 2760 KB Output is correct
11 Correct 19 ms 2900 KB Output is correct
12 Correct 16 ms 2396 KB Output is correct
13 Correct 15 ms 2396 KB Output is correct
14 Correct 10 ms 1624 KB Output is correct
15 Correct 18 ms 3132 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 5 ms 1112 KB Output is correct
22 Correct 4 ms 920 KB Output is correct
23 Correct 18 ms 2740 KB Output is correct
24 Correct 13 ms 2140 KB Output is correct
25 Correct 13 ms 1884 KB Output is correct
26 Correct 9 ms 1372 KB Output is correct
27 Correct 10 ms 1628 KB Output is correct
28 Correct 12 ms 1628 KB Output is correct
29 Correct 8 ms 1288 KB Output is correct
30 Correct 19 ms 2756 KB Output is correct