### It_Wasnt_Me's blog

By It_Wasnt_Me, history, 3 months ago,

Update 2: Thanks all for this support I have sent another email to Tripti and I have received my money. This show how codeforces community is strong

Hi all, I have made a problem In HackerEarth Jan 2022 and I still didn't receive my money

On 15 Dec, 2021(Yes it's been a long time !!!) Arpa sent an email to all problem setters with instructions on how to use the platform that we should write the problem.

Arpa was really friendly and was too helpful.

After the contest, I received email that I should fill a form to receive my money for January Easy Setting (my PayPal account link and details about the problems I set) After 2 months I didn't receive anything and emailed them and tried to contact billings@hackerearth.com(+Arvind Kumar Yadav) and got no response.

It's too sad that I can't get my money for the problem and I wish that no one in the future will face this like me.

Update: this is an image for all emails relate to invoice

Read more »

• +107

By It_Wasnt_Me, history, 16 months ago,

I tried to solve this problem in the contest but unfortunately I was getting WA on 6 tests

I thought that I had implementation bugs, after I read the tutorial I found that "Note that you cannot directly apply ternary search when searching for the optimal solution. Can you figure out why?"

Anyone know why ternary wont work here ? I guess that the function will always be something decreasing then increasing or always increasing, Am I right ?

my submission

Read more »

• +24

By It_Wasnt_Me, history, 23 months ago,

I wanted to upsolve some gyms that I virtual so I can solve some problems I couldn't in the past to see my progress.

But unfortunately I can't get all of them except 10 recent gyms

Is there any way to get all of them ?

Read more »

• +27

By It_Wasnt_Me, 2 years ago,

I've solved the problem using dijkstra then I found icecuber's submission 96123320

while floyd is $n^3$ and $n <= 1000$, the idea fit in time how that possible ?

aslo see this comment

Read more »

• +74

By It_Wasnt_Me, history, 2 years ago,

problem link

I'm trying to solve it using BIT (each index is a color) and dfs, the output for node 1 is correct with me I'm trying to do rerooting technique on the tree to get the answer for the rest of nodes.

any idea ?

Read more »

• +3

By It_Wasnt_Me, history, 2 years ago,

I tried to solve this problem and spend alot of time and all I got O(N*log^2N) solution (segment tree) which got TLE on it Polynomial Queries

simply the problem is about increase range (a, b) the 1st element by 1, 2nd by 2, and so on like arithmetic sequence and answering queries online

any help would be appreciated :-)

Read more »

• +16

By It_Wasnt_Me, 2 years ago,

Can anyone explain the solution of last problem in kickstart round B link to problem

It is really too hard ? Beacuse a lot of people didnt solve it

I have solved first subtask when h and w is less than 500 with direct dp solution Time complexity of this solution is W*H

But how to solve when H and W can be upto 1e5

Read more »

• -2

By It_Wasnt_Me, history, 3 years ago,

I submit this solution which its time complexity is n*k*log(n) 72309942 I got TLE on test 35

and the constrain in the problem 1077F2 - Pictures with Kittens (hard version) n <= 5000, k <= 5000

I have no idea why my solution is TLE, I think it should fit in the time, Any help ?

Read more »

• +8

By It_Wasnt_Me, 3 years ago,

https://codeforces.com/contest/195/problem/D I am so close to the solution but there is something that confuse me

the problem describe that $S(x)$ is sum of $n$ functions, the solution just use $F(x)$ for each line,

Should I consider $S(x)$ so I should sum all $k_i$ and $b_i$ ? https://codeforces.com/contest/195/submission/67170155 Anyone know why I am wrong?

Can anyone help me If he have explanation for the solution or explain the tutorial more because it is a bit unclear for me. :)

Read more »

• +3

By It_Wasnt_Me, history, 3 years ago,

552D - Vanya and Triangles in this problem, shortly you should count all number of triangles with non-zero area.

My idea was to count all triangle I could which is NC3 then I will subtract zero-area triangles

zero-area triangle will occur if there is 3 points on the same line(horizontal, vertical) or have same diagonal.

Unfortunately I received (Wrong answer) and I can't prove why my solution is wrong, I tested it on several testcases and it gives Right answer.

https://ideone.com/iiuxuP Any help

Read more »

• +6