Codemaster
Open in Telegram
💯% Working Solution Provider of any Codechef Contest Very Trustable
Show more5 799
Subscribers
No data24 hours
-127 days
-7330 days
Posts Archive
5 799
Dm me for all Atlassian , phone pe,linkedin,Sprinker,
Amazon dublin, Flipkart , wells Fargo, orecale , MasterCard, Uber , BNY Mellon,
Edelweiss ,Deshaw ,Trilogy, Winzo , tenstorrent, media . Net etc
🎉🎉
DM me if anyone needs help @av7678
5 799
void solve(){
ll n;cin>>n;
vli v(n);
ll odd=0,even=0;
for(int i=0; i<n; i++)cin>>v[i];
vector<ll>e,o;
vector<ll>ans(n,-1);
for(auto i: v){
if(i%2!=0){
odd++;
o.push_back(i);
}
else {
even++;
e.push_back(i);
}
}
if(even%2 != 0){
cout<<"-1";
}
else if(odd%2 != 0){
cout<<"-1";
}
else{
sort(e.begin(),e.end());
sort(o.begin(),o.end());
vector<int>oddcnt(odd),evencnt(even);
int k = 0;
for(auto z:o){
oddcnt[k] = z;
k += 2;
if(k >= odd) k = 1;
}
k = 0;
for(auto z:e){
evencnt[k] = z;
k += 2;
if(k >= even) k = 1;
}
int itr = 0;
for(int z=0; z<odd; z+=2){
ans[itr] = (oddcnt[z] + oddcnt[z+1])/2;
ans[itr + (n/2)] = abs(oddcnt[z] - oddcnt[z+1])/2;
itr++;
}
for(int z=0; z<even;z+=2){
ans[itr] = (evencnt[z] + evencnt[z+1])/2;
ans[itr+(n/2)] = abs(evencnt[z] - evencnt[z+1])/2;
itr++;
}
for(auto h: ans){
cout<<h<<" ";
}
}
}
Div 2 C
5 799
Dm me for all Atlassian , phone pe,linkedin,Sprinker,
Amazon dublin, Flipkart , wells Fargo, orecale , MasterCard, Uber , BNY Mellon,
Edelweiss ,Deshaw ,Trilogy, Winzo , tenstorrent, media . Net etc
🎉🎉
DM me if anyone needs help @av7678
