Submission #1044944

#TimeUsernameProblemLanguageResultExecution timeMemory
1044944vjudge1Pastiri (COI20_pastiri)C++17
0 / 100
124 ms37448 KiB
#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); vector<int> cev; for(int i=2;i<=k;i++){ int tut=dizi[i]+dizi[i-1]; if(tut&1){ cev.push_back(tut/2); cev.push_back(tut/2+1); } else{ cev.push_back(tut/2); } } cout<<cev.size()<<'\n'; for(auto x:cev){ cout<<x<<" "; } cout<<'\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...