phantom11's blog

By phantom11, 11 years ago, In English

I saw no blog on TCO Round 1A in codeforces.

So here are the information :

EDIT : UPDATED INFORMATION

  • Start time of the contest
  • Registrations begins 3 hours prior to start time and closes 5 minutes before.
  • Top 750 from this round will advance to round 2. There will 2 more rounds like this 1B and 1C.
  • Registrations are limited to first 2500 participants only.

Lets discuss problems here once the contest is completely finished.

UPDATE — The editorial of this round has been released. link

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

»
11 years ago, # |
  Vote: I like it +7 Vote: I do not like it

Can't launch the applet :(

»
11 years ago, # |
  Vote: I like it +7 Vote: I do not like it

looks like community.topcoder.com is not working. Also cannot connect.

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

    topcoder.com is accessible but community sub domain is not.

»
11 years ago, # |
Rev. 3   Vote: I like it +4 Vote: I do not like it

at first I couldn't enter the room.

then after deciding to relaunch the applet, I couldn't as well.

simply disappointing.

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

What's your guesses on how this happened? My guess is severe DDOS.

»
11 years ago, # |
Rev. 3   Vote: I like it +9 Vote: I do not like it

The round is delayed by 1 hour.

Updated time

EDIT:

I'm not sure if it will be delayed even more. There has been no updates from the admins...

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

    Admin Broadcast:

    Dear competitors! Unfortunately despite all our efforts we are not able to start today's round at 1 PM and we feel that postponing it further is not an option too. Therefore we decided to re-schedule the round to another date: April 12, at 12:00 UTC -4. TCO'14 Round 1B will be moved from April 12 to April 19 (the same time). SRM 617 will be moved from April 19 to another date which we will decide and announce as soon as possible. We sincerely apologize for the issues we had today! Please believe they are as disappointing to us as they may be to you (if not more).

»
11 years ago, # |
Rev. 3   Vote: I like it +24 Vote: I do not like it

How to solve 1000?

UPD Here is editorial of this round

  • »
    »
    11 years ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    I've reduced this problem to a game: for each switch the first player sets the type of it and the second player chooses if he'll use this switch. I've solved it using minimax, but my solution has failed systests. Seems that I have a minor bug.

    UPD. In fact, my solution is completely incorrect.

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

    Use only configurations NY, YN and YYY greedily (each of them by itself guarantees at least one lit lamp). I have no idea why it works though:)

»
11 years ago, # |
Rev. 3   Vote: I like it +39 Vote: I do not like it

i have a really cool solution to the 250 problem:

sort(s[1:N])
sort(s[0:L])
return s[0:L]