6 / 6
Jul 2010

Well, this problem remains here for years
Why do java (insert here something else applicable) submissions are treated the same way as C do?
It is obvious it would take more time to read and situation with problem that TLEs in java and ACs in C++ with almost the same code (anyways with the same idea) is really annoing

  • created

    Jun '10
  • last reply

    Jul '10
  • 5

    replies

  • 279

    views

  • 4

    users

  • 3

    links

there is no code which you can implement in java but not in c/c++ ( assuming most of the java programmers know c/c++ too ). so no point in increasing time limits for java /java based languages. moreover in my opinion, setting different time limits for different languages may cause problems concerning spoj judge system. also problem setters will have to set the language based limits again for around 6900 spoj problems.

Following that logic - why do we have to support 41 languages? Administration could remove all of them but ASM - all code would be compiled|interpreted as assembler instructions, after all. Main language I use during contests is java and it is very annoying after getting another TLE to think whether this is result of incorrect algo or slow I/O in java and should I spend 5-10 minutes more to rewrite my code, test and submit it again or better find algorithmic improvements. Same problems we can see not only with java.

AFAIK in many judges they use multiplication system - time limit for different languages is multiplied by some predefined constant. So problemsetters won't have any troubles and everything that should be changed is introducing such system and collecting some information to setup these constants.


hmmm.... that can be done smile. i think this problem has also been discussed earlier in the forum but admins haven't yet implemented any such thing.

22 days later

There was a lot of complaints about the speed of java (one can hardly solve anything, and bla bla bla) but then became the kawigi era.

On the other hand setting some multiplication system will cause "never ending" discussions about appropriate coefficient. But who knows, mayby ...., one day, as usually it depends also on the community.

By now, you can always check if anyone solved the problem in a language you consider. And if not, you can compare best solutions to the time limit - it should help to determine if there is a chance to pass the problem setter contraints.
Please also have a look at spoj.pl/problems/INTEST/1 problem and check if your codes are able to process large input data fast.

Anyway, if you belive that there is a very slow language/compiler/interpreter which is worth to be learned
please apply for the roblem/contest setter privilidges to create a dedicated problem set for this languge.