int ans=max(cnt-1,(t-1)/2);
t i guess is the count of the nodes with odd number of vertices and cnt is the number of components in the editorial
(t-1)/2 can unite the vertices with odd degree.
and -1 mayb because in EULER PATH 2 can be of odd degree
but where did the cnt-1 come from