結果

問題 No.2664 Prime Sum
ユーザー KeroruKeroru
提出日時 2024-03-08 21:37:54
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 156 ms / 2,000 ms
コード長 4,052 bytes
コンパイル時間 321 ms
コンパイル使用メモリ 82,388 KB
実行使用メモリ 93,556 KB
最終ジャッジ日時 2024-09-29 19:01:42
合計ジャッジ時間 7,059 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 145 ms
92,672 KB
testcase_01 AC 139 ms
92,780 KB
testcase_02 AC 140 ms
92,768 KB
testcase_03 AC 143 ms
92,800 KB
testcase_04 AC 143 ms
92,672 KB
testcase_05 AC 153 ms
93,024 KB
testcase_06 AC 147 ms
93,056 KB
testcase_07 AC 143 ms
92,672 KB
testcase_08 AC 148 ms
92,800 KB
testcase_09 AC 148 ms
92,760 KB
testcase_10 AC 143 ms
92,672 KB
testcase_11 AC 138 ms
92,928 KB
testcase_12 AC 141 ms
92,672 KB
testcase_13 AC 145 ms
92,900 KB
testcase_14 AC 149 ms
93,556 KB
testcase_15 AC 153 ms
93,156 KB
testcase_16 AC 152 ms
93,296 KB
testcase_17 AC 143 ms
92,800 KB
testcase_18 AC 147 ms
92,928 KB
testcase_19 AC 143 ms
92,984 KB
testcase_20 AC 149 ms
93,224 KB
testcase_21 AC 147 ms
93,184 KB
testcase_22 AC 145 ms
93,056 KB
testcase_23 AC 150 ms
93,440 KB
testcase_24 AC 152 ms
93,448 KB
testcase_25 AC 150 ms
93,440 KB
testcase_26 AC 141 ms
92,672 KB
testcase_27 AC 138 ms
92,672 KB
testcase_28 AC 152 ms
92,928 KB
testcase_29 AC 156 ms
92,788 KB
testcase_30 AC 150 ms
92,672 KB
testcase_31 AC 146 ms
92,544 KB
testcase_32 AC 156 ms
92,724 KB
testcase_33 AC 151 ms
92,860 KB
testcase_34 AC 151 ms
92,672 KB
testcase_35 AC 146 ms
92,672 KB
testcase_36 AC 143 ms
92,828 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()
import bisect,string,math,time,functools,random,fractions
from bisect import*
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def I():return int(input())
def LI():return [int(i) for i in input().split()]
def SLI():return sorted([int(i) for i in input().split()])
def LI_():return [int(i)-1 for i in input().split()]
def S_():return input()
def IS():return input().split()
def LS():return [i 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 NLI(n):return [[int(i) for i in input().split()] for i in range(n)]
def NLI_(n):return [[int(i)-1 for i in input().split()] 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 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 INP():
    N=6
    n=random.randint(1,N)
    mn=0
    mx=n
    a=[random.randint(mn,mx) for i in range(n)]
    return n,a
def Rtest(T):
    case,err=0,0
    for i in range(T):
        inp=INP()
        a1=naive(*inp)
        a2=solve(*inp)
        if a1!=a2:
            print(inp)
            print('naive',a1)
            print('solve',a2)
            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;bb=b;g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def RE(E):
    rt=[[]for i in range(len(E))]
    for i in range(len(E)):
        for nb,d in E[i]:
            rt[nb]+=(i,d),
    return rt
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
#mo=998244353
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))
alp=[chr(ord('a')+i)for i in range(26)]
#sys.setrecursionlimit(10**7)


show_flg=False
show_flg=True

# Verified by
# https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_ao
# edgeを引数に二部グラフ判定

def IsBipartite(edge):
    n=len(edge)
    v=[-1 for i in range(n)]
    for c in range(n):
        if v[c]!=-1:
            continue
        q=[c]
        v[c]=0
        while q:
            c=q.pop()
            for nb in edge[c]:
                if v[nb]==-1:
                    q.append(nb)
                    v[nb]=1-v[c]
                elif v[nb]==v[c]:
                    return False
    return True

ans=0

n,m=LI()
g,_=GI(n,m)

Yn(IsBipartite(g))
0