Tourist is at a point where 2nd place is also costing him some ratings!

Again, your confirmation doesn't guarantee it's not him, but I think no one minds if it's fun :D

They ask it in a sarcastic way. I'm not suggesting this for silly questions but many times people ask genuine questions about their ratings, divisions and stuff. So idea is whenever any feature is implemented Mike or someone else from the team writes a blog. They can just append that blog in help section.

Well, this blog vanished into oblivion. Does no one think it is useful? :(

At least they will have an idea and postpone the round.

Monogon has earned a total of 652 upvotes in this blog alone where the blog post is sitting at 414. (Also, you might think how free am I to do count such dumb shit. Guess what, you are right)

Participants after knowing that A is also not easy:

How weak is your argument? So what he should've said? Will it be available is his native language? Even if someone is bad at English it is mostly while talking and not listening or interpreting. It is like saying why do you want to watch soccer when you don't seem to play it well. LMAO.

Not after benching aleksig0d >,<

TBH, this meme has become boring now to see in every round post

Your profile picture correctly depicts you :)

Corornovirus stay winning

For e.g. replying to erfanaskari1

Yeah, that means you never did that ritual.

It's not yet April bro.

Just curious. Why not div1 this time?

Chennai Mathematical Institute

rajat1603

AnonymousBunny

DP99

ahh! I see, thanks

Nice concept but I think you are using tags of problems which are already known. I'm curious to know how will it work on the problems having no tags given already.

This might help.

Post the editorial please.

It was fast :D

I suspect that it is Undefined Behaviour. For test case 1 1, you pass 0, 0 as your arguments to the function rec(). It will return when y == 0 part without actually initialising vector V. So when you are executing this line fn(i,V.size()-1,0), V.size()-1 gives random big values and can be machine dependent.

EDIT: I was right. Solution. It passes after removing ambiguity I mentioned.

I hate his pretests

That wouldn't change the fact that team were affected. Pehle original account se comment kar then we will talk

Why are this all haters are ignoring the fact that it is true CC has rrally messed up experience of the candidates. Team ToLazyToPropagate was 2nd in kolkata regional but after changing AC to WA they are 3rd and might miss the chance to WF. If the judgement was right at that time they could have performed well to maintain their rank. Instead of saying he just wants contribution say CC gave him chance to do so and no one else had balls to put this up so he did. There is nothing wrong in it.

Then you might be knowing it already if you are from codechef, don't you?

Why system testing is late today? Any specific reason?

Sure it is. But you can see that in custom invocation as well, it gives right output and then terminates with runtime error. That's what I want to tell. Even if we use delete[] it still is accessible that's why printing right output.

Sorry, but I don't understand your point. Why would you write that after memory allocation? Your task is to delete the pointer to the array, right? There is only this thing: When we write delete[] for freeing memory it doesn't actually wipes it out. It creates a dangling pointer which we need to point to NULL. Anyway, here is what you said. It still gives a runtime error.

Because arr still exists in a memory as a dangling pointer. After delete[] arr you also need to write arr = NULL. Check here

Woah man! That's cool. +1 for your efforts :)

vintage_Vlad_Makeev's handle changing color in every post is kind of record lol.

Can you please tell me why standard approach won't work here? That is normal maxCost path.

Well, in either case I mentioned, I think you can solve this question using pretty standard approach which is DP. You start from (0, 0) and find the optimal path at each step. For reaching cell (x, y) [it is last cell], you first need to either reach (x-1, y) or (x, y-1) first. So recurrence relation can be maxCost[i][j] = max(maxCost[i-1][j], maxCost[i][j-1]) + cost[i][j]. Make sure you pre-calculate values for first row and fist column.

This is what came into my mind :D

Is it always sure that path from (0, 0) to (n-1, n-1) exists? I'm confused by "last cell". Is it last cell you can reach or (n-1, n-1) always?

It is not taking random key. It is wrapping up to the lower values again when exceeds it's limit.

Because when all the values of array are 1e6, value of s will 2*1e5*1e6 which exceeds int datatype. so when you are performing the check at if(mp[(s-a[i])/2]>0) , s — a[i] has already exceeded int's limit. That is why it wraps up again to lower values and gives incorrect result.

Is it true that SysTest of Educational/div3 round goes this long or is it only this contest? I just realised it today.

It's an on-site round. Under the supervision of course.

Mate, what do you want to say exactly? If you want to ask whether your comment is first verified by admins and then uploaded then it is not the case. If that would have been the case then some people wouldn't shit here anything they want.

Perfect deal doesn't exi....

Maybe he expected Weaker Test cases than ever?

Those who got hoodies, share the picture of it. I really want to see how it looks.

But why to use .txt at first place then? Use some editor with .cpp extension only and then directly submit that without running it.

I agree with your point regarding unbalanced Problem-set but everyone needs to admit that 2nd problem was really nice. I mean so simple it looks but has really nice corner cases.

What the hell!!! Your teammate's rage was too much!

Please post editorial in English as well.

Google translate has certain problems while displaying mathematical things.

See here

What is happening to the contest?

Yes, I'm also facing the same problem.

dafaq is insteading?

No

So it is rated now? Nice.

Ohh looks like yes. Is answer: YES AAABA

Damn man, what was the pretest 6 in C ;_;

Don't know how much truth is there in whatever you wrote but if it is true then it is friggin' awesome.

No :)

Instead of that I would ask for balanced problem-set. You know what happened in last few Educational rounds.

Well, where is the thanks to MikeMirzayanov and polygon platform XD

damn man really :(

Your username perfectly matches this scene xD

Please add editorials.

I would like to know about LHiC, SpyCheese and mnbvmar. Strange usernames :D

Am I the only one who misread the problem statement of B? I guess no.

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

It wasn't working earlier but then I switched to safe mode and again to normal mode and it worked. Thanks

Did that, not working

Did that as well but of no use :(

Yeah, doing it right now. But wanted to know in general. BTW I'm used to Firefox that's why.

*3Blue1Brown

Wow, aid one man army. Nice performance.

When will system testing happen?

Also for reading most of the comments I need to click on "here" all the time. Sign of something special gonna happen in this contest I guess (can be negative/positive) ;)

Hope no server/hardware problems will occur this time :)

This is not on main page yet. UPD: Now it is

When editorial will be posted?

There he strikes again, halyavin ;)

When editorial will be posted?

No, there is no additional score for successful hacking attempt in Educational Rounds Afaik

I think there is a mistake in Institute name of TheVindicators. It should be IIT Kharagpur instead of IIIT Kharagpur

This happened with me as well. It crashed after 4-5 contests. I'm using Ubuntu btw

Can anyone please tell me what is the problem in my 948A: https://imgur.com/a/DYoBP. Judge says Changed (1,2) from S to D. But it doesn't look like that. UPD: I found it. I considered it as a 1 based indexing first. Sorry!

I solved in increasing difficulty and won always :D. But in reality I can't :/ cries in corner

I guess it can be found easily in your account, isn't it?

Wow, one more streak of rated contests? Nice!

Wow, this round starts after my University exam. So no problem in attending. I wish everyone good ratings.

Please add editorial. It is very much needed now

editorial of 937C??