For a given input file, e.g. a file with a single byte 'a', there may be multiple shortest compressions. It seems like there should be a special judge. In the actual contest, no one solved this problem in 109 submissions, according to http://acm.up.pt/local/Historial/2003/stats-miup03.html
I suspect the local contest probably didn't have a special judge either.
909 - special judge needed?
Moderator: Board moderators
-
- Guru
- Posts: 1080
- Joined: Thu Dec 19, 2002 7:37 pm
No, that's not true. A single character can be outputted in only one way, and in general the shortest compression for any possible input is unique.
I fear something else went wrong while implemening this problem on the judge:
There can only be one inputfile. If the original dataset had multiple inputs, meant to be fed to the user program in separate runs of the judge, then concatenating them into one inpufile, will still result in just one case, because the user's program should treat the input as binary file, not as text file.
The output file should be treated as binary file by the judge, not as text file. Also the input file should not be converted from DOS to Unix, and no additional spaces and newlines should be added to it, unless the output is generated again.
I fear something else went wrong while implemening this problem on the judge:
There can only be one inputfile. If the original dataset had multiple inputs, meant to be fed to the user program in separate runs of the judge, then concatenating them into one inpufile, will still result in just one case, because the user's program should treat the input as binary file, not as text file.
The output file should be treated as binary file by the judge, not as text file. Also the input file should not be converted from DOS to Unix, and no additional spaces and newlines should be added to it, unless the output is generated again.
-
- Guru
- Posts: 724
- Joined: Wed Dec 19, 2001 2:00 am
- Location: Germany
-
- Guru
- Posts: 1080
- Joined: Thu Dec 19, 2002 7:37 pm
-
- Guru
- Posts: 1080
- Joined: Thu Dec 19, 2002 7:37 pm
-
- System administrator
- Posts: 1286
- Joined: Sat Oct 13, 2001 2:00 am
- Location: Valladolid, Spain
- Contact:
I forgot to say that I'm on the way.....I started it last sunday, but I couldn't finish it. Then I didn't have enough time during the week....I'll finish it as soon as I can.
By the way, little joey, can you mail me your solution? Judge handles binary files ok, but I'm afraid that ftp was made in ascii mode.....so judge's answer is not valid now![:P](./images/smilies/icon_razz.gif)
By the way, little joey, can you mail me your solution? Judge handles binary files ok, but I'm afraid that ftp was made in ascii mode.....so judge's answer is not valid now
![:P](./images/smilies/icon_razz.gif)
Actually, it means that a special judge should be made for every problem that allows multiple answer. That special judge is usually made by the problemsetter, but, for problem 909, as we don't have it we have to make it. It was our gault that we didn't realize it was a multiple answer program before we put it online.MaVa wrote:So what did this mean?
Does every program with multiple answes need a special judge?
Will such a judge come or must we guess how the solution output is generated.
DON'T PM ME --> For any doubt, suggestion or error reporting, please use the "Contact us" form in the web.