Page 2 of 4

Posted: Mon Jun 07, 2004 9:55 pm
by Dominik Michniewski
If I correct remeber you must remeber, that data can contain tests like one, in which after Acc goes next submission of this problem ... (it should be rejected without penalty if I remember)

Best regards
DM

Hi

Posted: Tue Jun 08, 2004 1:37 pm
by sumankar
See what I do to tackle that is:
I set a counter for each problem, for each team, and increase
it every time they have a 'N'-ot accepted run, and when it
is accepted, a 'Y' that is, I would calculate the time, plus the
penalty for previous bad tries, and set the counter to a value
'SOLVED' so that I don't touch it again.Now that hopefully takes
care of what you mentioned, doesn't it?

Thanks a lot for your reply.Can I ask for some i/o?

Regards,
Suman.

Posted: Tue Jun 08, 2004 4:07 pm
by Dominik Michniewski
I agree with you ... it should be OK

DM

Hi

Posted: Tue Jun 08, 2004 5:26 pm
by sumankar
Well would you like a look at my code ?

Suman.

Posted: Mon Aug 30, 2004 3:07 am
by Ryan Pai
Just adding this because the problem description was not very descriptive:

Assume that every team with a number between 1 and T exists, where T is the largest team number in the input case.

If a team has multiple submissions at the same contest time, consider all off the Y's to happen after the N's.

Posted: Sat Oct 16, 2004 12:49 pm
by abhijit
Let me know whether this problem has multiple input sets.
Also, a lot of sample I/O please.

" If a team has multiple submissions at the same contest time, consider all off the Y's to happen after the N's. "

Is this really important ??

Posted: Sun Oct 17, 2004 11:28 pm
by Dominik Michniewski
Of cours, it's important.
Consider such situation:
- team, at the same time, sends 4 submissions and give TLE,ACC,WA,RTE.

You must consider that problem is solved with fourth not second atempt.

Best regards
DM

Posted: Mon Oct 18, 2004 12:57 pm
by abhijit
But how can they expect us to know this when its not mentioned in the problem description. Its just an assumption on our part which we can't make.

If indeed it is so, the problem setters are requested to mention it in the problem description.

Posted: Mon Oct 18, 2004 2:44 pm
by Dominik Michniewski
I found such hint in one of the threads for this problem

Best regards
DM

PS. Alternative solution should reject all submisions after got Acc, but how could you check which of them are first (consider that in logs are only information about end of run of program, so if first comes programs which have a long running time, thay could stop after solution which will be accepted ...)

Posted: Wed Oct 20, 2004 1:22 pm
by abhijit
Ok, thanks.
i'll try to change my program as you say.

Abhijit

790 - Head Judge Headache

Posted: Sat Jul 02, 2005 6:43 am
by Jan
Hey, I have solved it but got several wrong answers. And I have some question on this.

1. The output of consecutive cases should be seperated by blank line or not?
2. The output pattern. The numbers are printed in left justified form or not?
3. I considered that the input terminates with a blank line or EOF. Am I right?

I have tested many cases but cannot figure out why I m gettin WA. Can anyone post some test cases?

Thanks.

Posted: Wed Jul 06, 2005 11:13 pm
by Jan
Can anyone describe the input file pattern of this problem.

Thanks.

Posted: Tue Jul 12, 2005 9:20 pm
by Jan
Got Accepted.

:D

Posted: Tue Jul 12, 2005 9:21 pm
by Jan
Accepted at last.

Thanks.

Posted: Sat Aug 06, 2005 5:10 am
by flavio
Hi Jan!!

What was wrong in your code?
I'm currently getting WA :(

I don't know what is my mistake!

Thanks!