Search found 43 matches
- Wed Oct 20, 2010 9:19 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11860 - Document Analyzer
- Replies: 15
- Views: 5288
Re: 11860-Document Analyzer
I think this is a simple adhoc problem..... but i got TLE in the contest :( can any one give me any clue..... thanx for advance. For solve this problem, i'm used Suffix Tree to find words, for example 'a abba a c a' = 1 2 1 3 1, and with this I know the max number of different words = 3 in this cas...
- Mon Oct 01, 2007 6:42 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11297 - Census
- Replies: 24
- Views: 15887
I got too many WA in this prob. here i post my code. Anyone please help me.. // CODE Input: 10 10 3 9 380 28471 29141 12245 0 5957 57 8535 5 9582 224 8649 2763 7 63 42 4462 0 11616 0 4647 4099 5 11 30991 0 32585 1 7 0 16 0 363 0 0 10947 1 31210 0 13 48 5997 8734 325 424 0 5949 18088 146 0 7 664 917...
- Mon Oct 01, 2007 2:23 am
- Forum: Volume 112 (11200-11299)
- Topic: 11297 - Census
- Replies: 24
- Views: 15887
Re: 11297 - Census
From the problem statement: In the first line you will find N (0 <= N <= 500) But in the first line of sample input I see 5 5 Assuming that the problem desription is good I've got RTE for my program. It indicates that the description is wrong. It's really confusing, what is the second number in the...
- Sat Feb 24, 2007 10:18 am
- Forum: Volume 111 (11100-11199)
- Topic: 11165 - Galactic Travel
- Replies: 6
- Views: 2785
Basic algorithm is breadth-first search. You can use some data structure (linked list, or segments tree) to improve it, so that its overall running time will depend on the number of forbidden pairs or intervals, instead of the total number of edges. yes, I think in that, but a don't know how to sav...
- Sat Feb 24, 2007 9:52 am
- Forum: Volume 111 (11100-11199)
- Topic: 11165 - Galactic Travel
- Replies: 6
- Views: 2785
11165 - Galactic Travel
any hint ?? I don't understand , How to solve it
?

- Tue Feb 20, 2007 6:25 am
- Forum: Volume 105 (10500-10599)
- Topic: 10559 - Blocks
- Replies: 37
- Views: 13289
- Thu Feb 15, 2007 1:06 am
- Forum: Volume 111 (11100-11199)
- Topic: 11149 - Power of Matrix
- Replies: 42
- Views: 20905
- Wed Feb 14, 2007 7:44 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11087 - Divisibility Testing
- Replies: 36
- Views: 19037
someone can give me critical cases? please :( :( :( :( # include <stdio.h> # include <string.h> char set; long long hash[1000]; long long dup[1000]; int cmb(int num, int k){ return ( (num % k) + k ) % k; } char flag[20000001]; int min(int a , int b){ return a < b ? a : b; } int max(int a , int b){ r...
- Mon Jan 01, 2007 8:11 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10559 - Blocks
- Replies: 37
- Views: 13289
Re: More I/O's
My Accepted Output is : Case 1: 4957 Case 2: 2 Case 3: 5 Case 4: 18 Case 5: 48400 Case 6: 10 Case 7: 22 Case 8: 29 Case 9: 1 Case 10: 258 Case 11: 16 Case 12: 18 More Input: 20 200 2 5 1 1 1 5 3 5 1 7 5 7 2 1 5 4 7 7 3 1 2 1 1 3 7 3 4 4 3 1 7 5 2 6 5 2 5 1 2 5 2 6 5 2 1 2 1 7 6 4 5 3 5 1 6 4 2 6 4 5...
- Mon Sep 11, 2006 6:53 am
- Forum: Volume 105 (10500-10599)
- Topic: 10559 - Blocks
- Replies: 37
- Views: 13289
Re: 10559
Try This: 1 165 1 2 3 2 1 1 5 1 1 1 1 10 1 4 4 41 4 4 1 43 4 4 4 41 4 4 42 4 4 1 13 1 1 1 2 3 2 1 11 1 1 1 1 1 19 1 4 4 41 4 4 1 4 34 4 4 24 4 4 4 4 4 11 1 1 1 1 21 3 2 1 12 1 1 1 1 15 1 1 44 4 4 4 4 1 4 41 4 4 14 4 4 4 4 4 12 1 1 1 1 20 3 2 1 1 1 1 1 1 1 1 1 4 4 4 4 4 1 4 4 4 4 4 4 4 4 4 4 1 1 1 1...
- Sat Aug 12, 2006 2:58 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11070 - The Good Old Times
- Replies: 42
- Views: 16070
Re: 11079 : The Good Old Times
input:
100
-10+2+2
Correct output
100.000
-6.000
your output is
0.000
4.000
100
-10+2+2
Correct output
100.000
-6.000
your output is
0.000
4.000
- Wed Aug 02, 2006 8:30 am
- Forum: Volume 102 (10200-10299)
- Topic: 10248 - The Integer All-time Champ
- Replies: 11
- Views: 7651
INPUT
My AC Output
Code: Select all
11 11
11 12
21 31
Code: Select all
11
112
22123024252627282931
- Sun Jul 16, 2006 2:34 am
- Forum: Volume 1 (100-199)
- Topic: 173 - Network Wars
- Replies: 29
- Views: 3438
input A:BD;C:BD;F:E;G:DEH;H:EG. A H E:AB. A B B:ACD. B D A:B;B:C;D:E. A D A:A. A A A:B. A B A:B. B A A:B. C C A:B. C D A:B;C:BDE;F:EG;G:H. A H A:B;C:BDE;F:EG;G:H. A G A:B;C:BE;F:EG;G:H. A G A:B;C:BDE;F:EG;G:H. H C A:B;C:BDE;F:EG;G:H. B H A:B;C:BDE;F:EG;G:H. B E A:B;C:BDE;F:EG;G:H. C B A:BD;C:BD;F:E;...
- Mon Jun 05, 2006 7:36 am
- Forum: Volume 110 (11000-11099)
- Topic: 11047 - The Scrooge Co Problem
- Replies: 31
- Views: 14837
Input 2 5 Puebla Mexico Queretaro Durango San_Pedro 2 3 0 1 1 3 0 2 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 2 Nalley Puebla Puebla Xuxa Mexico Mexico 3 hola como estas 2 3 0 3 0 2 0 1 0 2 Pedro hola como Juan como como Output (Solution AC): Mr Nalley to go from Puebla to Puebla, you will receive 0 euros P...
- Wed Mar 22, 2006 2:23 am
- Forum: Volume 105 (10500-10599)
- Topic: 10595 - Knight on the Bee Board
- Replies: 17
- Views: 11943
Directions =D
Code: Select all
int dx[13] = {-1, +1, 2, 3, 3, +2, -1, 1, -3, -2, -2, -3 };
int dy[13] = {-2, -3, -3, -2, -1, 1, 3, 2, 2, 3, -1, +1 };