Cách đọc test đầu vào Python

Link Đề:https://codeforces.com/problemset/problem/1369/F
Code:
  1. import itertools as it
  2. import collections as cc
  3. import heapq as hp
  4. import sys
  5. I=lambda : list(map(int,input().split()))
  6. import operator as op
  7. from functools import reduce
  8. n,m=I()
  9. w=I()
  10. de=[0]*n
  11. for i in range(n):
  12. de[i]=[0]
  13. pre=[0]*m
  14. visi=[0]*m
  15. for i in range(m):
  16. x,y=I()
  17. x-=1;y-=1
  18. pre[i]=[x,y]
  19. de[x][0]+=1
  20. de[y][0]+=1
  21. de[x].append(i)
  22. de[y].append(i)
  23.  
  24. an=[]
  25. te=[]
  26. ans=[]
  27. for i in range(n):
  28. if de[i][0]<=w[i]:
  29. te.append(i)
  30.  
  31. while len(te)>0:
  32. tem=te.pop()
  33. for i in range(1,len(de[tem])):
  34. fr=de[tem][i]
  35. if not visi[fr]:
  36. visi[fr]=1
  37. ans.append(fr+1)
  38. fo=pre[fr][0]+pre[fr][1]-tem
  39. de[fo][0]-=1
  40. if de[fo][0]==w[fo]:
  41. te.append(fo)
  42.  
  43.  
  44.  
  45. if len(ans)==m:
  46. print("ALIVE")
  47. print(*ans[::-1])
  48. else:
  49. print("DEAD")

Nhận xét

Đăng nhận xét

Bài đăng phổ biến từ blog này

Sinh Test trong Python va code AC

P1: #file = "C:/New folder/aka/1.inp" #with open(file) as f: # a,b=[int(x) for x in next(f).split()] #print(a) #print(b) def gg(id): file= "C:/New folder/aka/" +id+ ".inp" with open (file) as f: a,b=[ int (x) for x in next (f).split()] products = set () for pair in [(x,y) for x in range ( 2 ,a+ 1 ) for y in range ( 2 ,b+ 1 )]: products.add(pair[ 0 ]**pair[ 1 ]) return len (products) x= range ( 1 , 101 ) for i in x: id= str (i) file1 = "C:/New folder/aka/" +id+ ".out" f= open (file1, "w" ) f.write( str (gg(id))) f.close() P2: a,b=[ int (x) for x in input ().split()] product = set () for pair in [(x,y) for x in range ( 2 ,a+ 1 ) for y in range ( 2 ,b+ 1 )]: product.add(pair[ 0 ]**pair[ 1 ]) print ( len (product))
Đọc thêm

Cách tính a*b mod m , a^b mod m , a^(-1) mod m với m không phải là số nguyên tố (inversion có nghĩa khi (a,m)=1)

#include <bits/stdc++.h> using namespace std ; #define ll long long #define MOD (ll)(1000000000000000009) ll inv ( ll a , ll mod ){ ll r = mod ; ll nr = a ; ll t = 0 ; ll nt = 1 ; ll tmp ; while ( nr != 0 ){ ll q = r / nr ; tmp = nt ; nt = t - q * nt ; t = tmp ; tmp = nr ; nr = r - q * nr ; r = tmp ; } if ( r > 1 ) return - 1 ; // no inverse if ( t < 0 ) t += mod ; return t ; } ll f ( ll a , ll n , ll mod ){ ll res = a , ans = 0 ; while ( n ){ if ( n % 2 ) ans = ( ans + res ) % mod ; res = ( res + res ) % mod ; n /= 2 ; } return ans ; } ll po ( ll a , ll n , ll mod ){ ll res = a , ans = 1 ; while ( n ){ if ( n % 2 ) ans = f ( ans , res , mod ); res = f ( res , res , mod ); n /= 2 ; } return ans ; } int main (){ ll x , y , z , m , dem = 0 , res1 , res2 , res , tmp
Đọc thêm

Python - Liệt kê tất các các chu trình trong đồ thị

graph = [[1, 2], [1, 3], [1, 4], [2, 3], [3, 4], [2, 6], [4, 6], [8, 7], [8, 9], [9, 7]] cycles = [] def main(): global graph global cycles for edge in graph: for node in edge: findNewCycles([node]) for cy in cycles: path = [str(node) for node in cy] s = ",".join(path) print(s) def findNewCycles(path): start_node = path[0] next_node= None sub = [] #visit each edge and each node of each edge for edge in graph: node1, node2 = edge if start_node in edge: if node1 == start_node: next_node = node2 else: next_node = node1 if not visited(next_node, path): # neighbor node not on path yet sub = [next_node] sub.extend(path) # explore extended path findNewCycles(sub); e
Đọc thêm