shubhanshu's blog

Felicity IIIT H
By shubhanshu, 11 years ago, In English

Hey!

I would like to invite you all to participate in CodeCraft , Optimust conducted by IIIT Hyderabad.

CodeCraft 2013



The online ACM style programming competition is all set to start on 17th February, 2013. It is an Individual Contest. Like past contests, we hope to have an interesting problemset which we hope that you guys will enjoy solving.

Registrations for the online event "Codecraft" are open. Check it out at feli.co/cc

Check your Timezone(NOTE : Time updated)


Optimust 2013



Compete against top coders from around the world to write the most efficient and the smallest of codes! Optimust tests your memory , time and code optimization skills. You are required to solve simple problems online, in constrained time and space.Event Timings 16th February, 2013

Registrations for the online event "Optimust" are open. Check it out at feli.co/opt

Check your Timezone


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

»
11 years ago, # |
← Rev. 2   Vote: I like it +5 Vote: I do not like it

Why Gordian Knot did not start? Every time I load it's page on the Portal, it says "Error!".

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

    Gordian Knot has not started yet . The portal will be fixed soon . :D

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

contest timing has been changed because of clash with cook-off on codechef .

→ Reply
»
11 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

delete

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

The portal is unable to load . The page says : "[Uh oh!] The Server Seems To Be Misbehaving You might want to go to our portal home if your are lost. Or you might want to go back to the previous page " Seems like too much load on the servers.

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

For the problem "Tickets" , I tried the following algo:
For each i , the number of pairs with first element as i will be equal to the number of elements strictly greater than A[i] plus the number of elements lying between the position of the first strictly greater element and i.
I implemented this using stack and overall complexity being O(N) .
However this gave a WA . Can anybody tell me the mistake in this algorithm ?

Code : http://ideone.com/tfAats

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

The codecraft should have been started, should't it?

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

    Codecraft has started .

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

      The site just keeps crashing. I can't even comment on Question 1 to get a clarification.

      The question says to output something and the output shown outputs something else.

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

        Are you facing the same problem now? It's working pretty fine.

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

2 hours left for Codecraft!! http://feli.co/cc

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

How to solve ISRANK? I couldn't figure out a solution with the right complexity.

By the way, will upsolving be enabled?

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

    The authors will give solutions to your doubts shortly. To post any doubts and feedback visit http://feli.co/cc_doubt and post it. We would love to hear from you and answer your doubts.

    → Reply
»
11 years ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

we have uploaded non-trivial problems on spoj .

http://www.spoj.com/problems/DEXTER/

http://www.spoj.com/problems/NAIVELOK/

http://www.spoj.com/problems/XMEN/

http://www.spoj.com/problems/CHAOS_CC/

http://www.spoj.com/problems/RDRUG/

http://www.spoj.com/problems/COLOR_CC/

http://www.spoj.com/problems/ISRANK/

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

    they are certainly not trivial at all, idk how to make XMEN going on freaking O(nlogn) i am starting to cry

    DEXTER and COLOR_CC destroyed me

    and NAIVELOK showed me that i don't know anything about DP nor naive formulas

    → Reply