akulsareen's blog

Invitation to June Easy '17 on HackerEarth
By akulsareen, history, 8 years ago, In English

Hello Codeforces,

I invite you all to participate in HackerEarth's June Easy on the 2nd of June at 10:00 PM IST.

You will be given 6 problems to solve in 3 hours. The problem difficulty will be similar to that of a Div. 2 round on Codeforces. Each problem will be worth 100 points, but partial scoring is allowed so you can try to pass as many tests as you can.

The contest will be rated and will have prizes for the top 5 beginners.

The problems have been set by Anand Jaisingh (MazzForces) and tested by me (akulsareen). I would also like to thank HackerEarth admin, Arjit Srivastava (belowthebelt) for all his help.

Good Luck and Have Fun.

UPD: Contest has been extended by 1.5 hours

  • Vote: I like it
  • +16
  • Vote: I do not like it

»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

It would be that easy I guess ;) . Excited for the round

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Update :begins in an hour

→ Reply
»
8 years ago, # |
  Vote: I like it +21 Vote: I do not like it

RIP hackerearth's server ;(

→ Reply
»
8 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Solutions are in queue for more than one hour. Please look into the matter.

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

UPD: Contest has been extended by 1.5 hours

Then I suppose it's still rated, right ?

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    I don't think so. U may solve problems freely without worrying about the rating change.

    → Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +22 Vote: I do not like it

    It's unlikely at this point. The extent of the failure was too large.

    → Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Is the intended solution for Suarez line-sweep or there is something more efficient to solve it?

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I used a BIT + parallel binary search

    → Reply
  • »
    »
    8 years ago, # ^ |
    ← Rev. 2   Vote: I like it +5 Vote: I do not like it

    You can use sliding window and ordered_set to solve it.
    Btw I got wa because I outputted answers with space and got wa again because I was outputting 0 instead of -1(I found it after contest).

    → Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve Coutinho?

→ Reply