OJ Board

@ rujialiu

I try to solved this problem this way:

i take 3 parallel array
1=> For frequency of each number
2=>For last position of given numbers
3=>For parent of each index of given numbers.

Now when i take a query only i take the last position of this number and from last to climbing first ...

Hi wazaaaap
try to sloved this problem O( N ( M+N ) ) with respect to some condition.

hope it help you.

try this case
1
4
1 1 0 1
1 0 1 1
1 1 1 1
1 1 0 1
acc output
Case 1:
+-------+
|Y|Y|Y|Y|
+-------+
|N|Y|Y|N|
+-------+
|N|N|Y|N|
+-------+
|N|N|N|Y|
+-------+

You can use adjacent list or structure ot STL container like as vector

Hi " ItaloSpedini " This is very simple Number Theory Problem I sloved This problem this way :
1=> generate the divisor sequence
2=>from 1to 1000000 set a vector with 0 and 1
3=> cumulative sum of set vector
Then O(1) produce the output.

hope it help you.

This problem also sloved by simple dfs or mst

HI In your link funtion return int But you return nothing

hope it help you....

HI "Igor9669" now i got Acc
thanks for your help

I slove this problem using merge sort but still now Wrong answer please give me any idea about this problem

Thanks in advance.

I try to sloved this problem using Trie but it Wong answer.
Please give me some critical case

Thanks in advance

Try this case

Input:
6 7
0 1 10
1 2 12
2 4 3
4 3 2
3 2 1
3 4 10
3 4 11
My Ac c code give
3 10 11
But your code give
11
print all the eliminated edge

I can not find my wrong in simple MST problem

Please give me some I/O

Thanks in advance

WHY THIS CASE OUTPUT IS: 2
1900 3
2000 5
1950 1
101 1

PLEASE EXPLAIN & CLEAR ME

MY CODE GIVE : 5

TRY THIS CASE
4 3
4 1
1 2
3 2
MY Acc code give :
3
4
1
2

remove................