4o2a's blog

Optimality of today's E problem
By 4o2a, history, 5 weeks ago, In English

In today's E problem, my submission used exactly n-1 queries for each n to give out the answer. Can this be proven to be the least number of queries needed or is a better bound achievable?

  • Vote: I like it
  • +7
  • Vote: I do not like it

»
5 weeks ago, # |
  Vote: I like it -80 Vote: I do not like it

E was one of all time CRINGE problems.

→ Reply
  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    why?

    → Reply
  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it -21 Vote: I do not like it

    I think D was too(the only problem I've seen).

    → Reply
    • »
      »
      »
      5 weeks ago, # ^ |
      ← Rev. 4   Vote: I like it -11 Vote: I do not like it

      B was veri haRd foR me becuz i am retartet :(( and I convict chetar who is betar zan me like 3en7oras and mabloly and kedo sefawy and shoo91 xD

      but thnk gd i dont chet

      → Reply
      • »
        »
        »
        »
        5 weeks ago, # ^ |
        ← Rev. 4   Vote: I like it +3 Vote: I do not like it

        you mean JOO91 when you said shoo91? UPD: I found a banned account JOO_91 in his profile team XD Upd2: it seems like all users in his profile team are his alt's.

        → Reply
        • »
          »
          »
          »
          »
          5 weeks ago, # ^ |
            Vote: I like it +9 Vote: I do not like it

          ys i ment him

          → Reply
        • »
          »
          »
          »
          »
          5 weeks ago, # ^ |
            Vote: I like it +10 Vote: I do not like it

          So smart !

          Matters went from Egypt to Russia.. Good cheating reputation JOO91 and

          possibly

          ?

          → Reply
        • »
          »
          »
          »
          »
          5 weeks ago, # ^ |
            Vote: I like it +9 Vote: I do not like it

          ماا بورااااحه

          Spoiler
          → Reply
        • »
          »
          »
          »
          »
          5 weeks ago, # ^ |
          ← Rev. 3   Vote: I like it -12 Vote: I do not like it

          upd: JOO_91 = Aboeldahab [maybe] = JOO91 but Yousef.Osama I think is share account(not sure what he is)

          → Reply
        • »
          »
          »
          »
          »
          5 weeks ago, # ^ |
            Vote: I like it +17 Vote: I do not like it

          Why is that hard to understand? His account got banned, so he made a new one. Why assume that other accounts are his as well?

          → Reply
          • »
            »
            »
            »
            »
            »
            5 weeks ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            All of them have a similar photo or name. Perhaps I said "seems" so maybe it wasn't?

            → Reply
            • »
              »
              »
              »
              »
              »
              »
              4 weeks ago, # ^ |
                Vote: I like it +27 Vote: I do not like it

              I think you need an eye check

              → Reply
              • »
                »
                »
                »
                »
                »
                »
                »
                4 weeks ago, # ^ |
                  Vote: I like it 0 Vote: I do not like it

                yes, i think laik yu and good u farm contribuoshan

                because upcoming days for you are hard :)))))))))))

                → Reply
              • »
                »
                »
                »
                »
                »
                »
                »
                4 weeks ago, # ^ |
                  Vote: I like it +2 Vote: I do not like it

                So to me this only seems like age difference. This is just as funny as absolute_mess tag's absolute-mess's alt when you ping him.

                → Reply
  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    E was decent i guess

    → Reply
»
5 weeks ago, # |
← Rev. 2   Vote: I like it +25 Vote: I do not like it

Obviously, you can binary search for the first $$$i$$$ such that $$$f(1, i) > 0$$$, but it's still $$$O(n)$$$ queries in the worst case.

→ Reply
  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    why only for first, like we can binary search for second also such that f(1,j) > f(1,i), then we can fill 0 in between i and j and 1 at j and continue so on. Is it also n queries ??

    → Reply