nitesh_gupta's blog

CodeCraft-19 and Codeforces Round #537 (Div. 2)
By nitesh_gupta, 5 years ago, In English

Hello Everyone!

I would like to invite you to CodeCraft-19, which is a part of Felicity, the annual techno-cultural fest of IIIT Hyderabad. It will take place on 03.02.2019 18:35 (Московское время).

The round will be rated for Div 2 participants (whose ratings are lower than 2100). As usual, participants from the first division can participate in the contest out of the competition. You will be given 5 problems, all of which are based on the theme of our fest, "Superheroes".

I would like to thank the CodeCraft team -- nir123, additya1998, devanshg27, gaurav172, night_fury208, shaanknight, psaini, sharmaritvik60, swetanjal and vivace_jr -- for helping in preparation of the problemset. I would also like to thank KAN and 300iq for round coordination, ----------, Aleks5d and mohammedehab2002 for testing the round and MikeMirzayanov for the great Codeforces and Polygon platforms.

Following the convention, score distribution will be announced shortly before the contest.

Good luck to all the participants!

UPD1: 500-1000-1500-2000-2500

UPD2 Editorial is published! We sincerely apologize for the weak pretests in B and for the difficulty gap from C to D which turned out to be harder than what we expected.

UPD3 Congratulations to the winners!

  1. prodakcin

  2. Taiyaki

  3. yww_AFO

  4. Mindstorm

  5. ThankGodItsFriday

  6. Issh

  7. hfctf0210

  8. Y.nnnnnnn

  9. kirillbogatiy

  10. PedyD

  • Vote: I like it
  • -128
  • Vote: I do not like it

Comments Comments (344)
| Write comment?
»
5 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Auto comment: topic has been updated by nitesh_gupta (previous revision, new revision, compare).

→ Reply
»
5 years ago, # |
  Vote: I like it +12 Vote: I do not like it

Should we expect an interactive problem?

→ Reply
»
5 years ago, # |
  Vote: I like it -7 Vote: I do not like it

Just curious. Why not div1 this time?

→ Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it +61 Vote: I do not like it

    There's less number of people who want to set problems for Div. 1 because they're harder.

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

Wishing everyone high ratings.

→ Reply
»
5 years ago, # |
  Vote: I like it +62 Vote: I do not like it

Some previous editions of CodeCraft:

  1. CodeCraft-18

  2. CodeCraft-17

  3. CodeCraft-16

  4. CodeCraft-15

→ Reply
»
5 years ago, # |
  Vote: I like it -39 Vote: I do not like it

Indian round?

→ Reply
»
5 years ago, # |
  Vote: I like it +2 Vote: I do not like it

TShirt? :/

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

    Prizes are not allowed for Div2 contests as it may lead to fake accounts by Div1 users.

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

      aryanc403 surely meant overall winners rather than Div 2 winners. There is no incentive for fake accounts in that case.

      → Reply
»
5 years ago, # |
  Vote: I like it -6 Vote: I do not like it

Good luck for all participants.

→ Reply
»
5 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Maybe this contest is lucky for me to become pupil

→ Reply
»
5 years ago, # |
  Vote: I like it +13 Vote: I do not like it

Hope this contest should not be unrated

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

    Use my upvote as a "Delete Contest from Codeforces and our lives forever" button!

    → Reply
»
5 years ago, # |
  Vote: I like it +36 Vote: I do not like it

Expect numerous hacks like last time.

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

    I feel sorry for all the hacks, but I at least I can say I warned you beforehand.

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

GL & HR Everyone.

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it -10 Vote: I do not like it

.

→ Reply
»
5 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Mancity & arsenal or codeforces :'(

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

I want to be blue but it will never happen.

→ Reply
»
5 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Were there alot of hacks last time?-

→ Reply
»
5 years ago, # |
  Vote: I like it +7 Vote: I do not like it

Hope, problems have harder pretests to prevent so many hacks like the previous year!

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

    The pretests are quite weak, and it seems there are more hacks than last year :C

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

How long will contest held??? 2 hour or 2.5 hour ?? not mentioned in post.

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

10 writers are here.

Hope to see a good contest.

→ Reply
»
5 years ago, # |
  Vote: I like it +22 Vote: I do not like it

Hope contest will be beautiful as it's id.
https://codeforces.com/contests/1111

→ Reply
»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

contest 1111. It's really a nice number. woof woof woof.

比赛1111 这是一个非常美妙的数字 汪汪汪

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

I hoped that there would be a real Lunor Year contest tomorrow... 我曾经希望明天会有一场除夕赛。。。

→ Reply
»
5 years ago, # |
  Vote: I like it +97 Vote: I do not like it

"Jarvis has to tell Iron Man the number of distinct colony arrangements he can create from the original one using his powers such that all villains having the same type as those originally living in x-th hole or y-th hole live in the same half and the Iron Man can destroy that colony arrangement."

This run on sentence is murdering my brain.

→ Reply
»
5 years ago, # |
  Vote: I like it +1 Vote: I do not like it

After doing ABC and not finding out the reason why D is failing, all I can do is my part

/ ___| _   _| |__  ___  ___ _ __(_) |__   ___  | |_ ___  
\___ \| | | | '_ \/ __|/ __| '__| | '_ \ / _ \ | __/ _ \ 
 ___) | |_| | |_) \__ \ (__| |  | | |_) |  __/ | || (_) |
|____/ \__,_|_.__/|___/\___|_|  |_|_.__/ \___|  \__\___/ 
                                                         
 ____                  _ _            _      
|  _ \ _____      ____| (_) ___ _ __ (_) ___ 
| |_) / _ \ \ /\ / / _` | |/ _ \ '_ \| |/ _ \
|  __/  __/\ V  V / (_| | |  __/ |_) | |  __/
|_|   \___| \_/\_/ \__,_|_|\___| .__/|_|\___|
→ Reply
»
5 years ago, # |
  Vote: I like it -56 Vote: I do not like it

I vote for unrated

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

It's so nice to watch the solution go through 30 tests in a row in C

→ Reply
»
5 years ago, # |
  Vote: I like it +15 Vote: I do not like it

shit contest kys.

→ Reply
»
5 years ago, # |
  Vote: I like it +28 Vote: I do not like it

make it unrated or die

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

worst constest,shit pretest ,more than half of B'solutions in my room fail with the same testcase. pd: my code alse fail in that testcase :(

→ Reply
»
5 years ago, # |
  Vote: I like it +34 Vote: I do not like it

Is it HackForces?

→ Reply
»
5 years ago, # |
  Vote: I like it +58 Vote: I do not like it

Hackforces Round #537

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

I always wonder why 'Codecraft' is challenging every year. Each year you get to see challenging problems on some particular theme. I am sure we'll find some nice stuff to learn from its editorial too.

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it -86 Vote: I do not like it

lol how did you manage to fail A and B? noobs

→ Reply
»
5 years ago, # |
  Vote: I like it +200 Vote: I do not like it

→ Reply
»
5 years ago, # |
  Vote: I like it +12 Vote: I do not like it

HackCraft-19

→ Reply
»
5 years ago, # |
  Vote: I like it +4 Vote: I do not like it

What is Test 6 of Prob C?

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

    It's a test where probably there are one or more avengers on the same position. Think if your code works when you have duplicates.

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

    More than one stay in one place :) Lost 50 mins for this.

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

      can you please share your approach?

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

        Reccurence.

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

          will it not time out?

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

            I think not time out...

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

              if possible can you please suggest a counter case for this

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

                Reccurence should work if you cut it immiedietly after current interval contains 0 avengers(result is A then).

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

    This test helped me

    1 2 1 2
1 1
Ans: 5
    → Reply
»
5 years ago, # |
  Vote: I like it +87 Vote: I do not like it

This round was so weird...

→ Reply
»
5 years ago, # |
  Vote: I like it +37 Vote: I do not like it

so weak tests...

→ Reply
»
5 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Really liked problem C :) But it was kinda a typing contest though :(

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

Classic shitty round

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

how to solve Problem D

→ Reply
»
5 years ago, # |
  Vote: I like it +71 Vote: I do not like it

Personally I dislike this contest.

Codecraft in two most recent years have been plagued with weak pretests, and to top it all off, this year has difficulty spike and incomprehensible + mistakeful statements along.

Well, honestly saying, the reduce from a Div.1+Div.2 combined to a Div.2-only is enough foreseeing a major drawback. Hope to see better attempt next year. ;)

→ Reply
»
5 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Why didn't it (49418380) get RE on test a ab ?

→ Reply
»
5 years ago, # |
  Vote: I like it +80 Vote: I do not like it

Problem D statement clearly looks like it is asking about something, while it seems that it is actually asking about an entirely different thing.

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

    I got a solution after some time, then the clarification destroyed it. What was in the clarification wasn't clear in the statement.

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

      I have just noticed now that there was a clarification. LOL it added an entirely new condition that wasn't mentioned in the statement.

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

5 4 2 4 7 9 11 100 problem B test XD sadly mine also failed...

→ Reply
»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Pretests were a disaster! Many sentences in different questions were unclear and tricky, especially B.

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

What were the hacks for A and B

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

    For A I mostly used:

    ab
ba

    For B I only used:

    4 1 3
1 1 1 1
    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Thanks — what were you looking for in the code for those hacks to work?

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

        For A it was easy. I just looked at code, quickly understood that someone is only counting occurrences of vowels and consonants and compare them, looked at the statement to make sure that it is wrong and created this simple counter example.

        For B the codes were generally harder to understand but when I found a 5 lines of code solution I realized that many people assumed that its optimally to firstly remove as many smallest elements as possible and then increase the biggest guy. This test is a counter example.

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

    Some tests I used for B:

    3 1 2
8 9 9

    7 1 1
8 8 8 9 9 9 9
    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      What did you notice in the solutions that made you know the hack would work?

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

        The first test I used was to counter a greedy solution, in which if m ≤ n - 1, such solution would delete all m smallest solutions.

        There might be an optimization, in which the deletion will stop when reaching all remaining elements have the same value equal to max. That's when my second test came to the play. ;)

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

          is the answer for the second one 8.714?

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

            Yes, the optimal will be increase any element 9 once ;)

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

      what is the ans for given 2 cases?

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

        For the first test: 9.5000000
        For the second test: 8.7142857

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

          what is the solution for B?

          → Reply
          • »
            »
            »
            »
            »
            »
            5 years ago, # ^ |
            ← Rev. 2   Vote: I like it +8 Vote: I do not like it

            I approached it with a bruteforce solution ;)

            Obviously, if we're to remove an element, that must be the currently lowest element. We'll take that into regards, and sort the array in an ascending order.

            Now, iterate through all del within range [1, min(n - 1, m)] (inclusive), with del being the number of deleted elements.

            Let's denote sufsum(i) as the sum of i largest elements of the array.

            For each iteration, since we have used del operations as deletion, the number of increasing operation should be min(m - del, (n - del)·k) -- we'll denote this value as inc.

            Thus, the answer for each iteration would be .

            We'll take the maximum value throughout all iterations as our final answer. ;)

            → Reply
»
5 years ago, # |
  Vote: I like it +11 Vote: I do not like it

WORST CONTEST I HAVE EVER SEEN ON CF.

→ Reply
»
5 years ago, # |
  Vote: I like it +13 Vote: I do not like it

HACKERS!!! HACKERS!!! EVERYWHERE xD

→ Reply
»
5 years ago, # |
  Vote: I like it +6 Vote: I do not like it

How do I calculate ((a!)/(b!)) mod p, where p is prime?

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

    using the fermat's little theorem

    a == a ^ (p — 1) (mod p)

    therefore, we can find the modular inverse by

    a ^ -1 == a ^ (p — 2) (mod p)

    and the result is

    a! / b! == a! * b! ^ (p — 2) (mod p)

    Sorry for poor presentation, I just dun wanna type any latex

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

    https://www.quora.com/How-do-I-evaluate-A-B-mod-1000000007

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

    You can use the Fermat-Euler theorem, which shows that xφ(p) - 1 always has remainder 1 when dividing by p, provided that x and p are coprime. φ(p) is Euler's totient of p.

    In this case, since 109 + 7 is a prime number, then φ(109 + 7) = 109 + 6, thus instead of dividing b!, you will multiply , taken modulo of 109 + 7. ;)

    → Reply
»
5 years ago, # |
  Vote: I like it +6 Vote: I do not like it

This is the contest with the weakest pretest I've ever participate

→ Reply
»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

mistaken simulation task as greedy / DP for the last two rounds, solves it later than everyone else.

Life is sad

→ Reply
»
5 years ago, # |
  Vote: I like it +8 Vote: I do not like it

difficulty gap again too high ! even many yellow coder solved only 3 and that also in division 2 . division 2 is smoothly becoming div1 .

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

Border Test Cases for B on which many solutions will fail ! 5 2 2 7 7 7 7 7

5 2 6 7 7 7 7 7

→ Reply
»
5 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Hack for B 5 4 3 2 2 3 3 4 Answer is 3.666666

→ Reply
»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

can anyone explain problem B

→ Reply
»
5 years ago, # |
  Vote: I like it +6 Vote: I do not like it

As always, everyone solved the first n problems, and some unicorns solved the rest.

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

Is the intended complexity of D is O((52)^2*n) ???

→ Reply
»
5 years ago, # |
← Rev. 3   Vote: I like it +14 Vote: I do not like it

So you tell me solving ABC gives you 2nd place, while solving ABCE gives you only 14th place? Not cool.

Edit: A(failed B)CE and 37th place

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

Why didn't this(49426136) O(n2) algo get TL on max test (n = 105, m = 107, ai != aj for all i != j)?

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Problem D: can anybody tell me why my code is WA?

I used fast binomial coefficient calculation using precalculating factorials ans factorial inverse.

half = n/2, nx = number of char x in string s.

a, b, c, d ... is not targeted chars.

I just calculated 2 * C(h, nx) * C(h-nx, ny) * C(n-nx-ny, a) * C(n-nx-ny-a, b) ...

And I also treated s[x] == s[y]

PLEASE HELP ME!

http://codeforces.com/contest/1111/submission/49432460

→ Reply
»
5 years ago, # |
  Vote: I like it +59 Vote: I do not like it

The worst round ever

→ Reply
»
5 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Hack for B

  • 5 4 3

  • 2 2 3 3 4

  • Ans is 3.666666

→ Reply
»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Hackforces again.

→ Reply
»
5 years ago, # |
  Vote: I like it +88 Vote: I do not like it

When your solution was hacked in the last minutes

→ Reply
»
5 years ago, # |
  Vote: I like it +1 Vote: I do not like it

How to solve problem C?

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

another hack round :(

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

Hack Case for B:

3 3 1

9 9 10

Expected ans: 9.6666

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

    In my case, i got w/a this testcase.. T^T

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

    (Good) But Many output of Pretest Passed Code will be 9.5 .....

    → Reply
»
5 years ago, # |
  Vote: I like it +58 Vote: I do not like it

Added setters to black list.

→ Reply
»
5 years ago, # |
  Vote: I like it +28 Vote: I do not like it

Y is not a vowel? And the pretests didn't test that??

I liked D/E, but their difficulty was more like div1 D/E :P

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

    It's in the statement:

    In this problem, we consider the letters 'a', 'e', 'i', 'o' and 'u' to be vowels and all the other letters to be consonants.
    → Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Yes, Y is not a vowel, at least in English. It can sometimes be considered a vowel but it is primarily a consonant. Sure, normally on codeforces 'y' seems to normally be classified as a vowel but it's slightly more correct to have it as just a,e,i,o,u if the statement is in English.

    → Reply
»
5 years ago, # |
  Vote: I like it +1 Vote: I do not like it

"where each position can be occupied by many avengers" i m not able to submit c because i didn't observe it

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

In C, I was using feynwick tree to find number less than x(not binary search). Got TL on test case 5. TL seems be too strict.

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

    So you had a Fenwick tree of size 230? What's odd about that TLEing?

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
      ← Rev. 2   Vote: I like it 0 Vote: I do not like it

      I stored map. Link. It was O(log^2(n)).

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

        Your solution looks like it would be O(k·log3(2n)) which is like 2.7e9.

        Solve is called (k·log(2n)) times, and each call (discounting recursion) takes O(log2(2n))

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

    Your method must be wrong, mine passes in 78ms.

    → Reply
»
5 years ago, # |
  Vote: I like it +22 Vote: I do not like it

The most imbalanced round I have ever seen, literally everything depends on speed and hacks.

→ Reply
»
5 years ago, # |
  Vote: I like it +142 Vote: I do not like it

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

1-based indexing caused 2 of my solutions to fail... (for I use C/++)

→ Reply
»
5 years ago, # |
  Vote: I like it +44 Vote: I do not like it

I found statement for D ambiguous.

"Iron Man can destroy a colony only if the colony arrangement is such that all villains of a certain type either live in the first half of the colony or in the second half of the colony."

I think something like this would've been better:

"... only if for every different type of villain, all of its occurrences are either in the first half or the second half of the arrangement."

Not specifying that the property should hold for every type of villain was misleading. I personally misunderstood the problem it until the clarification came up.

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

    I second this. The entire contest, I understood the condition as "there exists a certain type, such that all villains of this type either live in the first half or in the second". Unfortunately, the samples did not differentiate between the two cases.

    When the clarification came up, I notified the authors of the possible ambiguity in the original statement. But I was not sure if it was just me or if the statement was indeed unclear. Glad to hear it wasn't just me :)

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

    Thanks, that makes the problem more clear :)

    → Reply
»
5 years ago, # |
  Vote: I like it +208 Vote: I do not like it

→ Reply
»
5 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Really unfair for a guy(say x) who has solved 3 faster than another guy(say y). X and Y lock their solutions but X finds no hack in his room and Y finds a lot of hacks in his room. Its unfair on the side of X though. Pretests should be strong and Questions should be balanced a lot more than what it was today.

→ Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it +15 Vote: I do not like it

    You are right in that pretests should've been stronger. I don't agree with the rest of your comment. Rooms are selected randomly, so everyone has the same chance of being the lucky Y guy. That's just how CF rounds work, sometimes luck is an important factor as well.

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

      I would prefer getting ratings by solving rather than luck :)

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

        It sucks when someone beats you out of luck, I've been there too. But that doesn't mean it's unfair. He/she didn't break any rules, so we should accept it, even if it's hard. Moreover, if that lucky guy had been you, you still would've won and gotten your rating.

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

      That's how mafia works

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

Is question c can be done with the help of segment tree and dp with memo???

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

I believe the complexity of my submission (in Java) for C is N * K * logK but it got TLE on pretest 8. https://codeforces.com/contest/1111/submission/49423653

→ Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    Yeah mine soln with the same complexity gets TLE at pretest 8 , very strict TL for JAVA :( My soln : https://codeforces.com/contest/1111/submission/49427480

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

      Inside the recursion, the first thing you should check is if there is any index between l and r. If not then return A

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

        Did you checked my code properly?, I did return 'a' for this condition.

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

          aman110599 TLE must be because while executing the go function, you are checking for memoization but if you think properly then same states won't be reached again. So there is no need of memoization and you can remove that line hence remove the extra log factor.

          → Reply
»
5 years ago, # |
  Vote: I like it +75 Vote: I do not like it

That jump of difficulty from C to D... It's like playing Dark Soul after learning how to use the computer.

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

    It’s like asking barbarian to play dark souls actually

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

    what was your solution for D ?

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
      ← Rev. 2   Vote: I like it +35 Vote: I do not like it

      The answer for each query is , where freqc is the frequency of character c in string s, K is the number of way to split the set of 52 characters into two subset, such that sum frequency of characters in each subset is equal to . If sx ≠ sy, there is an additional condition that sx and sy must belong to the same subset.

      Let fl[c][j] the number of ways to split the set of characters from 1 to c into two subset, such that sum of frequency of the first subset is j.

      If sx = sy, then K is simply fl[c][n / 2].

      Consider the case when sx ≠ sy. We need to precalculate cnt[c1][c2] — the number of way to split the set of characters into two subset when c1 and c2 must come together — then K is equal to cnt[sx][sy].

      Precalculating cnt can be done naively in O(n * ALPHA3) (ALPHA = 52 in this problem), which is not fast enough.

      A faster way to do this is as following:

      Iterate over all c2. For each c2, calculate fr[c][j] — the number of way to split the set of characters from c to ALPHA excluding c2 into two part, such that sum of frequency of first part is j. Then, one can iterate over all c1, combine fl[c1 - 1] and fr[c1 + 1] to get cnt[c1][c2]. Complexity is O(n * ALPHA2).

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

        Thank you, loved the trick.

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

        I had a different O(n * α2) solution, but it's more complicated than yours.

        Due to the way the DP is calculated, we can undo any character from the DP. So just calculate the DP in O(n * α), then for all pairs of characters, undo those characters, and check from the resulting DP-array the number of ways to split such that the difference is equal to the sum of their frequencies.

        To undo a character with frequency a, you set DPnew[j - a] = DPold[j] - DPnew[j + a], looping down from j = n, where DP[j] is the number of ways to get a difference of j to the sizes of the sides. We can undo two characters in O(n), so this algorithm is also O(n * α2).

        Code: 49428256. Here DP[n] is zero difference, and less than n is negative difference.

        → Reply
»
5 years ago, # |
  Vote: I like it +66 Vote: I do not like it

Feels like i accidentally enter to Codechef

→ Reply
»
5 years ago, # |
  Vote: I like it +14 Vote: I do not like it

Failed to get up on time and it seems a typing&hack contest... Hope not to FST!!

→ Reply
»
5 years ago, # |
  Vote: I like it -12 Vote: I do not like it

In problem C, manual binary search code gave TLE on pretests while use of upper_bound and lower_bound passed the pretests! Shouldn't happen like that , very sad to see this. :(

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

    But that is not strange.

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

    Doesn't your comment just reduce to "I wrote binary search incorrectly"?

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

      how u solved c ? this was very weired conterst , ur a and b failed st , bcoz of so weak pretest .

      → Reply
      • »
        »
        »
        »
        5 years ago, # ^ |
        ← Rev. 2   Vote: I like it 0 Vote: I do not like it

        Well, my A and B in particular failed because of really dumb bugs that I should have caught myself. I won't blame the pretests for my poor implementation mistakes.

        As for C, I did DFS on trie, which afterward I realized was overkill lol.

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

          many solved with recursive approach using lower & upper bound .

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

            Yeah, I realized that was possible after the contest.

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

            divide and conquer + purning

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

      mujhe mat sikha bc

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

    My Submission Link

    Please say what could i have done more

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

I solved C using dynamic segment tree. Unfortunately couldn't code before time, as my B got hacked and spent lot of time finding the bug.
Have to wait till system testing to submit.
Can someone tell if dynamic segment tree is fine for AC?

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

    Yes, it is. It's unnecessary though. Since there are no updates, you could use a map for storing prefix sums. It's a lot easier to implement and has the same complexity.

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

    I think it should be fine. But you can notice that you don't need that segment tree because there's no update. You can just do a binary search to find how many elements are there in this segment.

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

    what is dynamic segment tree?

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
      ← Rev. 2   Vote: I like it 0 Vote: I do not like it

      Usually in a segment tree, we initialize the whole tree with nearly 4*mx nodes and operate on it. Where mx is the maximum value of a[i].
      But what if a[i] takes values (1 <= a[i] <= 10^9), but there are only 10^5 elements in array a[].
      That time we can use dynamic segment tree.
      We only create a node of the tree if its going to be affected by our update() or range() query. Else we don't require it. Thus making it "dynamic".
      You can check my submission for problem C in today's contest for better idea.

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

        thanks for explanation, i will try to understand

        → Reply
»
5 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Problem C just minced the JAVA users , as who keeps the TL for a problem with recursion to 1 secs ?

→ Reply
»
5 years ago, # |
  Vote: I like it +19 Vote: I do not like it

Hosted on wrong platform typical codechef contest

→ Reply
»
5 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Has anybody solved C with dynamic segment tree? My submissions got MLE #8

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

    My dynamic segment tree got AC.
    I think you are doing too many unnecessary allocation of memory ( i.e ptr = new node(); ).
    Please check my simple implementation.

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

      Thank you for your code. Here is my AC submission 49472118. I got rid from the rec function and did all the calculations in the segment tree.

      → Reply
»
5 years ago, # |
  Vote: I like it +65 Vote: I do not like it

Hmmmmmmmmm

→ Reply
»
5 years ago, # |
  Vote: I like it -20 Vote: I do not like it

For like 90% of people y is a vowel and you don't even put a pretest that should get it wrong? Aww come on

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

    For A, vowels were given in the statement.

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

    Like 100% of people know how to read a statement.

    → Reply
»
5 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Is Codecraft always like that?

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

I doubt there were >EPS different pretests in B

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

POOR CONTEST .....DO YOU WANT TO JUDGE ON THE BASIS OF HACKS ....EXPECTED MUCH MORE FROM IIIT — H

→ Reply
»
5 years ago, # |
← Rev. 3   Vote: I like it +81 Vote: I do not like it

Any verdict, system tests.

I doubt if mining bitcoins is a greater waste of electricity than running today's pretests on Codeforces machines.

→ Reply
»
5 years ago, # |
  Vote: I like it -31 Vote: I do not like it

Make this contest unrated, The codeforces site didnt respond for last 4-5 minutes. It was showing Error 403 Forbidden. Was not able to make submission.

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

In problem D, Ironman can destroy the colony if and only if first half or second half is "full of certain types"?

for example "aaabcd" and 'a' is a certain type, we can destroy it. but "aabcde" ans 'a' is a certain type, can we destroy it?

I can't understand problem...

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

    For the first question: No.

    For the aabcde:

    Yes we can, because all characters of each type lay in one of the two halves:

    Type 'a': each character that equals 'a' is in the first half.

    Type 'b': each character that equals 'b' is in the first half.

    And so on..

    → Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    Statement ambiguity for D is discussed in this thread

    → Reply
»
5 years ago, # |
  Vote: I like it -17 Vote: I do not like it
  1. Pretests were not properly framed.
  2. Except A problem, all problems were too hard.
  3. The contest was unfair,**useless**,and should be unrated.
→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Another hack for B

3 100 1

1 2 22

answer=12 there is test 15

→ Reply
»
5 years ago, # |
  Vote: I like it +48 Vote: I do not like it

Pls, someone teach the coordinators to say "No" to such tasks and tests. What were the testers doing during preparing the round? Make this shame unrated, and let no one ever remember about it

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

As system test proceeds, the contest is turning out to be a speed test for problem-A. This is unfair.
Please make it unrated.

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

    100+ test case in b , thats weired with so weak pt .

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

      During system testing, they add all the hacks that other users submitted to the tests.

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

      Yeah so basically,
      For a not-pro coder like me:
      1) Solve A.
      2) See B, think too much.
      3) After a while, see number of submissions increasing fast.
      4) Guess a solution and get prestests passed.
      5) See C, think too much...
      6) Unfortunately your B has got hacked :(
      7) Try fixing B. Get it fixed somehow. But couldn't solve C because of time.
      8) Fail main-tests for B.
      9) Rank list = Speed test for A :)

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

        Sometimes 6) is omitted.

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

          I meant in this contest particularly. Not in general :)

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

            I meant that, too. -> (In this contest, somtimes~)

            → Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    Its turning out to be efficiency test for B. Obviously the ones who solved B thought better than others. And that's what should affect rating coz rating is all about how well you can solve a problem.

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

      I think its easy to talk without participating in the round.

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

In D , the lenght of S should be <=10^4 it will be more fair

→ Reply
»
5 years ago, # |
  Vote: I like it +16 Vote: I do not like it

Now I know that in iiit-h, h stands for hacks!

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

Anybody has an idea for test 115 in problem B?

→ Reply
»
5 years ago, # |
  Vote: I like it -26 Vote: I do not like it

I propose that anybody who passes the first 100 test cases on problem B is automatically counted as Accepted.

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

    But why? Their solution is wrong if it doesn't pass all tests.

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

      Sure, but if we get rid of all the tests past 100, then the solution will pass all tests and be correct.

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

        Yeah, and if we have no tests for any question, then everyone can have AC.

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

    So fair! What if you got the wrong answer on test case 90? :)))

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

      Ok, let's make it so that anybody who passes the first 89 is accepted then

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

        I like you got wrong on 111. Let's stop thinking about our ratings and getting accepted while our solutions are wrong. The explanations and pretests were really weak, don't kill the facts just for your sake!

        → Reply
»
5 years ago, # |
  Vote: I like it +29 Vote: I do not like it

Authors, stop doing contest please!

→ Reply
»
5 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Shit just got real! IIIT-H Thanks for hackforces!

→ Reply
»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

The Rating of Problem B will go up...

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it +37 Vote: I do not like it
  • IIIT H : we dont have people who can set hard probs for div 1.
  • Also IIITH : * makes DIV 1 D/E instead of DIV2 D/E *
→ Reply
»
5 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Yyyyeeeaahhh boooyyy!!!

4.3k for A -> 550 for B. The biggest jump I remember.)

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

Thanks for weak pretests!

→ Reply
»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

why so many WA on B ?

→ Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it -8 Vote: I do not like it

    There should be much precision (I don't mean 0.000001 precision) in a solution of this problem, beside that, the weak pretests will result in these many WAs, because one will not pay attention that his solution has weak code when he gets Pretest Passed.

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

      I don't think that precision had anything to do with it. But most people submitted an incorrect greedy solution.

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

For Problem B, the codes that are treated as Wrong Answer on test cases 109, 110, 111, or 115 appear frequently. Did the Problem Setter intentionally not include these test cases into the Pretest?

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

    Maybe it's just people's hacks being added before system testing?

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

      Then the authors didn't have tests for those edge cases in system tests themselves? If so, does that mean they also didn't account for these edge cases (and maybe thought the problem was supposed to be easier).

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

        Seemingly. In fact, the situation where hacks actually filling into the gaps was known before.

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

      Probably. Testcase 115 was my testcase for hacking.

      → Reply
»
5 years ago, # |
  Vote: I like it -17 Vote: I do not like it

This ought to be unrated.

→ Reply
»
5 years ago, # |
  Vote: I like it -11 Vote: I do not like it

That round deserves and oughts to be unrated, or semi-rated, cause it's become truly unfair

→ Reply
»
5 years ago, # |
  Vote: I like it -10 Vote: I do not like it

Hello everyone, you know, there is such wisdom that the blue ones do not make up the rounds. Today I made sure that if they make up it is some kind of shit but a round is slop-top (sorry for my English)

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

    but problem setters were purple too ! what about them

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

      The very fact that the blues were involved in it is already shit, although people who are divas 2 in my opinion have no right to compose a round

      → Reply
»
5 years ago, # |
  Vote: I like it +13 Vote: I do not like it

That feeling, when you know your solution will fail main-tests. But still is in system testing queue :)

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

The number of Accepted code for Problem B is far less than that of Problem C... And is about 13% of that of Problem A now. Isn't it abnormal?

→ Reply
»
5 years ago, # |
  Vote: I like it +4 Vote: I do not like it

can anyone tell me why this is giving TLE ?? https://codeforces.com/contest/1111/submission/49428534

→ Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it +1 Vote: I do not like it

    Your algorithm complexity is O(N * 2^N)

    In the case : num == 0, you don't need to recurse because the answer will be automatically A This will stop recursion in all segments containing no elements :)

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

I wish this contest would have been swapped with the previous one.
- The previous contest deserved to be on the day before chinese lunar new year and also being a very good round.
- And this contest deserves to have a long queue, leading to an unrated round.

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Was testcase 15(Problem B) intentionally not kept in pretest?

→ Reply
»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

people who failed in B and blaming for weak pretests, better next time write proper code and don't complain. LOL

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

    hmmm people who didn't succeed just need to succeed next time.....

    → Reply
»
5 years ago, # |
  Vote: I like it -11 Vote: I do not like it

UNRATED!

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

System test on B was hell of a massacre.

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

Bad pretests destroyed good problems ...

→ Reply
»
5 years ago, # |
  Vote: I like it -6 Vote: I do not like it

The problem difficulty and acceptance rate are very similar to the contests that happen on codechef. This has been one of the major issues for codechef and now codeforces too. Hope they get done with it soon.

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

why the answer of testcase # 115 is 5.500000 ?

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

    It is 5.66666666666666666652.

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

    Because you can increment each element k times.

    Sadly I got it otherwise during the contest :c

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

    maybe you didn't consider the fact limit of k was for each superhero, for # 115 best is 5 6 6

    → Reply
»
5 years ago, # |
← Rev. 4   Vote: I like it 0 Vote: I do not like it

My first solution C with "compilation error" in contest https://codeforces.com/contest/1111/submission/49430877. The same solution C with "accepted" after contest https://codeforces.com/contest/1111/submission/49435696. Why does the same code have different result????

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

у CodeCraft раунды всегда ********* ** * * ***** ** * ***

→ Reply
»
5 years ago, # |
  Vote: I like it +315 Vote: I do not like it

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

    Lmao this surely deserves an upvote

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

    Jokes aside, this contest resulted 2342 successful hacks in total, which is less than Codecraft-18 last year (3442) but more than Codecraft-17 (2334). Also, it did not broke GreenGrape's record of 3773 hacks. It's in the top 10 most hacked contest tho.

    I used this javascript in case you are interested.

    Spoiler
    → Reply
»
5 years ago, # |
  Vote: I like it +10 Vote: I do not like it

the man who posted test case 110 of B is very genius

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Contest should be rated.

→ Reply
»
5 years ago, # |
  Vote: I like it +2 Vote: I do not like it

The framing of questions was unclear. That is the minimum standard a person expects from a CP question. On top of that weak test cases.

→ Reply
»
5 years ago, # |
  Vote: I like it +8 Vote: I do not like it

What is the use of giving pretests if strong cases are not included in it?

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

The worst contest in my life.

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

This is what you call 1080P shit

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

When your B's solution get hacked while hacking others A.......SAD LIFE!

→ Reply
»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Is it ok that solution got CE on system tests but passed pre tests?

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

    Verdict says Can't compile file: Compiled file is not a valid executable. Probably, the source tried to use too large static array(s).

    I don't know how works GCC array extension. Maybe in this particular test just too much memory trying to be allocated...

    P.S. Read that in GCC double a[n + 1] allocates array a size of n + 1 on stack. Pretty sure it's should be SF on big n and UB on middle n. But why on Earth it is CE don't know.

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

    P.S. Now I'm think that I'm wrong. 49433475 and 49438205. Absoulete same code, same compiler, no any static array but first submission gives CE second AC.

    → Reply
»
5 years ago, # |
  Vote: I like it +1 Vote: I do not like it

u have renamed CODEFORCES into HACKFORCES !

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

Besides the pretests, system tests for B are also weak. see this accepted submission.

And hack case
2 100000 3
1 1

probably need more corner cases

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

    Agree. I see a lot of submissions failed on hack tests (test >= #109) during system test. They would have been accepted without the hacks. Corner cases should have been considered thoroughly rather than adding bunch of random tests.

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

I think it’s a bit rudely to downvote this contest.I mean,problemsetter spent hours to make this contest,and people downvote it

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

I never expected such a contest from IIIT Hyderabad :(

→ Reply
»
5 years ago, # |
  Vote: I like it -19 Vote: I do not like it

It feels weird to be bashing on an Indian contest without Ashishgup.

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

Why were almost all tests for B and C(maybe other problems too, didn't check) literally random? For example, there is no max test for C, which is probably the only reason why 49441838 gets AC.

→ Reply
»
5 years ago, # |
  Vote: I like it +2 Vote: I do not like it

https://codeforces.com/contest/1111/submission/49427048

This submission shows compilation error. Although it runs for 39 test cases fine and shows the error at test 40. Also, I resubmitted the same solution after contest. It gets accepted. What can be the reson behind this ?

→ Reply
»
5 years ago, # |
  Vote: I like it +6 Vote: I do not like it

emm... Can anyone give a explanation about the rest examples in problem D to me? I think that the statement for D is too confusing... XD Thanks!

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

    Problem.D means that the same kind of villains should be on the same side(left or right)

    ps: they don't have to be together

    for example: "abacdc" is ok!

    so...

    • why in the first case, 2nd question's answer equals 0: because AAaa have 4 characters and they can't be gathered in the 1st or 2nd half(the side's length equals 2)!

    • abcd
1
1 3
// Answer: 8
    1. acbd
    2. acdb
    3. cabd
    4. cadb

    5~8. just reverse the strings above!

    → Reply
»
5 years ago, # |
  Vote: I like it +13 Vote: I do not like it

Have a nice Hacking last night. But Problem B failed on system test.

昨晚叉得好爽 但是B fst了

→ Reply
»
5 years ago, # |
  Vote: I like it +1 Vote: I do not like it

My Submission during the Contest failed with compile error, but after the contest, I send same code and accepted. It must be system error but I don't know what should I do. Does anyone know what I should do or how to contact codeforce's support?

→ Reply
»
5 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Please make strong pretests, it will be helpful for many contestants.

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Check this test case for Question 2 :- Input :- 2 5 1 1 100 Output :- 101 Correct Answer:- 100 This is output of my friends Code which passed all test cases after contest.

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

http://codeforces.com/contest/1111/submission/49430322 Hack me, please.

→ Reply
»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

I misunderstood the statement of problem B but still passed pretests and got 4 successful hacking attempts on B >.<

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

    Same, I bet authors didn't even have the correct solution for B

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

Can anyone help?... :( My code seems almost similar to the author's answer code but the memory keeps exceeding at case 6. I couldn't find what the problem is so I'm asking you guys out there for help...ㅠㅠ Thanks!

49458160

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

long long int n, k, A, B;
vector<long long int> vec;

long long int rec(long long int l, long long int r) {
	long long i = lower_bound(vec.begin(), vec.end(), l) - vec.begin();
	long long j = upper_bound(vec.begin(), vec.end(), r) - vec.begin();
	j--;
	long long x = j - i + 1;
	if (l == r) {
		if (x == 1) {
			return B;
		} else if (x == 0) {
			return A;
		}
	}
	if (x == 0) {
		return A;
	} else {
		return min(B*x*(r-l+1), rec(l,(l+r)/2)+rec((l+r)/2+1,r));
	}
}

int main() {
	scanf("%lld %lld %lld %lld", &n ,&k, &A, &B);
	for (long long int i = 1; i <= k; i++) {
		long long int a; scanf("%lld", &a);
		vec.push_back(a);
	}
	sort(vec.begin(), vec.end());
	printf("%lld", rec(1, 1<<n));
	return 0;
}
→ Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 3   Vote: I like it 0 Vote: I do not like it
    code
    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      and your original code will not terminate (stack overflow)

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

And some more bugs of CF.

PS: Maybe CF should add foulder 'report bug'.

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

Why my code is compiler error in system testing, but after that I resubmit the same code, it becomes accepted again?

→ Reply
»
5 years ago, # |
  Vote: I like it +25 Vote: I do not like it

Why rating will be recalculated? Any particular reason?

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

    And why this decision has made after calculatingit? Normally it is stated in announcement just after contest.

    → Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it -13 Vote: I do not like it

Thanks MikeMirzayanov for recalculating and saving the earth! :)

→ Reply
»
5 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Ratings for the round 537 will be recalculated and returned back. ??? WHY

→ Reply
»
5 years ago, # |
  Vote: I like it +12 Vote: I do not like it

There was no reason making the contest unrated just because pretests were weak is that what you got? Even if pretests are weak its a coders duty to check his solution with his own test cases and read the statement carefully and if hacked just accept that his solution was wrong. Making the contest unrated when wished is not the right thing to do. Although i agree many people got hacked in B i myself got hacked but that's just teaches us to check our solution before submitting whatever happens. I became expert after this contest and was happy and celebrating but now this. Its just devastating. I know nothing can be done now but hope nothing happens like this in future.

→ Reply
»
5 years ago, # |
  Vote: I like it -12 Vote: I do not like it

make this round unrated .

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

    True coder is who can imagine all test cases before typing code , not making hit and trial . And problem setter can't set all test cases in pretest.

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

Poor pretest ....

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

When your submission for task B was hacked

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

rated, unrated, semi-rated, ... and now we have rerated round!

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

Why this round problems do not have difficulty tag?

→ Reply