Runtime complexity for DISHOWN

What type of complexity does your algorithm have?

How many data structures do you know that achieve this complexity?

Well I know just one, but maybe there are other DS around that I don’t know about.

In this case, mentioning the complexity of the DS is as good as giving out its name. So it is against the rules.

What about mentioning that it’s a DS problem? Is that okay?