OJ Board

if you are solving it in java avoid TLE use TreeMap, the search is O(nlog2n) but when you end of append all the directory it is sorted, in other hand using hashmap hashset, and other tecniques, cause a TLE.

and of course use a buffer to print, don't print directly because the output is very large.

Ok, here are some test cases for this problem. Input 10 4 A B C D 6 a 0 b 1 c 2 d 3 e 4 f 5 9 0 A 0 D 1 A 1 B 2 B 2 C 3 C 4 A 5 A 4 A B C D 5 laptop B phone C pager B clock B comb X 3 B X X A X D 5 A B C D E 5 a 0 b 1 c 2 d 3 e 4 9 0 A 0 D 1 A 1 B 2 B 2 C 2 E 3 C 4 B 5 A B C D E 6 a C b C c C d C e ...

Hi, sorry to be the bearer of bad news, but again in judge queue, thanks for your attention.

Again in Judge Queue.

the test case have a mistake according the definition. The first line of each dataset contains two integers N and M, separated by a space ( ). The second line contains N pairs of integers , separated by spaces. The third line contains M pairs of integers , separated by spaces. so if you try to read ...

I dont now every body want to rotate the cube. it is a easy way to solve it, a very easy way. we have a cube, that is a great facilitator, for the problem. only see a ordinary cubic dice, the sum of your oposites sides is always seven, so if you are constructing one, and randomly generate the sides,...

mmm, anyone can say me what's wrong?? I'm getting WA, and I don't know why.... thanks #include <iostream> using namespace std; bool a=true; void print(char * linea){ //corregir int len=72, i, j, k; for(k=len;k>=0&&linea[k]!=' ';k--); for(j=k;j>=0&&linea[j]==' ';j--); for(i=0;i<=j;i++...

:-? I had a problem with my Browser, and occur a problem during the shipment, after this appeared a sign that mentions that the ID of the problem was incorrect, but the judge runs him, and even but, the judge takes it as a TLE, with time 0.000 and without any name for the problem. so at this moment ...

thank's for all.