Comments
-8

Hoping the pretests for D are strong.
-48

.
0

Is this still rated because the queue has been stuck for a long time now ?
0

https://codeforces.me/contest/1535/submission/118439439 Can someone tell me why this is giving WA ?
+20

speedforces
0

Yes. C1 could be done by DP though.
On AmShZ → Codeforces Round #722, 5 years ago
+9

You can take atmost one positive
+24

Is it just me who keeps coming back every hour to see if any rated contest has been scheduled ?
+8

You will get MLE because final answer can be equal to 5*10^17 which needs to be stored in long long int. 2*5000*5000*8 contiguous allocation is not possible (In case you used DP).
0

rahulpkvij
0

Thanks for this !

0

It really sucks not being able to solve Div2 D’s consistently even after practicising a lot.

0

Is it possible to solve D using priority queue ??
0

https://codeforces.me/contest/1516/submission/113875265 Can someone explain why this code gets Accepted for problem C instead of giving TLE ?. The approach is same as in the editorial but for the case when the array has all even elements,I am just removing one element from the array every time and calling the subset sum DP to check if it is a good array. This should take (100)*(100)*(100000)[1e9] operations to do but it still passes the test cases....
+6

How to solve C ?
0

How to solve D ?
+26

I feel so stupid now
+4

How to solve D ?
0

I can't understand why the number of edges considered in problem D would be O(N) ? We are also rejecting the edges forming a cycle which takes O(1) time with DSU. Can somebody please help me understand.
0

When will problem ratings for this contest be updated ?
+3

Haha, okay. I tried thinking of some random solution too...Didn't work !
0

What did you do ?
0

How to solve Div2 E ?
0

Try using stack !
0

Okay thank you ! Got it !
0

Is your solution a Bruteforce ? What is its time complexity ?
+1

Any hints for Div2 D ?
0

I believe that the case where we need to move left more than once consecutively won't arise.
0

Hmm, that should be an issue here. I don't know why it passed all test cases.
0

Thanks ! Got it Accepted !
0 
ll rec(ll idx, ll moves, ll lmoves, vector<ll>& arr, vector<ll>& psum, vector< vector< vector<ll> > >& dp){
    if(moves == 0){
        return 0;
    }
    if(lmoves == 0){
        return psum[min(idx + moves,(ll)arr.size()-1)] - psum[idx];
    }
    if(dp[idx][moves][lmoves] != -1){
        return dp[idx][moves][lmoves];
    }
    ll ans = 0;
    if(idx + 1 < arr.size()){
        ll v1 = arr[idx+1] + rec(idx + 1,moves-1,lmoves,arr,psum,dp);
        ans = v1;
    }
    if(idx - 1 >= 0){
        ll v2 = arr[idx-1] + rec(idx - 1,moves-1,lmoves-1,arr,psum,dp);
        ans = max(ans,v2);
    }
    dp[idx][moves][lmoves] = ans;
    return ans;
}

How do I reduce space complexity of this DP solution for B ?
+30

Shitty pretests for Div2 D.
0

Can anyone please tell why my code gives WA for test 2 of 3rd problem : https://pastebin.com/3wdiELqp https://codingcompetitions.withgoogle.com/kickstart/round/000000000019ffc8/00000000002d83dc
On Sulfox → Codeforces Round #635, 6 years ago
0

Congrats to you too !
On Sulfox → Codeforces Round #635, 6 years ago
0

Solved ABCD in a Div 2 contest for the first time !! :D
On Sulfox → Codeforces Round #635, 6 years ago
0

I did the same thing and got Accepted.
On Sulfox → Codeforces Round #635, 6 years ago
+3

Div 2C : Here's what I did — Perform simple dfs to find the depth of each node(d[i]) and to find the number of nodes lying below each node(n[i]). Now, choose k nodes with largest value of d[i] — n[i] and mark them as industries. Then, simply find the answer with another dfs.
0

I think I finally got it !. We need to sort on the basis of starting points AND ending points in order to avoid unnecessary checks where one segment is contained inside the other. We break the process when we reach n intersections
0

Hey ! Thank you for your reply !. I guess I am unable to understand how in the editorial we are finding all pairs of intersections in less than O(n^2) time.

+3

SMH...I did the same thing but was still getting WA :(. Thanks for your reply though !
0

How to solve First Problem ?
0

https://codeforces.me/contest/1278/submission/75598239 Can someone please help me figure out why my code gives TLE on TEST 49 for problem D? It would be a huge help ! Thanks in advance!
0

Thank you !
On C137 → New year challenges, 6 years ago
0

Finally reached my goal on 26th March,2020. Now the goal is to become Candidate Master before 2021 ! Let's go !
+7

Finally became Expert on Codeforces !!
+4

It was pretty clear from the problem statement itself that two same and adjacent species could have different colours. You should maybe try and read the problem carefully than complain.
+1

For me all m1,m2,m3 worked just fine !

0

Thank you ! I will be much more careful now while estimating complexities !
0

Thanks for you reply ! I kind of now understand where I went wrong with the calculation. Any source where I can learn how to estimate the required time complexity properly ?
0

Why does O(NK) work for DIV2 B ? Can anyone provide a source where I can learn how to estimate the required time complexity properly ... I thought that O(NK) wouldn't work for B because N was given as 2* 10^5 and K <= N and thus couldn't come up with a solution.
0

Auto comment: topic has been updated by rahulpkvij (previous revision, new revision, compare).
0

Here's what I did : Sort all vertices by their degree in descending order. Now, starting from the vertice with the maximum degree, try and fill all its unfilled edges with numbers in a serial manner( Maintain a count variable. Fill edges with the count variable and increment it everytime you fill an edge )
0

Can someone explain why the order (i<j) won't matter in problem D ??
0

Thank you for your reply !. Can you elaborate "If there's any nodes being separated after that" a little please ?

0

Can someone explain what the purge function is doing in the solution of DIV2 D and why we are doing it ? Thanks in advance !
0

https://codeforces.me/contest/1307/submission/71438968 Can anyone please tell why my code is giving RUNTIME ERROR on testcase 6 ?
0

Ohh Okay. But this got me very confused and thus wasted a lot of my time.
0

In Problem B of DIV2. the problem statement mentioned that the string can be "REORDERED" and not "REVERSED" but my code was failing the first testcase here : https://codeforces.me/contest/1304/submission/71145055
On nvmdava → Codeforces Round #618, 7 years ago
0

How to solve Div2. C ??
0

Thank you so much ! I found out why my code was failing and corrected it. Got Accepted ! :)
0

Thank you !
0

Thank you so much !!
0

Thank you so much !
0

Hack for B ?
On C137 → New year challenges, 7 years ago
0

My goal for 2020 is to reach expert level on Codeforces (+1600). I want to achieve this by June. Let's see if I can do it. I'll try my best.
On MofK → Codeforces Round #601, 7 years ago
0

What was the required time complexity for DIV2 c ?
-14

what is the penalty for wrong submission in this contest ? 50 or 10 points ?
+20

Why has rating not been updated on my account ?
+3

When will the ratings be updated for this contest ?