vlade087's blog

USACO DEC 11
By vlade087, 13 years ago, In English
Hello everybody, I invite to participate in USACO monthly contest http://www.usaco.org/index.php?page=viewcontest is IOI style  without feedback.
greeting and  enjoy.
  • Vote: I like it
  • +5
  • Vote: I do not like it

13 years ago, # |
← Rev. 2   Vote: I like it -8 Vote: I do not like it
I just wrote it.
→ Reply
13 years ago, # |
← Rev. 3   Vote: I like it -11 Vote: I do not like it

Did anyone notice any bugs?

→ Reply
  • 13 years ago, # ^ |
      Vote: I like it +14 Vote: I do not like it
    I have noticed.
    Despite the fact that the tasks are nice it is one of the worst contests I have ever participated in. After submitting the solution to the problem I have seen the message: "Submitted; Wrong answer on the sample case". However, on my machine the code worked on the sample case perfectly, so I tried a lot of understandings of what "sample case" is and even wrote one more solution. Eventually, by some asserts I have figured out that the "sample case" is the same as in the statement. But if it is so why my answer (which is completely the same as in the statement) is incorrect?! I tried a lot of approaches to output the answer, actually nothing worked. Now, it seems like a rejudge. Now my status for this problem is "Submitted; sample case solved correctly" which proves that it was not my fault. Though my status is "sample solved correctly", it has killed a lot of my nerves and spoiled the whole contest. Really, don't want to participate in USACO anymore because of these "guess the reason of WA" games.
    → Reply
    • 13 years ago, # ^ |
      ← Rev. 4   Vote: I like it -8 Vote: I do not like it

      I also had this problem(sample was correct on my computer) and after 10+ submissions, five minutes before the end I found a bag in my programm :)

      → Reply
    • 13 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it
      The older contest system had more feedback implemented: hopefully these will be added next month, since the new system is still in development.
      → Reply
13 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Sorry, but one of the tasks from gold division is a very complicated and classic technique. It's good for some training contest, not for the real 3 hour contest...


I meant task Grass Planting. It was a straightforward application of heavy-light tree decomposition. No thinking, just coding and if somebody hasn't coded it before this is an awful task.

→ Reply
  • 13 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    There are easier ways to solve it even if you haven't seen heavy-light before. The problem is made more approachable by the fact that you can only query single edges of the tree.
    → Reply
    • 13 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it
      You put the same constraints on the query as on the planting in input section.
      → Reply
      • 13 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it
        maybe the problem wasn't entirely clear: it reads (in the english version at least): "Bessie will ask about how many patches of grass on a particular road"
        → Reply