oj.uz

Submission #1044951

# Submission time Handle Problem Language Result Execution time Memory
1044951 2024-08-05T15:02:44 Z vjudge1 Pastiri (COI20_pastiri) C++17
0 / 100
 119 ms 30876 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define OYY LLONG_MAX
#define mod 998244353
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define lim 500005
#define fi first
#define se second

vector<int> v[lim];

int32_t main(){
	faster
	int n,k;cin>>n>>k;
	FOR{
		if(i==1)continue;
		int a,b;cin>>a>>b;
		v[a].push_back(b);
		v[b].push_back(a);
	}
	
	int dizi[k+1];
	
	for(int i=1;i<=k;i++){
		cin>>dizi[i];
	}
	
	sort(dizi+1,dizi+1+k);
	
	set<int> cev;
		
	for(int i=2;i<=k;i+=2){
		int tut=dizi[i]+dizi[i-1];
		if(tut&1){
			cev.insert(tut/2);
			cev.insert(tut/2+1);
		}
		else{
			cev.insert(tut/2);
		}
	}
	
	if(k&1){
		cev.insert(dizi[k]);
	}
	
	cout<<cev.size()<<'\n';
	
	for(auto x:cev){
		cout<<x<<" ";
	}
	
	cout<<'\n';
	
	return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 27728 KB Output is correct
2 Correct 72 ms 27728 KB Output is correct
3 Incorrect 66 ms 27732 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 12376 KB Sheep 3030 not protected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 12124 KB Sheep 16 not protected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 119 ms 30876 KB Sheep 54 not protected
2 Halted 0 ms 0 KB -