UVa OJ Board

@li_kuet

May be you are right Masum

Let me know if you find any way (y)

@li_kuet

I used LIS and LDS for calculating the power of a Death Eater. Then i used a greedy technique to split the sequence. getting WA :( Is my method wrong ? Give me some hint please ... #include <bits/stdc++.h> using namespace std; typedef long long int ll; typedef unsigned long long int ull; const doubl...

@li_kuet

Input :

Code: Select all

1
2 0

Output :

Code: Select all

Case #1: 1 2

@li_kuet

Input :

Code: Select all

5 4
0*
1*
11*
011*
1110*
6
*
0*
1*
11*
011*
1110*

1 64
111111111111111111111111111111111111111111111111111111111111111*
1
*

0 0

Output should be :

Code: Select all

0
6
4
3
2
1

18446744073709551614

@li_kuet

Why am i getting WA ?
It's okay with brianfry713 testcases. What am i missing

Code: Select all

AC :)

@li_kuet

Can anybody give me some critical input please

I'm getting WA

I used Heavy Light Decomposition + LCA + BIT
Here is my code :

Code: Select all

Silly Mistake :(
Got Accepted :)

@li_kuet

Thanks brianfry713

Now i understand, why more than 2 colors needed

@li_kuet

In case you are wondering for more input :

Code: Select all

Output :

Code: Select all

Case 1: 15 5

@li_kuet

I have already solved the problem. But i'm still wondering why it is necessary to use more than two colors to color a tree :( As we know a tree is Bi-Colorable, so wouldn't it be enough to use only two color ?? Can anyone give me an example where using three or more color is optimal than using two c...

@li_kuet

Who are getting WA try Input:

Code: Select all

1040 65
.01

Output:

Code: Select all

1601 100

@li_kuet

What is wrong with my code ??
Any tricky case ??
Help please ...

Code: Select all

AC
Made an stupid mistake :P

Can try this input who r getting WA

Code: Select all

5 0
1
5
10 20 30 20 50
40 25 10 50 20

Output : 50

@li_kuet

Thanks brianfry713

Got AC

@li_kuet

Can't find the reason of WA

what am i missing ??

Code: Select all

Accepted :)

@li_kuet

Try this Input: 1 25 G 9:99 N Output should be: RANK TEAM PRO/SOLVED TIME 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 Hope this will help :)

@li_kuet

Careful !!! There shouldn't be any newline in the output .. it will cost WA

UVa OJ Board

Search found 44 matches

Re: 12836 - Gain Battle Power

Re: 12836 - Gain Battle Power

Re: 10880 - Colin and Ryan

11590 - Prefix Lookup

Re: 11171 - SMS

12424 - Answering Queries on a Tree

Re: 11307 - Alternative Arborescence

11655 - Waterland

Re: 11307 - Alternative Arborescence

Re: 906-Rational Neighbor

Re: 10086 - Test the Rods

Re: 859 - Chinese Checkers

Re: 859 - Chinese Checkers

Re: 790 - Head Judge Headache

Re: 12348 - Fun Coloring