oj.uz

Submission #866358

# Submission time Handle Problem Language Result Execution time Memory
866358 2023-10-26T01:40:53 Z vjudge1 Sjekira (COCI20_sjekira) C++14
110 / 110
 7 ms 1844 KB 
#include<algorithm>
#include<cstdio>
namespace IO{
	const int ARR_SIZE=1<<20;
	#define gc() ((IO::si!=IO::ti||(IO::ti=(IO::si=IO::input)+fread(IO::input,1,IO::ARR_SIZE,stdin))),IO::si!=IO::ti?*(IO::si++):EOF)
	#define pc(ch) ((IO::o.so!=IO::o.to||(fwrite(IO::o.output,1,IO::ARR_SIZE,stdout),IO::o.so=IO::o.output)),*(IO::o.so++)=ch)
	char input[ARR_SIZE],*si=input,*ti=input;
	struct Output_Stream{
		char output[ARR_SIZE],*so=output,*to=output+ARR_SIZE;
		~Output_Stream(){
			if(so==output)return;
			fwrite(output,1,so-output,stdout);
			so=output;
		}
	}o;
	template<typename T>
	void read(T&num){
		int ch=gc();
		num=0;
		while(ch<48||ch>57)ch=gc();
		while(ch>=48&&ch<=57)num=(num<<3)+(num<<1)+(ch^48),ch=gc();
	}
	template<typename T>
	void write(T a){
		static int ch[50],cnt=0;
		if(a==0)pc('0');
		while(a)ch[++cnt]=a%10|48,a/=10;
		while(cnt)pc(ch[cnt--]);
	}
}
using IO::read;
using IO::write;
typedef long long ll;
const int maxn=100000;
int n,t[maxn+1];
int mx;
ll ans;
int main(){
	read(n);
	for(int i=1;i<=n;i++){
		read(t[i]);
		mx=std::max(mx,t[i]);
		ans+=t[i];
	}
	ans-=mx;
	for(int i=1,x,y;i<n;i++){
		read(x),read(y);
		ans+=std::max(t[x],t[y]);
	}
	write(ans),pc('\n');
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 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 6 ms 1628 KB Output is correct
2 Correct 4 ms 1628 KB Output is correct
3 Correct 4 ms 1516 KB Output is correct
4 Correct 5 ms 1628 KB Output is correct
5 Correct 7 ms 1628 KB Output is correct
6 Correct 7 ms 1624 KB Output is correct
7 Correct 6 ms 1628 KB Output is correct
8 Correct 5 ms 1720 KB Output is correct
9 Correct 4 ms 1628 KB Output is correct
10 Correct 7 ms 1844 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 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 0 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1628 KB Output is correct
7 Correct 4 ms 1628 KB Output is correct
8 Correct 4 ms 1516 KB Output is correct
9 Correct 5 ms 1628 KB Output is correct
10 Correct 7 ms 1628 KB Output is correct
11 Correct 7 ms 1624 KB Output is correct
12 Correct 6 ms 1628 KB Output is correct
13 Correct 5 ms 1720 KB Output is correct
14 Correct 4 ms 1628 KB Output is correct
15 Correct 7 ms 1844 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 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 2 ms 860 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 7 ms 1628 KB Output is correct
24 Correct 5 ms 1628 KB Output is correct
25 Correct 5 ms 1628 KB Output is correct
26 Correct 3 ms 1624 KB Output is correct
27 Correct 4 ms 1668 KB Output is correct
28 Correct 5 ms 1624 KB Output is correct
29 Correct 3 ms 1372 KB Output is correct
30 Correct 7 ms 1624 KB Output is correct