fcspartakm's blog

By fcspartakm, history, 4 years ago, translation, In English
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
 
 
 
 
  • Vote: I like it
  • +23
  • Vote: I do not like it

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

Where can we get the questions in english?

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

Why can't I participate in this contests?

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

I think that k = 0 is a special case in the problem D.

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

What is test 49 for problem C???

I get WA on it, and couldn't understand what I did wrong, Can anyone please see my code:

25221347

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

    Yes!!! I also asked about it and I got this message:

    There is some bug within this algorithm. I find out some kind of data that can prove it wrong.

    7 4 18
    ..X.
    ....
    ....
    ....
    .**.
    ....
    *b..
    

    This version of code's answer is
    DDDLLDDRDULUURRUUU
    But the true answer should be
    DDDLLDDRDRRUUUUUUL Arriving the position "b", obvoiusly the previous answer is not the good one.

    I have submited another code for this problem and got it accepted.

    Thank you.

    Hope it helped

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

      Exactly :D

      finally I knew whats wrong with my approach, thanks a lot man, I owe you one :)

    • »
      »
      »
      3 years ago, # ^ |
      Rev. 2   Vote: I like it 0 Vote: I do not like it

      BTW, the correct answer for this case is DDDLLDDRDRRUUULUUU since 'L' is minimal than 'U' Hope you update it soon enough, Thank you!

  • »
    »
    3 years ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    I did the same reversal algorithm 26987013 and was so mad how it didn't pass although I'm choosing the minimal each step! Thanks so much for that lovely hack! :)

»
3 years ago, # |
Rev. 2   Vote: I like it -8 Vote: I do not like it

I am getting a WA on test 9 on this. Can someone please help?

This is my submission.

»
2 years ago, # |
Rev. 3   Vote: I like it 0 Vote: I do not like it

I recently solved the problem (C. Cycle In Maze), however when I remove the condition : if ( k % 2 != 0) { cout <<"IMPOSSIBLE"; return 0; } My solution gets TLE on test case 55, why is it so ? http://codeforces.com/contest/769/submission/39343924

»
14 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone help me with time complexity of Editorial solution C?

»
12 months ago, # |
  Vote: I like it +4 Vote: I do not like it

How to solve D using Meet in the Middle? Thank You.

»
10 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anybody please help me out with (C .Cycle in the Maze ),why using dfs i'm getting runtime error on test 8(stack oveflow error).https://codeforces.com/contest/769/submission/67518247

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

I used BFS(kind of) in B. To those who want to look at it: 75487401

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

For problem C cycle in a maze. I would like to clarify a few points. First of all, a solution exists only when k is even because for every right step there has to be left step to neutralize it and for every up step there has to be down step to neutralize only then the initial and final positions could be same. 1)The use of 'D','L','R','U' is done in this order because it would result in the construction of the lexicographically minimal cyclic path which is the requirement of our problem. 2)The second point is that the robot never goes out of the reach of its initial point ch[x][y]='X' and therefore there is always a chance of returning back to the initial position. 3)Suppose currently robot is on the position a since dis[a]<=k so it can go back to the initial position back from here using the same path through which it came as there are no restrictions in travelling the same cell multiple times(even the starting one). My submission https://codeforces.com/contest/769/submission/94294357