View Clarifications

[ Contest Page | Scoreboard | Submissions | Clarifications | Help | Log In ]

ProblemClarification
General I/O?

Please use standard in and standard out!

Input --
C: scanf("%d %d", &integer1, &integer2);
C++: int x; cin >> x;

Output --
Java: System.out.println("asdf");
C: printf("%d %d", integer1, integer2);
C++: int x = 5; cout << x << endl;
General Java class names?

Please use the following class names (make sure classes are public):

Problem A - public class A { ... }
Problem B - public class B { ... }
. . .
General Why is D failing and then disappearing?

We have trouble with the checker, will have to judge D manually.
A - Bits and Pieces Why is my submission for A still not judged yet? It's been 15 min

I am sorry, but I was trying to keep up with the D's that were giving, in some cases, wrong verdicts.

Will do it shortly
F - Night Market In the first example in the problem statement there are 5 valid positions. Why is it not valid to place a truck vertically in the second to last column (or the third to last column)?

It is a good question - I guess the idea was that they can be parked only along the sidewalks (like the ones in the photo), I will add the clarification.
G - SpaceRecon Tournament Are the player names distinct?

I will tentatively say yes but will double check.
F - Night Market In the first example in the problem statement there are 5 valid positions. Why is it not valid to place a truck vertically in the second to last column (or the third to last column)?

Good observation. And we will divert the blame... or change the problem statement.

G - SpaceRecon Tournament For the given sample input, from how the problem is defined, shouldn't the output be
Jake
Joe
John
Jane
Is there a typo, or should Jane really be sorted before John?

D - Pieces and Bits Can you check your verifier on D? We suspect that our solution is right - we think we've verified our output data.

The verifier does not do much but check the conditions in the statement. I will double check it though.

It wasn't the verifier but the person doing verifying... Sonny can explain what I'm doing here. Sorry I missed that one.
General What are time/memory limits?

time is reasonable, 10 secs for most problems, 30 for B

Memory is the system memory.
D - Pieces and Bits Can you please explain if this is possible for N=3? Once you have two 0's and one 1, then you are stuck in a loop of size 5 no matter what you do... And there are 8 numbers possible, so we need to get into this loop, Thank you.

That is maybe why we say "even N"
F - Night Market The sample grids appear to be Lx(W-1), not LxW. Huh?

Huh, indeed. Consulting with the person that wrote it. And by "consulting" I mean "trying to get a hold of him"

The last submission threw this:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 14
at F.ok_down(F.java:55)
at F.main(F.java:35)
General What are the time and memory limits?

time is reasonable, 10 secs for most problems, 30 for B

Memory is the system memory.
F - Night Market The sample grids appear to be Lx(W-1), not LxW. Huh?

Fixed the problem statement. I was told that data is OK.
B - Happy 12 What is our compile error? It compiles locally with no warnings on our end.

[aleksicd@zone33ef Stanford1]\$ g++ -W -O2 PB_03.cc
PB_03.cc: In function ‘void Search(int*, unsigned char*)’:
PB_03.cc:66: error: ‘memset’ was not declared in this scope
PB_03.cc: In function ‘int Search2(int*, unsigned char*, unsigned char*)’:
PB_03.cc:99: error: ‘memset’ was not declared in this scope
D - Pieces and Bits Is the verifier still working for D?
I checked my solution on all possible test cases.

I am actually keeping up - yes, that is me, the verifier. When you submit, judge tags it as incorrect but then I go and check.

There are just 8 test cases, you can write your checker - just follow the description.
I think that most people are not concerned with uniqueness, but I'll take a look at yours.

Wrong Answer - 3 bits are the same

aaaaaaaa

can be represented as (aaaa)2, (aa)4, (a)8

I would guess (a)8 would be "the most compressed" one.
F - Night Market What does specification 4 mean? eg. in the 1st sample input, can a truck be placed at (0-indexed) (r,c) = {(0,1), (1,1)}? What about at {(0,3), (1,3)}?

No, it cannot "touch" the edge of the map.
D - Pieces and Bits One of our submissions for D has been unjudged for the past 5 minutes, and we think it may be messing up our current submissions.

Patience, little grashopper - you solved it in the first try - but checker is broken, judge marks it as incorrect, someone must rejudge it... well, long story, but mentioned at the beginning of the contest on this same page.
D - Pieces and Bits One of our submissions for D has been unjudged for the past 5 minutes, what's happening? :)

It times out compiling.. well, we don't have a time out for that, so it just sits there until I kill it. How about compression or something. gcc doesn't like 2MB source files :P

Ultra Cool Programming Contest Control Centre v1.8
Copyright (c) 2005-2010 by Sonny Chan