結果

問題 No.1301 Strange Graph Shortest Path
ユーザー とりゐとりゐ
提出日時 2022-11-10 00:27:17
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,673 ms / 3,000 ms
コード長 4,138 bytes
コンパイル時間 624 ms
コンパイル使用メモリ 86,216 KB
実行使用メモリ 418,592 KB
最終ジャッジ日時 2023-09-30 11:05:01
合計ジャッジ時間 61,001 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 79 ms
71,408 KB
testcase_01 AC 77 ms
70,892 KB
testcase_02 AC 2,596 ms
405,004 KB
testcase_03 AC 2,247 ms
369,148 KB
testcase_04 AC 2,456 ms
417,540 KB
testcase_05 AC 2,496 ms
411,576 KB
testcase_06 AC 2,359 ms
389,628 KB
testcase_07 AC 2,321 ms
393,944 KB
testcase_08 AC 2,240 ms
372,424 KB
testcase_09 AC 1,984 ms
374,064 KB
testcase_10 AC 2,050 ms
371,512 KB
testcase_11 AC 2,335 ms
402,016 KB
testcase_12 AC 2,187 ms
402,844 KB
testcase_13 AC 2,044 ms
410,528 KB
testcase_14 AC 2,365 ms
373,460 KB
testcase_15 AC 1,991 ms
378,644 KB
testcase_16 AC 2,481 ms
418,592 KB
testcase_17 AC 2,447 ms
416,228 KB
testcase_18 AC 2,486 ms
384,796 KB
testcase_19 AC 2,057 ms
391,836 KB
testcase_20 AC 2,262 ms
386,396 KB
testcase_21 AC 2,294 ms
408,892 KB
testcase_22 AC 2,490 ms
393,892 KB
testcase_23 AC 2,097 ms
412,508 KB
testcase_24 AC 2,335 ms
389,596 KB
testcase_25 AC 2,393 ms
417,544 KB
testcase_26 AC 2,254 ms
394,672 KB
testcase_27 AC 2,033 ms
401,820 KB
testcase_28 AC 2,121 ms
395,580 KB
testcase_29 AC 2,673 ms
416,304 KB
testcase_30 AC 2,212 ms
414,864 KB
testcase_31 AC 2,291 ms
412,960 KB
testcase_32 AC 81 ms
71,284 KB
testcase_33 AC 1,319 ms
407,952 KB
testcase_34 AC 2,091 ms
417,260 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import heapq
class mcf_graph():
    n=1
    pos=[]
    g=[[]]
    def __init__(self,N):
        self.n=N
        self.pos=[]
        self.g=[[] for i in range(N)]
    def add_edge(self,From,To,cap,cost):
        assert 0<=From and From<self.n
        assert 0<=To and To<self.n
        m=len(self.pos)
        self.pos.append((From,len(self.g[From])))
        self.g[From].append({"to":To,"rev":len(self.g[To]),"cap":cap,"cost":cost})
        self.g[To].append({"to":From,"rev":len(self.g[From])-1,"cap":0,"cost":-cost})
    def get_edge(self,i):
        m=len(self.pos)
        assert 0<=i and i<m
        _e=self.g[self.pos[i][0]][self.pos[i][1]]
        _re=self.g[_e["to"]][_e["rev"]]
        return {"from":self.pos[i][0],"to":_e["to"],"cap":_e["cap"]+_re["cap"],
        "flow":_re["cap"],"cost":_e["cost"]}
    def edges(self):
        m=len(self.pos)
        result=[{} for i in range(m)]
        for i in range(m):
            tmp=self.get_edge(i)
            result[i]["from"]=tmp["from"]
            result[i]["to"]=tmp["to"]
            result[i]["cap"]=tmp["cap"]
            result[i]["flow"]=tmp["flow"]
            result[i]["cost"]=tmp["cost"]
        return result
    def flow(self,s,t,flow_limit=-1-(-1<<63)):
        return self.slope(s,t,flow_limit)[-1]
    def slope(self,s,t,flow_limit=-1-(-1<<63)):
        assert 0<=s and s<self.n
        assert 0<=t and t<self.n
        assert s!=t
        '''
         variants (C = maxcost):
         -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0
         reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge
        '''
        dual=[0 for i in range(self.n)]
        dist=[0 for i in range(self.n)]
        pv=[0 for i in range(self.n)]
        pe=[0 for i in range(self.n)]
        vis=[False for i in range(self.n)]
        def dual_ref():
            for i in range(self.n):
                dist[i]=-1-(-1<<63)
                pv[i]=-1
                pe[i]=-1
                vis[i]=False
            que=[]
            heapq.heappush(que,(0,s))
            dist[s]=0
            while(que):
                v=heapq.heappop(que)[1]
                if vis[v]:continue
                vis[v]=True
                if v==t:break
                '''
                 dist[v] = shortest(s, v) + dual[s] - dual[v]
                 dist[v] >= 0 (all reduced cost are positive)
                 dist[v] <= (n-1)C
                '''
                for i in range(len(self.g[v])):
                    e=self.g[v][i]
                    if vis[e["to"]] or (not(e["cap"])):continue
                    '''
                     |-dual[e.to]+dual[v]| <= (n-1)C
                     cost <= C - -(n-1)C + 0 = nC
                    '''
                    cost=e["cost"]-dual[e["to"]]+dual[v]
                    if dist[e["to"]]-dist[v]>cost:
                        dist[e["to"]]=dist[v]+cost
                        pv[e["to"]]=v
                        pe[e["to"]]=i
                        heapq.heappush(que,(dist[e["to"]],e["to"]))
            if not(vis[t]):
                return False
            for v in range(self.n):
                if not(vis[v]):continue
                dual[v]-=dist[t]-dist[v]
            return True
        flow=0
        cost=0
        prev_cost=-1
        result=[(flow,cost)]
        while(flow<flow_limit):
            if not(dual_ref()):
                break
            c=flow_limit-flow
            v=t
            while(v!=s):
                c=min(c,self.g[pv[v]][pe[v]]["cap"])
                v=pv[v]
            v=t
            while(v!=s):
                self.g[pv[v]][pe[v]]["cap"]-=c
                self.g[v][self.g[pv[v]][pe[v]]["rev"]]["cap"]+=c
                v=pv[v]
            d=-dual[s]
            flow+=c
            cost+=c*d
            if(prev_cost==d):
                result.pop()
            result.append((flow,cost))
            prev_cost=cost
        return result

n,m=map(int,input().split())
g=mcf_graph(n)
for _ in range(m):
  u,v,c,d=map(int,input().split())
  u-=1
  v-=1
  g.add_edge(u,v,1,c)
  g.add_edge(u,v,1,d)
  g.add_edge(v,u,1,c)
  g.add_edge(v,u,1,d)

print(g.flow(0,n-1,2)[1])
0