darshankdarji's blog

By darshankdarji, history, 7 years ago, In English

plz help me find out why test case 9 don't work for my code

my solution is this http://mirror.codeforces.com/contest/939/submission/35414707

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

»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can you explain your logic clearly ?

I also failed on the test 9. But my error was different. The time wasn't wrapping around if it was negative.

P.S. — Another advice I'd like to give you is, don't submit 8-9 times in a contest unless you're sure it's correct. You would have gained 100+ rating points if you only submitted C once.

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

    thx ghoshsai5000...so my logic is that find max sum of (f-s) element of array and set first element of that group to 1 according local time and then set it according to first time zone ....

»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

The question asked you to find the minimum value of the time you could assign to the first zone. You have not done that as it is possible to assign a value lower than the value you outputted to get the same number of people to participate.

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

    thx in one of my code i also consider that solutions but instead of tp=s-id[i]; i write tp=s-id[0]; thx any way

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

      If there are multiple possible answers (in terms of participating population), print the minimum one ... I think your code is not doing that.

      Whenever you find a segment of as much population size as the total population, check if the answer would be less if you chose this one rather than the other one.

»
7 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Dear darshankdarji,

Please check the following fix for your code.

35446463

Best wishes