personally i didn't model it to a graph,instead i solved it by
backtracking on the operations and comparing them to B
note:i solved separately for every bit
here is my submission 298383591
my time complexity is O(nm*log(max ai)*log(n+m))
O(nm*log(max ai)*log(n+m))
personally i didn't model it to a graph,instead i solved it by
just in case
backtracking on the operations and comparing them to B
note:i solved separately for every bit
here is my submission 298383591
my time complexity is
O(nm*log(max ai)*log(n+m))