Search found 20 matches
- Thu Sep 21, 2006 11:20 am
- Forum: Volume 110 (11000-11099)
- Topic: 11081 - Strings
- Replies: 35
- Views: 23810
For those who keep on getting TLE... I just reallized that my algorithm ( which was also O( 2 * n^3 ) ) kept on getting TLE just beacuse I used C++ strings. I usually scanf into a buffer and than write something like: string s = buff; In my code, I only used the [] operator and it was TLE. Then, ins...
- Tue Sep 05, 2006 1:02 am
- Forum: Volume 110 (11000-11099)
- Topic: 11066 - Aragorn
- Replies: 7
- Views: 3676
- Fri Aug 25, 2006 12:44 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11065 - A Gentlemen's Agreement
- Replies: 19
- Views: 10060
Could someone write here the 6 intersection sets in the last example in the sample input? I only find 2 of them, no matter what I do ( I even searched for sets using O( 2^n ) algorithm ). Those I find are: 0 3 4 7 1 2 5 6 ( edit ) I realize my mistake now... I thought the first number was the number...
- Mon Aug 07, 2006 12:55 am
- Forum: Volume 110 (11000-11099)
- Topic: 11060 - Beverages
- Replies: 96
- Views: 47348
I had the same output when i did topological sort. This is the key sentence: In the case there is no relation between two beverages Dilbert should start drinking the one that appears first in the input. It means that because juice is the first drink in the input that isn't preceeded by some other dr...
- Sun Aug 06, 2006 11:21 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11061 - Playing War
- Replies: 41
- Views: 13522
- Sun Aug 06, 2006 11:07 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11061 - Playing War
- Replies: 41
- Views: 13522
- Sun Aug 06, 2006 10:56 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11061 - Playing War
- Replies: 41
- Views: 13522
- Sun Aug 06, 2006 10:52 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11061 - Playing War
- Replies: 41
- Views: 13522
- Tue May 16, 2006 7:13 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10574 - Counting Rectangles
- Replies: 23
- Views: 10972
- Tue May 16, 2006 10:07 am
- Forum: Volume 105 (10500-10599)
- Topic: 10574 - Counting Rectangles
- Replies: 23
- Views: 10972
I am also getting TLE, but my code runs in about 1.36 seconds for ten test cases where n = 5000 on my laptop. There are at most ten test cases, and at most 5000 points ( I've checked this ), so it should be ACC on the judge. I don't believe my laptop is 10 times faster than the judge server :) Here ...
- Fri Apr 07, 2006 1:43 pm
- Forum: Volume 1 (100-199)
- Topic: 190 - Circle Through Three Points
- Replies: 126
- Views: 34680
- Wed Apr 05, 2006 8:31 am
- Forum: Off topic (General chit-chat)
- Topic: How old are you? Statistics.
- Replies: 121
- Views: 190881
I am sixteen, well seventeen in three days ![:)](./images/smilies/icon_smile.gif)
Started actualy submiting about a year ago.
I've solved 400+ problems so far
http://acm.uva.es/cgi-bin/OnlineJudge?AuthorInfo:45377
![:)](./images/smilies/icon_smile.gif)
Started actualy submiting about a year ago.
I've solved 400+ problems so far
http://acm.uva.es/cgi-bin/OnlineJudge?AuthorInfo:45377
- Mon Mar 27, 2006 11:44 pm
- Forum: Volume 6 (600-699)
- Topic: 631 - Microzoft Calendar
- Replies: 11
- Views: 8073
631 Microzoft calendar - need some inputs/outputs!
I am trying to solve this problem, but I can't get ACC. I hate this kind of problems, but would really like to solve this one. (personaly, this is one of the most ugly problems I have ever seen) Please, post some inputs and clarifications ( if you can think of any ) because I am doing something wron...
- Wed Mar 22, 2006 1:07 am
- Forum: Volume 6 (600-699)
- Topic: 631 - Microzoft Calendar
- Replies: 11
- Views: 8073
- Mon Mar 20, 2006 10:06 am
- Forum: Volume 6 (600-699)
- Topic: 635 - Clock solitaire
- Replies: 8
- Views: 5108