Search found 43 matches

by polone
Sat Mar 11, 2006 6:19 am
Forum: Volume 110 (11000-11099)
Topic: 11010 - Tic-Tac-Tough
Replies: 20
Views: 7122

I got WA several times..
Please suppose some test data
by polone
Mon Feb 13, 2006 3:40 pm
Forum: Volume 109 (10900-10999)
Topic: 10990 - Another New Function
Replies: 32
Views: 15173

what should the test case be?
2
2 2000000
72 72
by polone
Tue Feb 07, 2006 2:36 pm
Forum: Volume 109 (10900-10999)
Topic: 10983 - Buy one, get the rest free
Replies: 15
Views: 6030

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...
by polone
Sun Feb 05, 2006 11:28 am
Forum: Volume 109 (10900-10999)
Topic: 10983 - Buy one, get the rest free
Replies: 15
Views: 6030

10983 - Buy one, get the rest free

please suppose some useful I/O

I've tried to generate some but no use
by polone
Wed Jan 25, 2006 8:18 am
Forum: Volume 109 (10900-10999)
Topic: 10985 - Rings'n'Ropes
Replies: 11
Views: 4288

How the O(n^3) method work?

please tell me :oops:

I'm running crazy
by polone
Tue Jan 24, 2006 4:46 pm
Forum: Volume 109 (10900-10999)
Topic: 10985 - Rings'n'Ropes
Replies: 11
Views: 4288

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
by polone
Mon Jan 16, 2006 7:08 am
Forum: Volume 103 (10300-10399)
Topic: 10314 - Three Pigs
Replies: 20
Views: 9743

Three pigs is not claimed that they should use different ways
by polone
Sun Jan 01, 2006 4:42 pm
Forum: Volume 109 (10900-10999)
Topic: 10981 - String Morphing
Replies: 31
Views: 13394

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...
by polone
Sat Dec 31, 2005 6:23 am
Forum: Volume 109 (10900-10999)
Topic: 10979 - How Many Triangles?
Replies: 15
Views: 6108

when you make every three points set you have to check if they are one the same line(lines in input)
by polone
Wed Nov 23, 2005 4:03 pm
Forum: Volume 109 (10900-10999)
Topic: 10975 - Dueue's Quiz
Replies: 39
Views: 16267

some words are reduplicate at the begining
these part shouldn't be done twice

tree can help you to solve :P
by polone
Mon Nov 21, 2005 2:48 pm
Forum: Volume 109 (10900-10999)
Topic: 10972 - RevolC FaeLoN
Replies: 10
Views: 4937

I don't know how to solve ths problem. :(
Just found a stubid greedy method
could someone who got ac explain it? :oops:
by polone
Tue Nov 15, 2005 2:47 pm
Forum: Volume 109 (10900-10999)
Topic: 10968 - KuPellaKeS
Replies: 8
Views: 4144

Ohh...yes :D

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
by polone
Tue Nov 15, 2005 2:37 pm
Forum: Volume 109 (10900-10999)
Topic: 10968 - KuPellaKeS
Replies: 8
Views: 4144

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 ...
by polone
Mon Nov 14, 2005 1:02 pm
Forum: Volume 109 (10900-10999)
Topic: 10959 - The Party, Part I
Replies: 37
Views: 18102

Maybe you can post your code :D
by polone
Sun Nov 13, 2005 5:08 pm
Forum: Volume 109 (10900-10999)
Topic: 10949 - Kids in a Grid
Replies: 30
Views: 11663

hmm...

WA shouldn't be the problem

I think you may have to check your algo

if the algo is correct there is hard to exist a data to result in WA :wink:

Go to advanced search