Hidden? uncategorized solution for Digging a Canal by veky - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

Hidden? solution in Uncategorized category for Digging a Canal by veky

def checkio(data):
    aux=[0]*len(data[0])
    data[:0]=[aux]
    data.append(aux)
    D,Q={},{(len(data)-1,0):0}
    while Q:
        v=i,j=min(Q,key=Q.get)
        r=D[v]=Q.pop(v)
        if v==(0,0): return r
        Q.update({(ni,nj):r+data[ni][nj] for ni,nj in [(i-1,j),(i+1,j),(i,j-1),(i,j+1)]
            if (ni,nj) not in D if 0<=ni
                        June 19, 2013

                        
                            Comments:
                            
                                
                                    Miaou
 on June 21, 2013, 5:05 p.m.

                                    <p>Nice list.insert(0, ...) !</p>

<p>Nice hidden Dijkstra !</p>

<p>You were having performance considerations with bryukh about his <a href="http://www.checkio.org/mission/implementation/python-3/20462/#comment-outer-4263">Ore in the Desert</a>, but you do a min(Q) which is algorithmically not efficient :P</p>

                                
                            
                                
                                    veky
 on June 21, 2013, 9:41 p.m.

                                    <p>Of course it's not. Either you didn't understand what I and bryukh were talking about, or you are also teasing me. :-D heapq is just not worth it. And I won't even mention priorityDictionary. ;-]</p>

<p>Yes, I didn't see insert. First both were slices assignments, then I converted the second one to append, but unfortunately left the first one. Good catch.</p>

<p><em>Hidden</em> Dijkstra?! It's practically copied from <a href="http://code.activestate.com/recipes/119466-dijkstras-algorithm-for-shortest-paths/">http://code.activestate.com/recipes/119466-dijkstras-algorithm-for-shortest-paths/</a> How much more obvious can it be? :-)</p>

                                
                            
                                
                                    Miaou
 on June 21, 2013, 10:07 p.m.

                                    <blockquote>
  <p>Of course it's not</p>
</blockquote>

<p>I was thinking about complexity considerations ^^ Your implementation is O(n²).</p>

<blockquote>
  <p><em>Hidden</em> Dijkstra?!</p>
</blockquote>

<p>Hmm. Let's say "obfuscated" if you prefer... When len(variables_names) &lt; 2, it is unreadable (or with big efforts), and thus obfuscated :-D</p>

<blockquote>
  <p>It's practically copied from [...]</p>
</blockquote>

<p>Doesn't mean it is readable ! ^^</p>

<p>Maybe you only type with 1 or 2 fingers so you write only short programs, and use only short variable names ??? xD</p>

                                
                            
                                
                                    veky
 on June 22, 2013, 6:45 a.m.

                                    <blockquote>
  <blockquote>
    <p>Of course it's not</p>
  </blockquote>
  
  <p>I was thinking about complexity considerations ^^ Your implementation is O(n²).</p>
</blockquote>

<p>Sorry, misunderstanding here... I replied to your "is not efficient". Of course it isn't efficient. :-) It's not <em>me</em> who is obsessed with microefficiency. Read my dialogue with bryukh once more. ;-)</p>

<p>About len(var)&lt;2... as I said, I just copied it. Complain to ActiveState. :-)

&gt; Doesn't mean it is readable ! ^^</p>

<p>I never said it was. I just said it is not hidden. How many readable Dijkstras you want to read before you can recognize this one as a Dijkstra? :-P</p>

HubSpot

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!