Search found 13 matches

by padrinoIJ
3 years ago
Forum: Problem set
Topic: 3407 - Statistics
Replies: 2
Views: 669
Gender: None specified

Re: 3407 - Statistics

No soy un experto en Python pero creo que el multiplicador de TLE para Python esta un poco bajo para este problema, el mismo codigo en C++ con scanf/printf me da AC en 141 ms y en Python se va en tiempo en Test 0, por favor revisen y diganme, gracias
by padrinoIJ
3 years ago
Forum: Problem set
Topic: 2723 - Small Sums
Replies: 3
Views: 780
Gender: None specified

Re: 2723 - Small Sums

Creo que deberían volver a redactar este problema, pues me parece que la traducción al inglés está un poco incoherente. :?:
by padrinoIJ
4 years ago
Forum: Problem set
Topic: 3237 - Bob and Multi-Function Prime-Lock
Replies: 5
Views: 886
Gender: None specified

Re: 3237 - Bob and Multi-Function Prime-Lock

En la competencia nos dio TLE en el 8 usando backtracking, nunca vimos la via de usar bfs... :shock:
by padrinoIJ
7 years ago
Forum: 2012
Topic: 2012 Caribbean Local Contest
Replies: 0
Views: 5245
Gender: None specified

2012 Caribbean Local Contest

Excellent contest (2012 ACM-ICPC Caribbean Local Contests), I see more partipation and preparation that others years, interesting problem set, congratulations to the winners and classified teams to the National Contest, We see in Mtzas, bye :D
by padrinoIJ
7 years ago
Forum: Problem set
Topic: 1285 - Final Standings
Replies: 3
Views: 682
Gender: None specified

Re: 1285 - Final Standings

You can solve to this problem using stable_sort (algorithm) and with a simple overload of operator for compare, the code function is here:

Code: Select all

stable_sort( init , end, comp() );
Regards padrino_IJ, :P
by padrinoIJ
7 years ago
Forum: Problem set
Topic: 1618 - Positions
Replies: 5
Views: 801
Gender: None specified

Re: 1618 - Positions

Thanks by suggestions, greetings ;)
by padrinoIJ
7 years ago
Forum: Problem set
Topic: 1618 - Positions
Replies: 5
Views: 801
Gender: None specified

Re: 1618 - Positions

WHY???? Time limited exceeded for a simple problem, b = (a+b>=n) ? n - a : b+1; with this code i have received tle test 1, but my friend with this same code received AC months ago, lately the server is having problems... two short code solutions give me TLE, please, read this post and answer me, I ...
by padrinoIJ
7 years ago
Forum: Problem set
Topic: 1285 - Final Standings
Replies: 3
Views: 682
Gender: None specified

Re: 1285 - Final Standings

For this problem, classical bubble sort implementation is slow, you should use a faster method that the BS, but with same principle, regards, carlos
by padrinoIJ
7 years ago
Forum: Algorithms
Topic: Topological Sort Algorithm
Replies: 3
Views: 2501
Gender: None specified

Re: Topological Sort Algorithm

frankr wrote:you cant train your implementation of that algorithm doing this problem:
http://coj.uci.cu/24h/problem.xhtml?abb=1040
;)
Thanks you by the suggestions, frankr :P
by padrinoIJ
7 years ago
Forum: Algorithms
Topic: Binary Search Tree
Replies: 1
Views: 1754
Gender: None specified

Re: Binary Search Tree

This is my implementation of how to insert in an BST in C++(i solve the problem 1855 with these idea :lol: ), i wait his suggestions, padrino_IJ, struct TreeNode{ TreeNode *rigthPtr; TreeNode *leftPtr; long num; }; typedef TreeNode TREENODE; typedef TREENODE* TREENODEPTR; void insert(TREENODEPTR *tr...

Go to advanced search