OJ Board

Giorgi

thank you I got AC. very stupid mistake

Giorgi

rio wrote:Does your code handle the case x==y ?

Yes

here is my code, maybe I have very stupid mistake , but I can't find it...

I was Code :)

Giorgi

this problem makes me crazy...
I can't understand why simple soltion with BFS did not get AC.
is there any tricky case or I can't understand problem statement well?

Giorgi

Observer wrote:I would really love to hear what you feel about this task. I thought it is an easy task, but the statistics seem to show otherwise.

I think algorithm is very easy , but my brute force solution is more than 300 lines and I was writing it about 1 hour...

Giorgi

my idea was to first find the sp from start to all other vertices (say its d0[]) and end to all other vertices( say it is d1[]). then for each edge(u,v) in the commercial express i checked wheather i hav a smaller d0 + w(u,v) + d1[v] lenght(i cheked it for bothe (u,v) and (v,u) ), if a smaller ...

Giorgi

I got AC,
I did not pay attention that first ans last letters should be same

Giorgi

http://acmicpc-live-archive.uva.es/nuevoportal/
I am trying to solve this problem, but I can't get AC.
I am using dynamic programming.
If I can get sentence more than 1 way I print "ambiguous". if I can get sentence only one way I print words.
I can't understand where I am mistaken, seems that my ...

Giorgi

maxdiver wrote:Girogi
I have only russian translation of this book

send me if you can, I know Russian better than English

Giorgi

ImLazy wrote:Yes, I also get it from emule. A 1.1M djvu file. If you want, I can email it to you.

gsaghinadze@yahoo.com please send this book here.
Thanks

Giorgi

I was searching this book all day and could not find free internet version.
if somebody can upload this book or give me link , will be very good

Giorgi

How to construct suffix tree in N*log(N) time?
I am searching it in internet for 2 days and can't find site where all will be explained clearly.
If you now link where suffix tree constuction algorithm is explained clearly give me please.
thanks.

Giorgi

I can't understand

can you or others explain it to me more clearly?

Giorgi

I want to solve problem on the contest and I need your help.

I have number n and I want to find out how many digit 1 - s are in the numbers from 1 to n. how to solve it? n < 10^20.

for exapmle for n = 15 answer is 8

1
10
11
12
13
14
15

there are 8 one from 1 to 15. help please
thanks

Giorgi

mf can you explain how to reduce this problem to min-cost max-flow ?

Giorgi

thanks

but I have to study min-cost max-flow algorithm at first. my friend told me that this algo is very hard to code

OJ Board

Search found 48 matches

11377 - Airport Setup

Re: 11372 Arranging a Contest

NWERC 2007 contest

Suffix tree construction

A DP problem