oj.uz

Submission #866349

# Submission time Handle Problem Language Result Execution time Memory
866349 2023-10-26T01:12:59 Z vjudge1 Sjekira (COCI20_sjekira) C++14
110 / 110
 23 ms 8496 KB 
#include<algorithm>
#include<cstdio>
#include<cstring>
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],p[maxn+1];
int head[maxn+1],total;
struct Edge{
	int to,next;
}e[(maxn-1)*2+1];
void add(const int u,const int v){
	e[++total]=Edge{v,head[u]};
	head[u]=total;
}
int fa[maxn+1],val[maxn+1],size[maxn+1];
ll ans;
int find(const int x){
	return x==fa[x]?x:fa[x]=find(fa[x]);
}
void merge(int x,int y){
	x=find(x),y=find(y);
	ans+=val[x]+val[y];
	if(size[x]>size[y]){
		fa[y]=x;
		val[x]=std::max(val[x],val[y]);
		size[x]+=size[y];
	}else{
		fa[x]=y;
		val[y]=std::max(val[y],val[x]);
		size[y]+=size[x];
	}
}
int main(){
	read(n);
	for(int i=1;i<=n;i++)read(t[i]);
	for(int i=1;i<=n;i++)p[i]=i;
	memcpy(fa+1,p+1,sizeof(int)*n);
	memcpy(val+1,t+1,sizeof(int)*n);
	for(int i=1;i<=n;i++)size[i]=1;
	std::sort(p+1,p+n+1,[](const int x,const int y){
		return t[x]<t[y];
	});
	for(int i=1,x,y;i<n;i++){
		read(x),read(y);
		add(x,y),add(y,x);
	}
	for(int i=1;i<=n;i++){
		const int u=p[i];
		for(int i=head[u];i;i=e[i].next){
			const int v=e[i].to;
			if(t[v]<t[u]||(t[v]==t[u]&&v<u))merge(u,v);
		}
	}
	write(ans),pc('\n');
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 7820 KB Output is correct
2 Correct 11 ms 7220 KB Output is correct
3 Correct 11 ms 7004 KB Output is correct
4 Correct 12 ms 7256 KB Output is correct
5 Correct 18 ms 8280 KB Output is correct
6 Correct 11 ms 8280 KB Output is correct
7 Correct 9 ms 8028 KB Output is correct
8 Correct 8 ms 7652 KB Output is correct
9 Correct 6 ms 6692 KB Output is correct
10 Correct 10 ms 8496 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4572 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 17 ms 7820 KB Output is correct
7 Correct 11 ms 7220 KB Output is correct
8 Correct 11 ms 7004 KB Output is correct
9 Correct 12 ms 7256 KB Output is correct
10 Correct 18 ms 8280 KB Output is correct
11 Correct 11 ms 8280 KB Output is correct
12 Correct 9 ms 8028 KB Output is correct
13 Correct 8 ms 7652 KB Output is correct
14 Correct 6 ms 6692 KB Output is correct
15 Correct 10 ms 8496 KB Output is correct
16 Correct 1 ms 4572 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 5 ms 5208 KB Output is correct
22 Correct 5 ms 5176 KB Output is correct
23 Correct 23 ms 8324 KB Output is correct
24 Correct 14 ms 7256 KB Output is correct
25 Correct 13 ms 7256 KB Output is correct
26 Correct 10 ms 6492 KB Output is correct
27 Correct 11 ms 6748 KB Output is correct
28 Correct 12 ms 7088 KB Output is correct
29 Correct 8 ms 6232 KB Output is correct
30 Correct 20 ms 8404 KB Output is correct