結果
問題 | No.1190 Points |
ユーザー | Keroru |
提出日時 | 2020-08-22 16:02:25 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,753 bytes |
コンパイル時間 | 453 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 128,416 KB |
最終ジャッジ日時 | 2024-10-15 10:09:26 |
合計ジャッジ時間 | 14,661 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 154 ms
92,800 KB |
testcase_01 | AC | 154 ms
92,736 KB |
testcase_02 | AC | 153 ms
92,672 KB |
testcase_03 | AC | 470 ms
116,848 KB |
testcase_04 | AC | 442 ms
113,884 KB |
testcase_05 | WA | - |
testcase_06 | AC | 542 ms
122,096 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 543 ms
126,848 KB |
testcase_10 | AC | 529 ms
128,224 KB |
testcase_11 | WA | - |
testcase_12 | AC | 562 ms
125,796 KB |
testcase_13 | AC | 508 ms
111,220 KB |
testcase_14 | AC | 232 ms
108,160 KB |
testcase_15 | AC | 676 ms
128,028 KB |
testcase_16 | AC | 218 ms
96,012 KB |
testcase_17 | AC | 646 ms
122,496 KB |
testcase_18 | AC | 379 ms
103,772 KB |
testcase_19 | AC | 215 ms
110,832 KB |
testcase_20 | AC | 458 ms
108,396 KB |
testcase_21 | AC | 283 ms
105,360 KB |
testcase_22 | AC | 287 ms
115,428 KB |
testcase_23 | AC | 690 ms
125,428 KB |
testcase_24 | AC | 684 ms
125,264 KB |
testcase_25 | AC | 583 ms
126,208 KB |
testcase_26 | AC | 411 ms
125,340 KB |
testcase_27 | AC | 608 ms
125,920 KB |
ソースコード
import sys,bisect,string,math,time,functools,random,fractions from heapq import heappush,heappop,heapify from collections import deque,defaultdict,Counter from itertools import permutations,combinations,groupby rep=range;R=range def Golf():n,*t=map(int,open(0).read().split()) def I():return int(input()) def S_():return input() def IS():return input().split() def LS():return [i for i in input().split()] def MI():return map(int,input().split()) def LI():return [int(i) for i in input().split()] def LI_():return [int(i)-1 for i in input().split()] def NI(n):return [int(input()) for i in range(n)] def NI_(n):return [int(input())-1 for i in range(n)] def StoLI():return [ord(i)-97 for i in input()] def ItoS(n):return chr(n+97) def LtoS(ls):return ''.join([chr(i+97) for i in ls]) def RA():return map(int,open(0).read().split()) def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)] def RI(a=1,b=10):return random.randint(a,b) def Rtest(T): case,err=0,0 for i in range(T): inp=INP() a1,ls=naive(*inp) a2=solve(*inp) if a1!=a2: print((a1,a2),inp) err+=1 case+=1 print('Tested',case,'case with',err,'errors') def GI(V,E,ls=None,Directed=False,index=1): org_inp=[];g=[[] for i in range(V)] FromStdin=True if ls==None else False for i in range(E): if FromStdin: inp=LI() org_inp.append(inp) else: inp=ls[i] if len(inp)==2: a,b=inp;c=1 else: a,b,c=inp if index==1:a-=1;b-=1 aa=(a,c);bb=(b,c);g[a].append(bb) if not Directed:g[b].append(aa) return g,org_inp def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1): #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage mp=[boundary]*(w+2);found={} for i in R(h): s=input() for char in search: if char in s: found[char]=((i+1)*(w+2)+s.index(char)+1) mp_def[char]=mp_def[replacement_of_found] mp+=[boundary]+[mp_def[j] for j in s]+[boundary] mp+=[boundary]*(w+2) return h+2,w+2,mp,found def TI(n):return GI(n,n-1) def accum(ls): rt=[0] for i in ls:rt+=[rt[-1]+i] return rt def bit_combination(n,base=2): rt=[] for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s] return rt def gcd(x,y): if y==0:return x if x%y==0:return y while x%y!=0:x,y=y,x%y return y def YN(x):print(['NO','YES'][x]) def Yn(x):print(['No','Yes'][x]) def show(*inp,end='\n'): if show_flg:print(*inp,end=end) mo=10**9+7 inf=float('inf') FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb)) l_alp=string.ascii_lowercase #sys.setrecursionlimit(10**9) read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip() show_flg=False show_flg=True ans=0 ans=[] n,m,p=LI() s,g=LI_() e=[[]for i in range(2*n)] for i in range(m): a,b=LI_() e[a]+=[b+n] e[b]+=[a+n] e[a+n]+=[b] e[b+n]+=[a] def bfs(x,root_v=0): q=deque([x]) v=[inf]*n*2 v[x]=root_v while q: c=q.popleft() for nb in e[c]: if v[nb]==inf: q.append(nb) v[nb]=v[c]+1 return v vs=bfs(s) vg=bfs(g) vgo=bfs(g+n) if p%2==0: for i in range(n): if vs[i]+vg[i]<=p: ans+=i+1, else: for i in range(n): if vs[i]+vgo[i]<=p or vs[i+n]+vgo[i+n]<=p: ans+=i+1, if ans: print(len(ans)) for i in ans: print(i) else: print(-1)