#include #include using namespace std; namespace my{ #define eb emplace_back #define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__) #define RDVL(T,n,...) vec__VA_ARGS__;resizes({n},__VA_ARGS__);lin(__VA_ARGS__) #define VL(n,...) RDVL(ll,n,__VA_ARGS__) #define FO(n) for(ll ij=n;ij-->0;) #define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i=i##stop;i+=i##step) #define fe(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):a) #define ef(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):ranges::reverse_view(a)) #define base_operator(op,type) auto operator op(const type&v)const{auto copy=*this;return copy op##=v;} #define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{ void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<>{a...});} auto min(auto...a){return min(initializer_list>{a...});} templatestruct pair{ A a;B b; pair()=default; pair(A a,B b):a(a),b(b){} pair(const std::pair&p):a(p.first),b(p.second){} auto operator<=>(const pair&)const=default; pair operator+(const pair&p)const{return{a+p.a,b+p.b};} friend istream&operator>>(istream&i,pair&p){return i>>p.a>>p.b;} friend ostream&operator<<(ostream&o,const pair&p){return o<>auto&sort(auto&a,F f={}){ranges::sort(a,f);return a;} auto&unique(auto&a){sort(a).erase(ranges::unique(a).begin(),a.end());return a;} templatestruct infinity{ templateconstexpr operator T()const{return numeric_limits::max()/2*(1-is_negative*2);} templateconstexpr operator T()const{return static_cast(*this);} templateconstexpr bool operator==(T x)const{return static_cast(*this)==x;} constexpr auto operator-()const{return infinity();} templateconstexpr operator pair()const{return pair{*this,*this};} }; constexpr infinity oo; templateusing pack_back_t=tuple_element_t>; templateconcept vectorial=is_base_of_v::value_type>,remove_cvref_t>; templateconstexpr int rank(){if constexpr(vectorial)return rank()+1;else return 0;} templatestruct core_t_helper{using core_t=T;}; templatestruct core_t_helper{using core_t=typename core_t_helper::core_t;}; templateusing core_t=core_t_helper::core_t; templateistream&operator>>(istream&i,vector&v){fe(v,e)i>>e;return i;} templateostream&operator<<(ostream&o,const vector&v){fe(v,e)o<?newline:space);return o;} templatestruct vec; templatestruct tensor_helper{using type=vec::type>;}; templatestruct tensor_helper<0,T>{using type=T;}; templateusing tensor=typename tensor_helper::type; templatestruct vec:vector{ static constexpr int R=rank>(); using C=core_t; using vector::vector; vec(const vector&v){vector::operator=(v);} vec(const auto&...a)requires(sizeof...(a)>=3){resizes(a...);} void resizes(const auto&...a){*this=make(a...);} static auto make(ll n,const auto&...a){if constexpr(sizeof...(a)==1)return vec(n,array{a...}[0]);else return vec(n,make(a...));} vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;} vec&operator+=(const vec&u){vec&v=*this;assert(v.size()==u.size());fo(i,v.size())v[i]+=u[i];return v;} vec&operator-=(const vec&u){vec&v=*this;assert(v.size()==u.size());fo(i,v.size())v[i]-=u[i];return v;} base_operator(^,vec) base_operator(+,vec) base_operator(-,vec) vec&operator++(){fe(*this,e)++e;return*this;} vec&operator--(){fe(*this,e)--e;return*this;} ll size()const{return vector::size();} auto iota()const{vecr(size());std::iota(r.begin(),r.end(),0);return r;} auto pop_back(){auto r=this->back();vector::pop_back();return r;} auto lower_bound(const V&x)const{return std::lower_bound(this->begin(),this->end(),x);} ll arg_lower_bound(const V&x)const{return lower_bound(x)-this->begin();} auto scan(const auto&f)const{ pairr{}; if constexpr(!vectorial)fe(*this,e)r.b?f(r.a,e),r:r={e,1}; else fe(*this,e)if(auto s=e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s; return r; } auto sum()const{return scan([](auto&a,const auto&b){a+=b;}).a;} auto max()const{return scan([](auto&a,auto b){a>auto sort(F f={})const{vec v=*this;ranges::sort(v,f);return v;} template>auto stable_sort(F f={})const{vec v=*this;ranges::stable_sort(v,f);return v;} template>auto sort_index(F f={})const{const vec&v=*this;return iota().stable_sort([&](ll i,ll j){return f(v[i],v[j]);});} auto flatten()const{if constexpr(!vectorial)return*this;else{vecres;fe(*this,e)res^=e.flatten();return res;}} auto unique()const{auto res=flatten().sort();return my::unique(res);} auto zip_impl(const vec&v)const{ tensorres;res.reserve(size()); fe(*this,e){ if constexpr(vectorial)res.eb(e.zip_impl(v)); else res.eb(v.arg_lower_bound(e)); } return res; } auto zip()const{return zip_impl(unique());} auto transform(const auto&f)const{ tensorres(size()); if constexpr(vectorial)fo(i,size())res[i]=(*this)[i].transform(f); else std::transform(this->begin(),this->end(),res.begin(),f); return res; } vec abs()const{return transform([](auto e){return e<0?-e:e;});} vec parity()const{return transform([](auto e){return e&1;});} auto pos_groups(C M=-1)const{ assert(min()>=0); if(M==-1)M=max(); vec>res(M+1,0,0); fo(i,size())res[(*this)[i]].eb(i); return res; } auto matching_order(const vec&v)const{ assert(sort()==v.sort()); ll n=size(); auto c=(*this^v).zip(); vec>g(n); vecres(size()); of(i,n)g[c[i+n]].eb(i); fo(i,n)res[i]=g[c[i]].pop_back(); return res; } ll inversion()const{ ll res=0; atcoder::fenwick_trees(size()); ef(sort_index(),i){ res+=s.sum(0,i); s.add(i,1); } return res; } ll inversion(const vec&v)const{return matching_order(v).inversion();} }; templaterequires(sizeof...(A)>=2)vec(const A&...a)->vec>>; vec(ll)->vec; templatevoid resizes(const array::R+1>&s,A&...a){(apply([&](const auto&...b){a.resizes(b...); },s),...);} void lin(auto&...a){(cin>>...>>a);} void pp(const auto&...a){ll n=sizeof...(a);((cout<0,space)),...);cout<=median_right_index(N)); vecb(N); fo(i,N)b[i]=!parity(i); ll X=median_right_index(N); ll Y=a.inversion(b); // 10101010 or 1010101 if(even(N)){ auto pos1=a.pos_groups()[1]; // dp[i][j]:i個まで見て,00が登場済みかどうかの真偽値がjである列に1の位置を一致させるためのコストの最小値. vec dp(N+1,2,ll(oo)); dp[1][0]=pos1[0]; dp[1][1]=0; fo(i,1,N){ fo(j,2)if(dp[i][j]!=oo){ ll k=even(i)?i/2:i/2+!j; ll pre_x=j^odd(i); fo(x,2){ if(j&&(pre_x==0&&x==0))continue; ll nj=j|(pre_x==0&&x==0); if(x==0)amin(dp[i+1][nj],dp[i][j]); else amin(dp[i+1][nj],dp[i][j]+abs(i-pos1[k])); } } } amin(Y,dp[N].min()); } pp(X,Y); }}