Search found 147 matches
- Sun Dec 11, 2011 3:50 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10020 - Minimal coverage
- Replies: 57
- Views: 21783
Re: 10020 - Minimal Coverage
Judge data is week ,try submitting in TIMUS: http://acm.timus.ru/problem.aspx?space=1&num=1303
- Sat Nov 05, 2011 3:59 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11380 - Down Went The Titanic
- Replies: 19
- Views: 10631
- Tue Oct 25, 2011 11:09 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10938 - Flea circus
- Replies: 14
- Views: 8376
Re: 10938 - Flea circus
I hope the case below will help you if you get wa: 20 1 2 3 1 3 12 13 12 3 11 11 14 2 8 2 9 9 10 4 3 4 16 4 17 17 18 19 18 19 20 3 5 5 6 7 5 5 15 15 9 15 12 13 14 11 1 3 10 1 20 6 7 5 5 11 5 14 8 12 10 15 10 3 4 3 17 3 18 1 The fleas jump forever between 1 and 3. The fleas jump forever between 12 an...
- Tue Oct 25, 2011 7:11 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11512 - GATTACA
- Replies: 23
- Views: 10112
Re: 11512 - GATTACA
Why you need "Knuth-Moris-Pratt"? string length is 1000,a n^2 checking can do it for you.
- Fri Oct 14, 2011 11:38 pm
- Forum: Volume 7 (700-799)
- Topic: 719 - Glass Beads
- Replies: 41
- Views: 23153
Re: 719 - Glass Beads
With same code i got ac in spoj,live archive but getting TLE in uva. why??
- Sun Oct 09, 2011 6:59 pm
- Forum: Volume 114 (11400-11499)
- Topic: 11405 - Can U Win?
- Replies: 15
- Views: 7019
Re: 11405 - Can U Win?
I got wa in a case where n==0,make sure u handle it properly. its a simple bitmask bfs problem
- Tue Sep 20, 2011 6:50 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10622 - Perfect P-th Powers
- Replies: 47
- Views: 25107
Re: 10622 - Perfect Pth Powers
No need of factorization,gcd etc,this problem can be solved by brute force with some little clever pruning.
- Thu Sep 01, 2011 7:46 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10374 - Election
- Replies: 44
- Views: 15985
Re: 10374 - Election
Probably there is something weird about the judge input. I took all inputs with gets,removed trailing and leading spaces,and finally got ac. ""No lines contain leading or trailing blanks. "" is not correct.
- Thu Sep 01, 2011 12:43 am
- Forum: Bugs and suggestions
- Topic: 599 Problem description
- Replies: 4
- Views: 4460
Re: 599 Problem description
I just read the html and got ac.
- Wed Aug 31, 2011 8:45 am
- Forum: Volume 102 (10200-10299)
- Topic: 10269 - Adventure of Super Mario
- Replies: 5
- Views: 3449
Re: 10269 - Adventure of Super Mario
try this case,you may find your bug
output:
You can start or stop running at any node,but you cant run THROUGH a castle.
Code: Select all
2
1 2 2 10 2
1 2 9
2 3 10
2 1 2 10 2
1 2 10
2 3 9
Code: Select all
0
0
- Mon Aug 29, 2011 9:51 pm
- Forum: Volume 4 (400-499)
- Topic: 452 - Project Scheduling
- Replies: 23
- Views: 10576
Re: 452, Why WA
try this case:
output from my ac code:
Code: Select all
[b]1
A 2
C 3
B 5 AC
D 10 B
H 13 GF
E 11 B
G 12
F 2 DE
I 10
J 20 I
[/b]
Code: Select all
34
- Sun Aug 28, 2011 11:59 pm
- Forum: Volume 117 (11700-11799)
- Topic: 11749 - Poor Trade Advisor
- Replies: 10
- Views: 4042
Re: 11749 : Didn't understand
The description is not good though its a nice problem. You need to find the largest connected component with highest average PPA in this problem. And you will get the highest average only if you take the max weight edges
.

- Sun Aug 28, 2011 11:29 am
- Forum: Volume 108 (10800-10899)
- Topic: 10888 - Warehouse
- Replies: 19
- Views: 12895
Re: 10888 - Warehouse
try this:
output:
Code: Select all
1
5 8
X...#..X
X#......
.BB#.#.X
..B#...#
X..B...B
Code: Select all
21
- Sun Aug 28, 2011 11:27 am
- Forum: Volume 108 (10800-10899)
- Topic: 10888 - Warehouse
- Replies: 19
- Views: 12895
Re: 10888 - Warehouse
Problem setter should have mentioned that number of destination==number of boxes.
- Fri Aug 26, 2011 8:17 am
- Forum: Volume 9 (900-999)
- Topic: 926 - Walking Around Wisely
- Replies: 20
- Views: 11926
Re: 926 - Walking Around Wisely
Jan vai's i/o giving me segment fault in my ac code.