OJ Board

mostafiz93

There is one space character(' ') at the last of each input line in the sample input.
Should we consider this for every input?

Can anyone clarify this issue?

mostafiz93

I'm getting WA in this problem.

My algo is : first make adjacency matrix with the given liunks. then journey is possible if [adj matrix]^d is nonzero.

i've implemented this with matrix exponentiation.

Can anybody help me?

my code is here:

Code: Select all

removed after AC

mostafiz93

The number of connections may be 0.

consider this input:

Code: Select all

2 0
a
b
a
0 0

output is Impossible

mostafiz93

empty string will be given as input.
i got AC after handling it.

mostafiz93

In the output specification it is said that

Actually many command lists can satisfy the request, but only one of them is required.

so, are there multiple outputs?

is this output valid for input-2:

Code: Select all

4
1 Insert 3,b
2 Insert 5,a
3 Insert 6,a
4 Insert 7,a

mostafiz93

In problem statement it is said that " prints as output the longest common sequence(s) in lexicographical order. ", but i got WA submitting the common Sub-sequences. I changed my dp function to print the continuous sequences and got accepted.

So, don't think "common sequence" as sub-sequence. :)

mostafiz93

I've also checked my program with this I/O :

input : http://www.csie.nctu.edu.tw/~chchu/acm/ ... t/612i.txt
output : http://www.csie.nctu.edu.tw/~chchu/acm/ ... t/612o.txt

mostafiz93

I'm getting WA in this problem.
I used divide and conquer algorithm to find the inversion number and then sorted the strings accordingly.
can anyone find any bug in my code?

here is my code:

Code: Select all

removed

mostafiz93

getting WA.
actually my code gives incorrect answer when one of the coefficients in Diophantine equation is equal to 0.
can anyone give me a hint how can i handle that case?

it gives correct output for other test cases.(as far as i checked)

here is my code :
removed after ac.
made a silly ...

mostafiz93

i'm getting WA in this problem.
can anybody find any bug in my code?

my code is here :

Code: Select all

Removed After AC

mostafiz93

i'm getting WA in this problem.
i used 0-1 knapsack algorithm.
can anyone find any bug in my code?
my code is here:

Code: Select all

removed after ac

mostafiz93

Can anyone provide me some critical test cases?

mostafiz93

thanks brianfry!
got AC.

mostafiz93

some I/O
Input:
12345678901234567
12445678901245710
12545678901272092
12645678901328952
12745678901446768
12845678901563040
12945678901676224
13045678901783232
13145678901877888
13245678901947840
13345678901968384
13445678902013568
13545678902108032
13645678902177600
13745678902197376 ...

mostafiz93

I used 0-1 knapsack to solve this problem.
can anyone find any bug in my code:

Code: Select all

removed after AC

OJ Board

Search found 31 matches

Re: 1229 - Sub-dictionary (Why WA)

Re: 10681 - Teobaldo's Trip

Re: 11710 - Expensive subway

Re: 526 String Editing

Re: 526 String Editing

Re: 760 - DNA Sequencing

Re: 612 - DNA Sorting

Re: 612 - DNA Sorting

Re: 10090 - Marbles

Re: 11327 - Enumerating Rational Numbers

Re: 990 - Diving for Gold

Re: 990 - Diving for Gold

Re: 562 - Dividing Coins

Re: 10633 - Rare Easy Problem

Re: 562 - Dividing Coins