790 - Head Judge Headache
Moderator: Board moderators
-
- Guru
- Posts: 834
- Joined: Wed May 29, 2002 4:11 pm
- Location: Wroclaw, Poland
- Contact:
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
Best regards
DM
If you really want to get Accepted, try to think about possible, and after that - about impossible ... and you'll get, what you want ....
Born from ashes - restarting counter of problems (800+ solved problems)
Born from ashes - restarting counter of problems (800+ solved problems)
Hi
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.
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.
-
- Guru
- Posts: 834
- Joined: Wed May 29, 2002 4:11 pm
- Location: Wroclaw, Poland
- Contact:
Hi
Well would you like a look at my code ?
Suman.
Suman.
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.
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.
I'm always willing to help, if you do the same.
-
- Guru
- Posts: 834
- Joined: Wed May 29, 2002 4:11 pm
- Location: Wroclaw, Poland
- Contact:
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
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
If you really want to get Accepted, try to think about possible, and after that - about impossible ... and you'll get, what you want ....
Born from ashes - restarting counter of problems (800+ solved problems)
Born from ashes - restarting counter of problems (800+ solved problems)
-
- Guru
- Posts: 834
- Joined: Wed May 29, 2002 4:11 pm
- Location: Wroclaw, Poland
- Contact:
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 ...)
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 ...)
If you really want to get Accepted, try to think about possible, and after that - about impossible ... and you'll get, what you want ....
Born from ashes - restarting counter of problems (800+ solved problems)
Born from ashes - restarting counter of problems (800+ solved problems)
790 - Head Judge Headache
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.
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.
Ami ekhono shopno dekhi...
HomePage
HomePage
Can anyone describe the input file pattern of this problem.
Thanks.
Thanks.
Ami ekhono shopno dekhi...
HomePage
HomePage