結果
| 問題 | No.957 植林 |
| ユーザー |
 eQe
|
| 提出日時 | 2022-07-22 02:14:24 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 432 ms / 2,000 ms |
| コード長 | 12,316 bytes |
| コンパイル時間 | 7,880 ms |
| コンパイル使用メモリ | 480,968 KB |
| 実行使用メモリ | 9,900 KB |
| 最終ジャッジ日時 | 2023-09-16 08:48:35 |
| 合計ジャッジ時間 | 18,015 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
4,380 KB |
| testcase_01 | AC | 2 ms
4,376 KB |
| testcase_02 | AC | 2 ms
4,380 KB |
| testcase_03 | AC | 23 ms
8,736 KB |
| testcase_04 | AC | 21 ms
8,444 KB |
| testcase_05 | AC | 22 ms
8,760 KB |
| testcase_06 | AC | 24 ms
9,156 KB |
| testcase_07 | AC | 23 ms
8,776 KB |
| testcase_08 | AC | 16 ms
8,752 KB |
| testcase_09 | AC | 16 ms
8,852 KB |
| testcase_10 | AC | 18 ms
9,104 KB |
| testcase_11 | AC | 18 ms
8,848 KB |
| testcase_12 | AC | 17 ms
8,688 KB |
| testcase_13 | AC | 14 ms
7,560 KB |
| testcase_14 | AC | 18 ms
9,480 KB |
| testcase_15 | AC | 16 ms
8,716 KB |
| testcase_16 | AC | 14 ms
7,676 KB |
| testcase_17 | AC | 15 ms
8,496 KB |
| testcase_18 | AC | 260 ms
8,728 KB |
| testcase_19 | AC | 277 ms
8,992 KB |
| testcase_20 | AC | 286 ms
9,216 KB |
| testcase_21 | AC | 303 ms
9,160 KB |
| testcase_22 | AC | 325 ms
9,276 KB |
| testcase_23 | AC | 322 ms
9,284 KB |
| testcase_24 | AC | 342 ms
9,316 KB |
| testcase_25 | AC | 432 ms
9,736 KB |
| testcase_26 | AC | 353 ms
9,656 KB |
| testcase_27 | AC | 355 ms
9,732 KB |
| testcase_28 | AC | 351 ms
9,632 KB |
| testcase_29 | AC | 365 ms
9,900 KB |
| testcase_30 | AC | 350 ms
9,636 KB |
| testcase_31 | AC | 265 ms
8,864 KB |
| testcase_32 | AC | 268 ms
8,996 KB |
| testcase_33 | AC | 282 ms
9,328 KB |
| testcase_34 | AC | 291 ms
9,020 KB |
| testcase_35 | AC | 314 ms
9,288 KB |
| testcase_36 | AC | 319 ms
9,288 KB |
| testcase_37 | AC | 331 ms
9,552 KB |
| testcase_38 | AC | 347 ms
9,588 KB |
| testcase_39 | AC | 348 ms
9,736 KB |
| testcase_40 | AC | 350 ms
9,592 KB |
| testcase_41 | AC | 14 ms
9,464 KB |
| testcase_42 | AC | 15 ms
9,332 KB |
| testcase_43 | AC | 20 ms
9,600 KB |
| testcase_44 | AC | 20 ms
9,460 KB |
| testcase_45 | AC | 2 ms
4,380 KB |
| testcase_46 | AC | 2 ms
4,380 KB |
| testcase_47 | AC | 1 ms
4,376 KB |
ソースコード
//#pragma GCC target("avx512f")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<atcoder/all>
#include<bits/stdc++.h>
#include<boost/multiprecision/cpp_int.hpp>
#define fin(...) exit(pp(__VA_ARGS__))
#define ep(...) emplace(__VA_ARGS__)
#define eb(...) emplace_back(__VA_ARGS__)
#define pb() pop_back()
#define ef(...) emplace_front(__VA_ARGS__)
#define pf(a) pop_front(a)
#define ei(...) else if(__VA_ARGS__)
#define el else
#define wh(...) while(__VA_ARGS__)
#define lb(...) lower_bound(__VA_ARGS__)
#define ub(...) upper_bound(__VA_ARGS__)
#define imx(...) max_element(al(__VA_ARGS__))
#define imn(...) min_element(al(__VA_ARGS__))
#define srt(...) sort(al(__VA_ARGS__))
#define rv(...) reverse(al(__VA_ARGS__))
#define un(a) srt(a);a.erase(unique(al(a)),end(a))
#define jo(a,b) copy(al(b),back_inserter(a))
#define ov3(a,b,c,d,...) d
#define ov4(a,b,c,d,e,...) e
#define ov5(a,b,c,d,e,f,...) f
#define ov6(a,b,c,d,e,f,g,...) g
#define bg begin
#define rbg rbegin
#define al1(v) bg(v),end(v)
#define al2(v,b) bg(v),bg(v)+b
#define al3(v,a,b) bg(v)+a,bg(v)+b
#define al(...) ov3(__VA_ARGS__,al3,al2,al1)(__VA_ARGS__)
#define rl1(v) rbg(v),rend(v)
#define rl2(v,b) rbg(v),rbg(v)+b
#define rl3(v,a,b) rbg(v)+a,rbg(v)+b
#define rl(...) ov3(__VA_ARGS__,rl3,rl2,rl1)(__VA_ARGS__)
#define rp1(b) for(ll ii=0;ii<(ll)(b);ii++)
#define rp2(i,b) for(ll i=0;i<(ll)(b);i++)
#define rp3(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rp4(i,a,b,c) for(ll i=(ll)(a);i<(ll)(b);i+=(ll)(c))
#define rp(...) ov4(__VA_ARGS__,rp4,rp3,rp2,rp1)(__VA_ARGS__)
#define pr1(a) rp(a)
#define pr2(i,a) for(ll i=(ll)(a)-1;i>=0;i--)
#define pr3(i,a,b) for(ll i=(ll)(a)-1;i>=(ll)(b);i--)
#define pr4(i,a,b,c) for(ll i=(ll)(a)-1;i>=(ll)(b);i-=(ll)(c))
#define pr(...) ov4(__VA_ARGS__,pr4,pr3,pr2,pr1)(__VA_ARGS__)
#define fe1(a) rp(len(a))
#define fe2(a,v) for(au&&a:v)
#define fe3(a,b,v) for(au&&[a,b]:v)
#define fe4(a,b,c,v) for(au&&[a,b,c]:v)
#define fe5(a,b,c,d,v) for(au&&[a,b,c,d]:v)
#define fe(...) ov5(__VA_ARGS__,fe5,fe4,fe3,fe2,fe1)(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;ln(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;ln(__VA_ARGS__)
#define ST(...) str __VA_ARGS__;ln(__VA_ARGS__)
#define UL2(n,a) u1 a(n);ln(a)
#define UL3(n,a,b) u1 a(n),b(n);ln(a,b)
#define UL4(n,a,b,c) u1 a(n),b(n),c(n);ln(a,b,c)
#define UL5(n,a,b,c,d) u1 a(n),b(n),c(n),d(n);ln(a,b,c,d)
#define UL6(n,a,b,c,d,e) u1 a(n),b(n),c(n),d(n),e(n);ln(a,b,c,d,e)
#define UL(...) ov6(__VA_ARGS__,UL6,UL5,UL4,UL3,UL2)(__VA_ARGS__)
#define UV2(n,a) u1 a(n);vn(a)
#define UV3(n,a,b) u1 a(n),b(n);vn(a,b)
#define UV4(n,a,b,c) u1 a(n),b(n),c(n);vn(a,b,c)
#define UV5(n,a,b,c,d) u1 a(n),b(n),c(n),d(n);vn(a,b,c,d)
#define UV6(n,a,b,c,d,e) u1 a(n),b(n),c(n),d(n),e(n);vn(a,b,c,d,e)
#define UV(...) ov6(__VA_ARGS__,UV6,UV5,UV4,UV3,UV2)(__VA_ARGS__)
#define DL2(n,a) v1<ld>a(n);ln(a)
#define DL3(n,a,b) v1<ld>a(n),b(n);ln(a,b)
#define DL4(n,a,b,c) v1<ld>a(n),b(n),c(n);ln(a,b,c)
#define DL5(n,a,b,c,d) v1<ld>a(n),b(n),c(n),d(n);ln(a,b,c,d)
#define DL(...) ov5(__VA_ARGS__,DL5,DL4,DL3,DL2)(__VA_ARGS__)
#define DV2(n,a) v1<ld>a(n);vn(a)
#define DV3(n,a,b) v1<ld>a(n),b(n);vn(a,b)
#define DV4(n,a,b,c) v1<ld>a(n),b(n),c(n);vn(a,b,c)
#define DV5(n,a,b,c,d) v1<ld>a(n),b(n),c(n),d(n);vn(a,b,c,d)
#define DV(...) ov5(__VA_ARGS__,DV5,DV4,DV3,DV2)(__VA_ARGS__)
#define ok(a) assert(a)
#define I template
#define J class
#define oo operator
#define rr return
#define ss struct
#define uu using
#define au auto
#define bk break
#define cs const
#define ct continue
#define endl "\n"
uu namespace atcoder;
uu namespace std;
uu namespace boost::multiprecision;
uu ll=long long;
uu ld=long double;
uu str=string;
uu bo=bool;
uu vo=void;
uu is=istream;
uu os=ostream;
vo abc();
int main(){abc();}
str sp=" ",nc="",nl="\n";
I<J T>uu v1=vector<T>;
I<J T>uu v2=v1<v1<T>>;
I<J T>uu v3=v1<v2<T>>;
I<J T>uu v4=v1<v3<T>>;
I<J T>uu mset=multiset<T>;
I<J T>uu fn=function<T>;
I<J T,J U>ss cp{
T a;U b;
cp():a(T()),b(U()){}
cp(T a,U b):a(a),b(b){}
cp oo+()cs{rr*this;}
cp oo-()cs{rr cp(-a,-b);}
cp&oo++(){a++,b++;rr*this;}
cp&oo--(){a--,b--;rr*this;}
cp oo++(int){cp r=*this;++*this;rr r;}
cp oo--(int){cp r=*this;--*this;rr r;}
cp&oo+=(cs cp&c){a+=c.a;b+=c.b;rr*this;}
cp&oo-=(cs cp&c){a-=c.a;b-=c.b;rr*this;}
cp&oo*=(cs cp&c){a*=c.a;b*=c.b;rr*this;}
cp oo+(cs cp&c)cs{rr cp(*this)+=c;}
cp oo-(cs cp&c)cs{rr cp(*this)-=c;}
cp oo*(cs cp&c)cs{rr cp(*this)*=c;}
cp&oo+=(cs T&d){a+=d;b+=d;rr*this;}
cp&oo-=(cs T&d){a-=d;b-=d;rr*this;}
cp&oo*=(cs T&d){a*=d;b*=d;rr*this;}
cp oo+(cs T&d)cs{rr cp(*this)+=d;}
cp oo-(cs T&d)cs{rr cp(*this)-=d;}
cp oo*(cs T&d)cs{rr cp(*this)*=d;}
bo oo==(cs cp&c)cs{rr a==c.a and b==c.b;}
bo oo!=(cs cp&c)cs{rr!(*this==c);}
bo oo<(cs cp&c)cs{rr a!=c.a?a<c.a:b<c.b;}
bo oo>(cs cp&c)cs{rr a!=c.a?a>c.a:b>c.b;}
bo oo<=(cs cp&c)cs{rr!(*this>c);}
bo oo>=(cs cp&c)cs{rr!(*this<c);}
friend is&oo>>(is&i,cp&c){rr i>>c.a>>c.b;}
friend os&oo<<(os&o,cs cp&c){rr o<<c.a<<sp<<c.b;}
};
uu u1=v1<ll>;
uu u2=v1<u1>;
uu u3=v1<u2>;
uu u4=v1<u3>;
uu cl=cp<ll,ll>;
uu ql=queue<ll>;
uu sl=set<ll>;
uu msl=mset<ll>;
uu ml=map<ll,ll>;
uu mnt=modint998244353;
ss edg{ll t,w;edg(){}edg(ll t,ll w=1):t(t),w(w){}};
uu graph=v2<edg>;
ll inf=3e18;
ld pi=acosl(-1);
ld ee=1e-10;
str first(bo t=1){rr t?"first":"second";}
str First(bo t=1){rr t?"First":"Second";}
str yes(bo t=1){rr t?"yes":"no";}
str Yes(bo t=1){rr t?"Yes":"No";}
str YES(bo t=1){rr t?"YES":"NO";}
str no(){rr "no";}
str No(){rr "No";}
str NO(){rr "NO";}
str possible(bo t=1){rr t?"possible":"impossible";}
str Possible(bo t=1){rr t?"Possible":"Impossible";}
str POSSIBLE(bo t=1){rr t?"POSSIBLE":"IMPOSSIBLE";}
ll bt(ll a){rr 1LL<<a;}
ll ppc(ll a){rr __builtin_popcountll(a);}
I<J T>ll len(cs T&a){rr size(a);}
I<J T>T sq(T a){rr a*a;}
I<J T>uu hpmx=std::priority_queue<T>;
I<J T>uu hpmn=std::priority_queue<T,v1<T>,greater<T>>;
ll at(ll S,ll i){rr S>>i&1;}
I<J T>T at(cs v1<T>&v,ll i){ll n=len(v);rr v[(i%n+n)%n];}
I<J T>ll sgn(cs T&a){rr(a>ee)-(a<-ee);}
I<J T>ll sgn(cs T&a,cs T&b){rr sgn(a-b);}
I<J T>au&oo+(v1<T>&v){rr v;}
I<J T>au&oo-(v1<T>&v){fe(x,v)x=-x;rr v;}
I<J T>au&oo++(v1<T>&v){fe(x,v)x++;rr v;}
I<J T>au&oo--(v1<T>&v){fe(x,v)x--;rr v;}
I<J T>au oo++(v1<T>&v,int){au r=v;++v;rr r;}
I<J T>au oo--(v1<T>&v,int){au r=v;--v;rr r;}
I<J T,J U>au&oo+=(v1<T>&v,cs U&a){fe(x,v)x+=a;rr v;}
I<J T,J U>au&oo-=(v1<T>&v,cs U&a){fe(x,v)x-=a;rr v;}
I<J T,J U>au&oo*=(v1<T>&v,cs U&a){fe(x,v)x*=a;rr v;}
I<J T>au&oo+=(v1<T>&v,cs v1<T>&u){rp(i,len(v))v[i]+=u[i];rr v;}
I<J T>au&oo-=(v1<T>&v,cs v1<T>&u){rp(i,len(v))v[i]-=u[i];rr v;}
I<J T>au&oo*=(v1<T>&v,cs v1<T>&u){rp(i,len(v))v[i]*=u[i];rr v;}
I<J T,J U>au oo+(v1<T>v,cs U&a){rr v+=a;}
I<J T,J U>au oo-(v1<T>v,cs U&a){rr v-=a;}
I<J T,J U>au oo*(v1<T>v,cs U&a){rr v*=a;}
I<J T>au oo+(v1<T>v,cs v1<T>&u){rr v+=u;}
I<J T>au oo-(v1<T>v,cs v1<T>&u){rr v-=u;}
I<J T>au oo*(v1<T>v,cs v1<T>&u){rr v*=u;}
I<J T,J U>bo amx(T&a,cs U&b){rr a<b?a=b,1:0;}
I<J T,J U>bo amn(T&a,cs U&b){rr a>b?a=b,1:0;}
I<J T>T mx(cs v1<T>&a){rr *imx(a);}
I<J T>T mn(cs v1<T>&a){rr *imn(a);}
I<J T>au mx(cs v2<T>&a){rr mx(*imx(a));}
I<J T>au mn(cs v2<T>&a){rr mn(*imn(a));}
I<J...T>au mx(T...a){rr max(initializer_list<common_type_t<T...>>{a...});}
I<J...T>au mn(T...a){rr min(initializer_list<common_type_t<T...>>{a...});}
I<J T>ll agmx(cs v1<T>&a){rr imx(a)-bg(a);}
I<J T>ll agmn(cs v1<T>&a){rr imn(a)-bg(a);}
I<J T,J...A>T gcd(cs T&a,cs A&...b){rr gcd(a,gcd(b...));}
I<J T>T sm(cs v1<T>&a){rr accumulate(al(a),T(0));}
I<J T>ll lbs(cs v1<T>&a,cs T&b){rr lb(al(a),b)-bg(a);}
I<J T>ll ubs(cs v1<T>&a,cs T&b){rr ub(al(a),b)-bg(a);}
I<J T,J U>au mnmx(cs T&a,cs U&b){rr cp(mn(a,b),mx(a,b));}
I<J T,J U>au mnmx(cs cp<T,U>&p){rr mnmx(p.a,p.b);}
I<J T>vo emplace_front(v1<T>&v,T x=0){v.ep(bg(v),x);}
I<J T>vo pop_front(v1<T>&v){v.erase(bg(v));}
I<J X,J Y>au mp(cs fn<Y(X)>&f,v1<X>x){v1<Y>y;fe(a,x)y.eb(f(a));rr y;}
I<J T,J U>au kys(cs map<T,U>&m){v1<T>r;fe(k,z,m)r.eb(k);rr r;}
I<J T,J U>au vls(cs map<T,U>&m){v1<U>r;fe(z,v,m)r.eb(v);rr r;}
u1 io(ll n,ll a=0){u1 i(n);iota(al(i),a);rr i;}
ss z{z(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(10);}}z;
is&oo>>(is&i,mnt&x){ll t;i>>t;x=t;rr i;}
os&oo<<(os&o,cs mnt&x){rr o<<x.val();}
I<J T,J U>is&oo>>(is&i,pair<T,U>&p){rr i>>p.first>>p.second;}
I<J T,J U>os&oo<<(os&o,cs pair<T,U>&p){rr o<<p.first<<sp<<p.second;}
I<J T>is&oo>>(is&i,v1<T>&v){fe(x,v)i>>x;rr i;}
I<J T>os&oo<<(os&o,cs v1<T>&v){fe(x,v)o<<x<<(&x==&*rbg(v)?nc:sp);rr o;}
I<J T>os&oo<<(os&o,cs v2<T>&v){fe(x,v)o<<x<<(&x==&*rbg(v)?nc:nl);rr o;}
I<J T>os&oo<<(os&o,cs set<T>&s){fe(x,s)o<<x<<(&x==&*rbg(s)?nc:sp);rr o;}
I<J T>os&oo<<(os&o,cs mset<T>&s){fe(x,s)o<<x<<(&x==&*rbg(s)?nc:sp);rr o;}
I<J T,J U>os&oo<<(os&o,cs map<T,U>&m){fe(p,m)o<<p<<(&p==&*rbg(m)?nc:nl);rr o;}
I<J T>os&oo<<(os&o,queue<T>q){wh(len(q))o<<q.front()<<sp,q.pop();rr o;}
I<J T>os&oo<<(os&o,deque<T>q){wh(len(q))o<<q.front()<<sp,q.pop_front();rr o;}
I<J T>os&oo<<(os&o,hpmx<T>q){wh(len(q))o<<q.top()<<sp,q.pop();rr o;}
I<J T>os&oo<<(os&o,hpmn<T>q){wh(len(q))o<<q.top()<<sp,q.pop();rr o;}
ll pp(){cout<<endl;rr 0;}
I<J T,J...A>ll pp(cs T&a,cs A&...b){cout<<a;((cout<<sp<<b),...);rr pp();}
I<J...T>vo ln(T&...a){(cin>>...>>a);}
I<J...T>vo vn(ll i,T&...a){(cin>>...>>a[i]);}
I<J T,J...A>vo vn(v1<T>&a,A&...b){rp(i,len(a))vn(i,a,b...);}
I<J T>vo rs(v1<T>&v,ll n){v.resize(n);}
I<J T,J...A>vo rs(v1<T>&V,ll n,cs A&...a){rs(V,n);fe(v,V)rs(v,a...);}
I<J T,J U>vo fl(T&x,cs U&a){x=a;}
I<J T,J U>vo fl(v1<T>&V,cs U&a){fe(v,V)fl(v,a);}
vo gn(u2&g,ll m,bo d=1){rp(i,m){LL(a,b);a--;b--;g[a].eb(b);if(d)g[b].eb(a);}}
vo gn(graph&g,ll m,bo w=1,bo d=1){
rp(i,m){
LL(a,b);a--,b--;ll c=1;if(w)ln(c);
g[a].eb(b,c);if(d)g[b].eb(a,c);
}
}
vo tn(u2&g,bo d=1){gn(g,len(g)-1,d);}
vo tn(graph&g,bo w=1,bo d=1){gn(g,len(g)-1,w,d);}
vo zzp(cs u1&v,u1&h){fe(x,h)x=lbs(v,x);}
I<J...T>vo zzp(cs u1&v,u1&h,T&...t){zzp(v,h);zzp(v,t...);}
I<J...T>u1 zp(T&...a){u1 v;fe(e,{a...})jo(v,e);un(v);zzp(v,a...);rr v;}
I<J T>vo zvs(cs u1&o,v1<T>&a){au c=a;rp(i,len(a))a[i]=c[o[i]];}
I<J T,J...A>vo zvs(cs u1&o,v1<T>&a,A&...b){zvs(o,a);zvs(o,b...);}
I<J...T>au vs(cs fn<bo(ll,ll)>&f,T&...a){
ll n=0;fe(e,{a...})n=len(e);
u1 o=io(n),p(n);
sort(al(o),f);
rp(i,n)p[o[i]]=i;
zvs(o,a...);
rr cp(o,p);
}
I<J T>T bs(cs fn<bo(T)>&j,T o,T n){
T d=(T)ee?ee:1;
wh(abs(o-n)>d)(j((o+n)/2)?o:n)=(o+n)/2;
rr o;
}
I<J T>au zt(v1<T>a){rp(i,1,len(a))a[i]+=a[i-1];rr a;}
I<J T>au mb(v1<T>a){pr(i,len(a),1)a[i]-=a[i-1];rr a;}
I<J T>au zt(v2<T>a){fe(v,a)v=zt(v);rp(i,1,len(a))a[i]+=a[i-1];rr a;}
I<J T>au mb(v2<T>a){fe(v,a)v=mb(v);pr(i,len(a),1)a[i]-=a[i-1];rr a;}
vo wf(u2&d){ll n=len(d);rp(k,n)rp(i,n)rp(j,n)amn(d[i][j],d[i][k]+d[k][j]);}
I<J T>T exq(ll n,T r,T x){wh(n){if(n&1)r*=x;x*=x;n/=2;}rr r;}
u1 dvs(ll n){ml m;rp(i,1,n/i+1)if(n%i==0)m[i]++,m[n/i]++;rr kys(m);}
ml fct(ll n){ml m;rp(i,2,n/i+1)wh(n%i==0)m[i]++,n/=i;if(n>1)m[n]++;rr m;}
ll mow(ll x,ll n,ll m=inf){ll r=1;wh(n){if(n&1)r*=x,r%=m;x*=x,x%=m,n/=2;}rr r;}
ll mnv(ll a,ll m){
ll b=m,u=1,v=0;
wh(b)u-=a/b*v,swap(u,v),a-=a/b*b,swap(a,b);
rr(u%m+m)%m;
}
ll sqr(ll x){ll r=sqrtl(x)-1;wh(r+1<=x/(r+1))r++;rr r;}
ll lg2(ll n){ll r=0;wh(n){n/=2;r++;}rr r;}
u1 dx={-1,0,1,0,-1,1,1,-1};
u1 dy={0,-1,0,1,-1,-1,1,1};
I<J S,cs fn<S(S,S)>&op,cs fn<S()>&e>ss sgt{
ll n,A,log;
v1<S>d;
sgt(ll n):sgt(v1<S>(n,e())){}
sgt(cs v1<S>&v):n(len(v)){
log=lg2(n*2-1)-1;
A=bt(log);
d=v1<S>(A*2,e());
rp(i,n)d[i+A]=v[i];
pr(i,A,1)upd(i);
}
vo upd(ll k){d[k]=op(d[k*2],d[k*2+1]);}
vo set(ll p,S x){ok(0<=p and p<n);p+=A;d[p]=x;rp(i,1,log+1)upd(p>>i);}
vo add(ll p,S x){ok(0<=p and p<n);set(p,get(p)+x);}
S get(ll p)cs{ok(0<=p and p<n);rr d[p+A];}
S aprod(){rr d[1];}
S prod(ll l,ll r){
ok(0<=l and l<=r and r<=n);
S sml=e(),smr=e();
l+=A,r+=A;
wh(l<r){if(l&1)sml=op(sml,d[l++]);if(r&1)smr=op(d[--r],smr);l/=2,r/=2;}
rr op(sml,smr);
}
friend os&oo<<(os&o,cs sgt&s){rp(i,s.n)o<<s.get(i)<<(i==s.n-1?nc:sp);rr o;}
};
vo abc(){
LL(H,W);
u2 g;rs(g,H,W);ln(g);
UL(H,r);
UL(W,c);
u1 sr(H),sc(W);
rp(i,H)rp(j,W)sr[i]+=g[i][j],sc[j]+=g[i][j];
mf_graph<ll>G(H+W+2);
ll S=H+W,T=H+W+1;
rp(i,H)G.add_edge(i,T,sr[i]),G.add_edge(S,i,r[i]);
rp(j,W)G.add_edge(S,j+H,c[j]);
rp(i,H)rp(j,W)G.add_edge(j+H,i,g[i][j]);
pp(sm(r)+sm(c)-G.flow(S,T));
}