Codeforces Round 966 Solution Discussion | ABCDEFGH | All Problems

[@aryanc403]

Codeforces blog with hints - codeforces.com/blog/entry/132628 Greedy does not work in F. It fails on sample itself. codeforces.com/contest/2000/submission/276318164 This is mainly because as score on a particular rectangle increases, the new delta cost decreases.

[@superhumans5687]

This is absolute legend, all others just solve 5 or 6 this guy solves all of them and explains too

[@kondekarvaishnavi2348]

You made E just awesome. Tq aryanc🥳🥳

[@JIGARSINGTHAKOR-yy6qp]

Mere me to gorila dikh hi nahi rahe thi jiski vajah se question hi samaj naii aya😅

[@guptafactory]

The problem statement was updated with that Gorilla grid at the very end. It would be beneficial, if pre-included in the statement.

[@hkrai1372]

will you upload recent atcoder contest solution?

[@akshatchaudhary9393]

thanks for the explanation

[@prateek6277]

Why does it fails ? D #include #define ll long long #define vl vector #define pb(x) push_back(x) #define all(x) x.begin(),x.end() #define fill(n,arr) for(int i=1;i>x;arr.pb(x);} #define rep(n) for(int i=0;i>n; vl arr; fill(n,arr); vector pre(n,0); pre[0]=arr[0]; for(int i=1;i>s; unsigned long long int ans=0; int i=0,j=n-1; while(i=j) break; if(i==0){ ans+=pre[j]; } else{ ans+=(pre[j]-pre[i-1]); } i++; j--; } cout

[@arthkulkarnihere7274]

D🙌