I got WA several times..
Please suppose some test data
Search found 43 matches
- Sat Mar 11, 2006 6:19 am
- Forum: Volume 110 (11000-11099)
- Topic: 11010 - Tic-Tac-Tough
- Replies: 20
- Views: 8600
- Mon Feb 13, 2006 3:40 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10990 - Another New Function
- Replies: 32
- Views: 18072
- Tue Feb 07, 2006 2:36 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10983 - Buy one, get the rest free
- Replies: 15
- Views: 8267
yes I agree that you shoule implent O(v^3) algo since the number of edges is very big... mine program is O(m*(n*d)^3) using relabel-to-front without bsearch WA I'm thinking about the accuracy of my algo If you know the actually relabel-to-front algo please send me a message about websit or code abou...
- Sun Feb 05, 2006 11:28 am
- Forum: Volume 109 (10900-10999)
- Topic: 10983 - Buy one, get the rest free
- Replies: 15
- Views: 8267
10983 - Buy one, get the rest free
please suppose some useful I/O
I've tried to generate some but no use
I've tried to generate some but no use
- Wed Jan 25, 2006 8:18 am
- Forum: Volume 109 (10900-10999)
- Topic: 10985 - Rings'n'Ropes
- Replies: 11
- Views: 5281
- Tue Jan 24, 2006 4:46 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10985 - Rings'n'Ropes
- Replies: 11
- Views: 5281
10985 - Rings'n'Ropes
How was the correct solution's time complexity?
now I'm using is O((n^2)*m)
I did it because I thinked it should be close to time limit
now I'm using is O((n^2)*m)
I did it because I thinked it should be close to time limit
- Mon Jan 16, 2006 7:08 am
- Forum: Volume 103 (10300-10399)
- Topic: 10314 - Three Pigs
- Replies: 20
- Views: 11572
- Sun Jan 01, 2006 4:42 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10981 - String Morphing
- Replies: 31
- Views: 16268
I used a n^4 dp but got tle I think it must has to be speed up but i can't here's my code: #include<iostream> #include<cstdio> #include<cstring> using namespace std; char dp[301][301][3]; int dp1[301][301][3]; int s[3][3]={{1,1,0},{2,1,0},{0,2,2}}; char asd[301]; char zxc[301]; int qq,tt; inline boo...
- Sat Dec 31, 2005 6:23 am
- Forum: Volume 109 (10900-10999)
- Topic: 10979 - How Many Triangles?
- Replies: 15
- Views: 7734
- Wed Nov 23, 2005 4:03 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10975 - Dueue's Quiz
- Replies: 39
- Views: 21543
- Mon Nov 21, 2005 2:48 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10972 - RevolC FaeLoN
- Replies: 10
- Views: 6682
- Tue Nov 15, 2005 2:47 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10968 - KuPellaKeS
- Replies: 8
- Views: 5099
Ohh...yes
my guess is right
there's some test data for someone who's solving this problem
![:D](./images/smilies/icon_biggrin.gif)
my guess is right
there's some test data for someone who's solving this problem
Code: Select all
100 0
6 8
1 2
1 4
1 6
2 3
2 4
2 5
3 5
3 6
0 0
Code: Select all
Poor Koorosh
2
- Tue Nov 15, 2005 2:37 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10968 - KuPellaKeS
- Replies: 8
- Views: 5099
10968 - KuPellaKeS
It is so strange.. :-? Input consists of several test-cases. Each test-case starts with a line containing three numbers Sample Input 4 5 1 2 2 3 3 4 4 1 1 3 0 0 I can't see the picture so I assumed the first line is n,m which n represent number of cities and m is number of roads I used BFS to solve ...
- Mon Nov 14, 2005 1:02 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10959 - The Party, Part I
- Replies: 37
- Views: 21882
- Sun Nov 13, 2005 5:08 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10949 - Kids in a Grid
- Replies: 30
- Views: 15625