input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N,M=list(map(int,input().split()))
Y=[list(map(int,input().split())) for i in range(M)]
Y.sort(key=lambda x:x[1])
K=1
x=Y[0][1]
for a,b in Y[1:]:
if a+1>x:
x=b
K+=1
print(K)
| N,M=list(map(int,input().split()))
T=[]
for i in range(M):
u,v=list(map(int,input().split()))
u,v=u,v-1
T.append([u,v])
T.sort(key=lambda x:x[1])
tmp=0
ans=0
for i in range(M):
if tmp<T[i][0]:
tmp=T[i][1]
ans+=1
print(ans)
| p03295 |
N, M = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(M)]
ab = sorted(ab, key=lambda x:x[1], reverse=True)
dellist = lambda items,indices: [item for idx,item in enumerate(items) if idx not in indices]
count = 0
while len(ab) != 0:
p = ab.pop()
count += 1
del_idx =... | N, M = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(M)]
ab = sorted(ab, key=lambda x:x[1])
count = 0
del_num = 0
for i in range(M):
if ab[i][0] >= del_num:
count += 1
del_num = ab[i][1]
print(count) | p03295 |
N, M = list(map(int, input().split()))
bridge = [ list(map(int, input().split())) for _ in range(M)]
cut_count = 0
while True:
summ = [ 0 for _ in range(N)]
for b in bridge:
for i in range(N):
if (b[0] - 1) <= i < (b[1] - 1):
summ[i] += 1
# print(summ, bridge... |
N, M = list(map(int, input().split()))
bridge = [ list(map(int, input().split())) for _ in range(M)]
bridge.sort(key=lambda x:x[1])
cuts = [bridge[0][1]]
for b in bridge[1:]:
cut = cuts[-1]
if b[0]< cut <= b[1]:
continue
cuts.append(b[1])
# print(cuts)
print((len(cuts))) | p03295 |
# ABC103 D-Islands War
N, M = list(map(int, input().split()))
ab = []
for i in range(M):
ab.append(list(map(int, input().split())))
ab = sorted(ab, key=lambda x:x[1])
ans = 0
lastremoved = 0
for i, j in enumerate(ab):
if i == 0:
ans += 1
temp = j[1] - 1
else:
i... | N, M = list(map(int, input().split()))
box = [list(map(int, input().split())) for _ in range(M)]
box = sorted(box, key= lambda x: x[1])
rmax = box[0][1]
ans = 1
for i in range(1, M):
if box[i][0] >= rmax:
rmax = box[i][1]
ans += 1
else:
continue
print(ans) | p03295 |
def merge_sort(arr):
if len(arr) <= 1:
return arr
mid = len(arr) // 2
# ここで分割を行う
left = arr[:mid]
right = arr[mid:]
# 再帰的に分割を行う
left = merge_sort(left)
right = merge_sort(right)
# returnが返ってきたら、結合を行い、結合したものを次に渡す
return merge(left, right)
def merge(le... | #D問題
N,M=list(map(int,input().split()))
AB=[list(map(int,input().split())) for i in range(M)]
AB=sorted(AB, key=lambda x: x[1])
bridges=[]
for i in range(M):
if len(bridges) == 0:
bridges.append(AB[i][1]-1)
elif max(bridges)>=AB[i][0]:
pass
else:
bridges.append(AB[i][1]-1)... | p03295 |
n,m=[int(x) for x in input().split()]
ab=[[int(x) for x in input().split()] for i in range(m)]
ab.sort(key=lambda x:x[1])
#print(ab)
split=[0,]
while len(ab)!=0:
if ab[0][1]-split[-1]>0 and ab[0][0]-split[-1]<=0:
ab.pop(0)
else:
split.append(ab[0][1]-1)
#print(ab)
print((len(split)-1)) | n,m=[int(x) for x in input().split()]
ab=[[int(x) for x in input().split()] for i in range(m)]
ab.sort(key=lambda x:x[1])
#print(ab)
split=[0,]
#while len(ab)!=0:
for item in ab:
if (item[1]-split[-1]>0 and item[0]-split[-1]<=0)!=True:
split.append(item[1]-1)
#print(ab)
print((len(split)-1)) | p03295 |
N,M = list(map(int,input().split()))
ab = []
dp = [0 for i in range(N)]
for i in range(M):
a,b = list(map(int,input().split()))
ab.append([a-1,b-1])
ab.sort(key = lambda ab:ab[1])
count = 0
while ab:
a,b = ab.pop(0)
for i in range(len(ab)-1,-1,-1):
if ab[i][0] < b:
ab.rem... | N,M = list(map(int,input().split()))
ab = []
for i in range(M):
ab.append(list(map(int,input().split())))
ab.sort(key = lambda ab:ab[1])
count = 0
now = 0
for a,b in ab:
if a >= now:
count += 1
now = b
print(count) | p03295 |
n,m = list(map(int, input().split()))
l = [tuple(map(int, input().split())) for _ in range(m)]
l.sort(key=lambda x:x[1],reverse = True)
dec = 0
while l:
a = l.pop()
dec += 1
l = [i for i in l if not (i[0] < a[1] <= i[1])]
print(dec) | n,m = list(map(int, input().split()))
l = [tuple(map(int, input().split())) for _ in range(m)]
l.sort(key=lambda x:x[1])
dec = 0
cur = 0
for i in l:
if i[0] < cur <= i[1]:
continue
else:
dec += 1
cur = i[1]
print(dec) | p03295 |
n,m=list(map(int,input().split()))
ab=[[0]*2 for _ in range(m)]
for i in range(m):
ab[i][1],ab[i][0]=list(map(int,input().split()))
ab.sort()
cnt=0
num=0
for i in range(m):
if ab[i][1]<=num:
continue
else:
cnt+=1
num=ab[i][0]-1
print(cnt) | n,m=list(map(int,input().split()))
ab=[list(map(int,input().split())) for i in range(m)]
ab.sort(key=lambda x:x[1])
cnt=0
x=-1
for i in range(m):
if x<ab[i][0]:
x=ab[i][1]-1
cnt+=1
print(cnt) | p03295 |
N,M = list(map(int,input().split()))
a = [0 for i in range(M)]
b = [0 for i in range(M)]
for i in range(M):
A,B = list(map(int,input().split()))
a[i] = A
b[i] = B
ans = 0
while 1:
if len(a) == 0:
break
maxVal = max(a)
maxIdx = a.index(maxVal)
for j in reversed(list(r... | N,M = list(map(int,input().split()))
listAB = [list([int(x) for x in input().split()]) for i in range(M)]
# 要素の2番目でソート
listAB.sort(key=lambda x: x[1])
# 最後に切った橋の位置
last = -1
ans = 0
for a,b in listAB:
# 切った橋より右側に依頼があるか
if last <= a:
ans += 1
# 切った位置はbの位置
last = b
print(ans... | p03295 |
n,m = list(map(int, input().split()))
qp = [tuple(map(int, input().split())) for _ in range(m)]
qp.sort(key=lambda x:x[1])
ans = 0
pre = 0
while qp:
a,b = qp.pop(0)
if pre<a:
ans += 1
pre = b-1
print(ans) | import sys
input = sys.stdin.readline
n,m = list(map(int, input().split()))
qp = [tuple(map(int, input().split())) for _ in range(m)]
qp.sort(key=lambda x:x[1])
ans = 0
pre = 0
while qp:
a,b = qp.pop(0)
if pre<a:
ans += 1
pre = b-1
print(ans) | p03295 |
N,M=list(map(int, input().split()))
G=[list() for i in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
a-=1
b-=1
G[a].append(b)
G[b].append(a)
ans=0
index=-1
for i in range(1,N):
for p in G[i]:
if index<p<i:
ans+=1
index=i-1
import t... | N,M=list(map(int, input().split()))
G=[list() for i in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
a-=1
b-=1
G[a].append(b)
G[b].append(a)
ans=0
index=-1
for i in range(1,N):
for p in G[i]:
if index<p<i:
ans+=1
index=i-1
print(an... | p03295 |
N,M=list(map(int, input().split()))
G=[list() for i in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
a-=1
b-=1
G[a].append(b)
G[b].append(a)
ans=0
index=-1
for i in range(1,N):
for p in G[i]:
if index<p<i:
ans+=1
index=i-1
import t... | N,M=list(map(int, input().split()))
G=[list() for i in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
a-=1
b-=1
G[a].append(b)
G[b].append(a)
ans=0
index=-1
for i in range(1,N):
for p in G[i]:
if index<p<i:
ans+=1
index=i-1
... | p03295 |
from functools import reduce
from operator import itemgetter
N, M = list(map(int, input().split()))
a, b = list(zip(*(list(map(int, input().split())) for _ in range(M))))
ts = sorted(zip(a, b), key=itemgetter(1))
ans = reduce(
lambda acc, t: acc if t[0] < acc[1] else (acc[0] + 1, t[1]),
ts,
(0, 0)... | from functools import reduce
from operator import itemgetter
N, M = list(map(int, input().split()))
a, b = (
list(zip(*(list(map(int, input().split())) for _ in range(M)))) if M else
((), ())
)
# bについてソートし、橋を取り除く必要があれば可能な限り東の橋を取り除く
ans, _ = reduce(
lambda acc, q: (
(acc[0] + 1, q[1]) i... | p03295 |
a=list(map(int,input().split()))
b=[]
c=[1]*(a[0]-1)
for i in range(a[1]):
b.append(list(map(int,input().split())))
b=sorted(b,key=lambda b:b[1])
for i in range(a[1]):
if i!=0 and b[i-1][0]>=b[i][0]:
continue
if 0 in c[(b[i][0]-1):b[i][1]]:
continue
else:
c[(b[i][1])-2]=0
print((c.cou... | a=list(map(int,input().split()))
b=[]
c=0
r=0
for i in range(a[1]):
b.append(list(map(int,input().split())))
b=sorted(b,key=lambda b:b[1])
for i in range(a[1]):
if b[i][0]<=r:
continue
else:
c=c+1
r=b[i][1]-1
print(c) | p03295 |
n,m = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(m)]
b = []
for i in range(len(a)):
c = a[i]
d = list(range(c[0], c[1]))
b.append(d)
bb = b
e = [0]*(n-1)
h = []
for _ in range(n):
h.append([])
count = 0
visited = []
for i, name in enumerate(bb):... | n, m = list(map(int, input().split()))
box = [list(map(int, input().split())) for i in range(m)]
box = sorted(box, key=lambda x: x[1])
count, cut = 0, 0
for x, y in box:
if cut <= x:
count += 1
cut = y
print(count) | p03295 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | p03295 |
# -*- coding: utf-8 -*-
N,M = list(map(int, input().split()))
abM = [list(map(int, input().split())) for i in range(M)]
abM.sort(key = lambda x: (x[0], x[1]))
tmp_e = abM[0][1]
cnt = 1
for i in range(1,M):
if tmp_e > abM[i][0]:
tmp_e = min(abM[i][1], tmp_e)
else:
cnt += 1
... | # -*- coding: utf-8 -*-
N,M = list(map(int, input().split()))
abM = [list(map(int, input().split())) for i in range(M)]
abM.sort()
tmp_e = abM[0][1]
cnt = 1
for i in range(1,M):
if tmp_e > abM[i][0]:
tmp_e = min(abM[i][1], tmp_e)
else:
cnt += 1
tmp_e = abM[i][1]
print... | p03295 |
n,m=list(map(int,input().split()))
ab=[]
for _ in range(m):
a,b=list(map(int,input().split()))
ab.append([a,b])
ab.sort()
ll=ab[0][0]
rr=ab[0][1]
cnt=1
#print(ab[0],ll,rr,cnt)
for item in ab[1:]:
l=item[0]
r=item[1]
if l>=rr:
cnt+=1
ll=l
rr=r
else... | n,m=list(map(int,input().split()))
ab=[]
for _ in range(m):
a,b=list(map(int,input().split()))
ab.append([a,b])
ab.sort(key=lambda x: x[1])
cnt=0
border=0
for item in ab:
if item[0]>=border:
border=item[1]
cnt+=1
print(cnt)
| p03295 |
N,M = list(map(int, input().split()))
l_table = [False for _ in range(N)]
r_table = [False for _ in range(N)]
lr_table = {}
for _ in range(M):
l_n, r_n = list(map(int, input().split()))
l_table[l_n-1] = True
r_table[r_n-1] = True
lr_table[(l_n-1,r_n-1)] = True
ret = 0
lefts = []
for i in ra... | N,M = list(map(int, input().split()))
r_table = [-1]*N
for _ in range(M):
l_n, r_n = list(map(int, input().split()))
r_table[r_n-1] = max(l_n-1, r_table[r_n-1])
ret = 0
left = -1
for i in range(N):
if left < r_table[i]:
ret += 1
left = i-1
print(ret) | p03295 |
islands, requests = list(map(int, input().split(" ")))
req = []
for r in range(requests):
a, b = list(map(int, input().split(" ")))
req.append([a, b])
req = sorted(req, key = lambda x:x[1])
answer = 1
temp_end = req[0][1]
for r in req:
if r[0] >= temp_end:
temp_end = r[1]
answer +... | length, req = list(map(int, input().split(" ")))
target = []
for i in range(req):
s, e = list(map(int, input().split(" ")))
target.append([s, e])
target.sort(key = lambda x: x[1])
answer = 0
before_e = -1
for s, e in target:
# print(before_e, s, e)
if s < before_e:
answer += 1
el... | p03295 |
# https://atcoder.jp/contests/abc103/tasks/abc103_d
import sys
def solve():
pairs.sort(key=lambda pair: pair[1])
done = set()
cnt = 0
i = 0
while i < m:
if i in done:
i += 1
continue
_, b0 = pairs[i]
cnt += 1
done.add(i)
... | # https://atcoder.jp/contests/abc103/tasks/abc103_d
import sys
def solve():
pairs.sort(key=lambda pair: pair[1])
cnt = 0
base = 0
for (a, b) in pairs:
if a >= base:
cnt += 1
base = b
return cnt
n, m = map(int, input().split())
pairs = [tuple(int(c) for... | p03295 |
import sys, math, itertools, bisect, copy, re
from collections import Counter, deque, defaultdict
# from itertools import accumulate, permutations, combinations, takewhile, compress, cycle
# from functools import reduce
# from math import ceil, floor, log10, log2, factorial
# from pprint import pprint
INF = f... | import sys, math, itertools, bisect, copy, re
from collections import Counter, deque, defaultdict
# from itertools import accumulate, permutations, combinations, takewhile, compress, cycle
# from functools import reduce
# from math import ceil, floor, log10, log2, factorial
# from pprint import pprint
INF = f... | p03295 |
n,m=list(map(int,input().split(' ')))
war=[tuple(map(int,input().split(' '))) for _ in range(m)]
war.sort(key=lambda x:x[1])
bridge=[0]*n
for w in war:
if not 1 in set(bridge[w[0]:w[1]]):
bridge[w[1]-1]=1
print((sum(bridge))) | n,m=list(map(int,input().split(' ')))
war=[tuple(map(int,input().split(' '))) for _ in range(m)]
war.sort(key=lambda x:x[1])
bridge=[0]*n
flag=0
for w in war:
if not w[0]<=flag<w[1]:
flag=w[1]-1
bridge[flag]=1
print((sum(bridge))) | p03295 |
import sys
input = sys.stdin.readline
n, m = [int(x) for x in input().split()]
islands = [set() for _ in range(n + 1)]
for _ in range(m):
ab = [int(x) for x in input().split()]
islands[min(ab)].add(max(ab))
ans = 0
for i in range(1, n):
if i + 1 in islands[i]:
ans += 1
else:... | import sys
input = sys.stdin.readline
n, m = [int(x) for x in input().split()]
islands = [set() for _ in range(n + 1)]
for _ in range(m):
ab = [int(x) for x in input().split()]
islands[min(ab)].add(max(ab))
ans = 0
for i in range(1, n):
if i + 1 in islands[i]:
ans += 1
elif ... | p03295 |
N, M = list(map(int, input().split()))
ans_list = []
for m in range(M):
a, b = list(map(int, input().split()))
flag = True
tmp = {int(i) for i in range(a, b)}
for i in range(len(ans_list)):
if ans_list[i] & tmp != set([]):
ans_list[i] = ans_list[i] & tmp
flag = False
if flag:
... | N, M = list(map(int, input().split()))
ab_list = []
for _ in range(M):
a, b = list(map(int, input().split()))
ab_list.append((a, b))
ab_list.sort(key=lambda x:x[1])
b = -1
ans = 0
for tupl in ab_list:
if b == -1:
ans += 1
b = tupl[1]
elif b == tupl[1]:
continue
elif b != tupl[1... | p03295 |
# -*- coding: utf-8 -*-
from operator import itemgetter
n,m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(m)]
ab.sort(key=itemgetter(1,0))
cnt = 0
cb = -1
for (a,b) in ab:
if cb == -1:
cb = b - 1
cnt += 1
elif a<=cb:
continue
... | # -*- coding: utf-8 -*-
from operator import itemgetter
n,m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(m)]
res = 0
ab.sort(key=itemgetter(1))
i = 0
while i<m:
a,b = ab[i]
for j in range(i+1,m):
if ab[j][0]<b<=ab[j][1]:
i += 1
... | p03295 |
n,m = list(map(int,input().split()))
li = [list(map(int,input().split())) for _ in range(m)]
ans = 0
now = -1
li.sort(key = lambda x:x[1])
for i in range(m):
if li[i][0] <= now and li[i][1] > now:
pass
else:
ans += 1
now = li[i][1] - 1
print(ans)
| import sys
input = sys.stdin.readline
n,m = list(map(int,input().split()))
li = [list(map(int,input().split())) for _ in range(m)]
ans = 0
now = -1
li.sort(key = lambda x:x[1])
for i in range(m):
if li[i][0] <= now and li[i][1] > now:
pass
else:
ans += 1
now = li[i][1... | p03295 |
N,M=list(map(int,input().split()))
E=[(1,N)]
for _ in[0]*M:
a,b=list(map(int,input().split()))
E+=[(a,b)]
F=[]
for s,t in E:
if s<=a and b<=t:
F+=[(a,b)]
else:
F+=[(s,t)]
E=F
cnt=0
while E:
cnt+=1
M, Mi = 0, 0
A = [0]*N
l = len... | n,m=list(map(int,input().split()))
ab=sorted([list(map(int,input().split()))for _ in[0]*m],key=lambda x:x[1])
cnt=0
x=0
for a,b in ab:
if x<a:x=b-1;cnt+=1
print(cnt) | p03295 |
import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
AB=[list(map(int,input().split())) for _ in range(m)]
AB.sort(key=lambda x:x[1])
bridge=[True]*(n-1)
for a,b in AB:
if bridge[a-1:b-1].count(False)==0:
bridge[b-2]=False
print((bridge.count(False))) | import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
AB=[list(map(int,input().split())) for _ in range(m)]
AB.sort(key=lambda x:(x[1],x[0]))
end=AB[0][1]
ans=1
for a,b in AB[1:]:
if end<=a:
end=b
ans+=1
print(ans)
| p03295 |
N,M = list(map(int, input().split()))
AB = []
for _ in range(M):
AB.append(list(map(int,input().split())))
AB.sort(key=lambda x:x[1])
cur = 0
ans = 0
for a,b in AB:
if cur > a:
continue
ans += 1
cur = b
print(ans) | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readl... | p03295 |
N, M = list(map(int, input().split()))
lst = [tuple(map(int, input().split())) for _ in range(M)]
lst.sort(key=lambda x: x[1])
bridge = [False for _ in range(N - 1)]
for war in lst:
if True not in bridge[war[0] - 1:war[1] - 1]:
bridge[war[1] - 2] = True
print((bridge.count(True))) | N, M = list(map(int, input().split()))
lst = [tuple(map(int, input().split())) for _ in range(M)]
lst.sort(key=lambda x: x[1])
bridge = []
for war in lst:
if bridge and war[0] <= bridge[-1]:
continue
bridge.append(war[1] - 1)
print((len(bridge))) | p03295 |
def main():
n, m = list(map(int, input().split()))
rqs = [list(map(int, input().split())) for _ in range(m)]
rqs.sort(key = lambda x: x[1])
cnt = 0
while len(rqs) > 1:
rqs = [x for x in rqs[1:] if x[0] >= rqs[0][1]]
cnt += 1
#print(rqs, cnt)
if len(rqs) == 1:
cnt += 1
print(cnt)
if ... | def main():
n, m = list(map(int, input().split()))
rqs = [list(map(int, input().split())) for _ in range(m)]
rqs.sort(key = lambda x: x[1])
b = -1
cnt = 0
for x in rqs:
if b < x[0]:
b = x[1] - 1
cnt += 1
print(cnt)
if __name__ == '__main__':
main() | p03295 |
from operator import itemgetter
N, M = list(map(int, input().split()))
ab = [[0,0] for i in range(M)]
for i in range(M):
ab[i] = list(map(int, input().split()))
ab = sorted(ab, key=itemgetter(0,1))
re = 1
x, y = ab[0]
for i in range(1, M):
a, b = ab[i]
if b <= x or y <= a: # 切ったとこの範囲外だったら
... | N, M = list(map(int, input().split()))
pair = []
for i in range(M):
a, b = list(map(int, input().split()))
pair.append([b, a])
# bをキーにして昇順にソートする
pair.sort()
ans = 1
y, x = pair[0]
for i in range(1, M):
b, a = pair[i]
if y <= a:
y = b
ans += 1
print(ans) | p03295 |
n,m,*t=list(map(int,open(0).read().split()))
c=d=0
for b,a in sorted([(b,a)for a,b in zip(*[iter(t)]*2)]):
if a>d:c+=1;d=b-1
print(c) | n,m,*t=list(map(int,open(0).read().split()));r=[n+1]*(n+1)
for a,b in zip(*[iter(t)]*2):
r[a]=min(r[a],b)
a=0;cur=n+1
for i in range(n+1):
cur=min(cur, r[i])
if i==cur:
cur=r[i]
a+=1
print(a) | p03295 |
import sys
n, m = list(map(int, sys.stdin.readline().split()))
req = [ list(sorted(map(int, sys.stdin.readline().split())))
for _ in range(m) ]
req.sort(reverse=True)
cutlist = []
for a, b in req:
cut = False
for i in cutlist:
if a <= i and i < b:
cut = True
br... | import sys
n, m = list(map(int, sys.stdin.readline().split()))
req = [ list(sorted(map(int, sys.stdin.readline().split())))
for _ in range(m) ]
req.sort(reverse=True)
lastcut = None
c = 0
for a, b in req:
if lastcut is None or a > lastcut or lastcut >= b:
lastcut = a
c += 1
print(... | p03295 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N,M = LI()
island = [0 for _ in range(N)]
req = [[] for _ in range(N)]
for _ in range(M)... | import sys
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
N,M = LI()
island = [0 for _ in range(N)]
req = [[] for _ in range(N)]
for _ in range(M):
a,b = LI()
req[a-1].append(b-1)
p = 1
ans = 0
for i in range(N):
if island[i] > p:
ans += 1
p = island[i]
fo... | p03295 |
import bisect
N,M = [int(x) for x in input().split()]
l = [[int(x) for x in input().split()] for _ in range(M)]
def do(l):
count = 1
l.sort()
while True:
# l2 = [v2 for (_,v2) in l]
# l2.sort()
nx = min(l,key=lambda x:x[1])[1]
f... | import bisect
N,M = [int(x) for x in input().split()]
l = [[int(x) for x in input().split()] for _ in range(M)]
def do(l):
count = 1
l.sort()
right = l[0][1]
for i in range(len(l)):
if l[i][0] >= right:
right = l[i][1]
count+=1
con... | p03295 |
import copy
n,m = list(map(int,input().split()))
ab = [tuple(map(int,input().split())) for _ in range(m)]
bridge = [0 for _ in range(n)]
bridge_m = [[] for _ in range(n)]
for i in range(m):
for j in range(ab[i][0],ab[i][1]):
bridge[j] +=1
bridge_m[j].append(i)
cnt =0
max_ = max(bridge)
wh... | n,m = list(map(int,input().split()))
ab = [tuple(map(int,input().split())) for _ in range(m)]
ab.sort(key=lambda x:x[1])
last=-1
cnt=0
for i in range(len(ab)):
if(ab[i][0]<=last):pass
else:
last=ab[i][1]-1
cnt+=1
print(cnt) | p03295 |
N, M = list(map(int, input().split()))
ab = []
for _ in range(M):
a, b = list(map(int, input().split()))
ab.append((a,b))
# bの昇順でsort
ab.sort(key=lambda inv: inv[1])
count = 0
while(0 < len(ab)):
count += 1
cutb = ab[0][1]
# cutbで除外できる闘争を除外する
remove_list = []
for i in r... | N, M = list(map(int, input().split()))
ab = []
for _ in range(M):
a, b = list(map(int, input().split()))
ab.append((a,b))
# bの昇順でsort
ab.sort(key=lambda inv: inv[1])
count = 0
while(0 < len(ab)):
count += 1
cutb = ab[0][1]
# cutbで除外できる闘争を除外する
remove_index = 0
for i in r... | p03295 |
N, M = list(map(int, input().split()))
req = [tuple(map(int, input().split())) for _ in range(M)]
req.sort(key=lambda x: x[1])
res = 0
i = 1
while i <= N:
remain = [x for x in req if i <= x[0]]
if len(remain):
i = remain[0][1]
res += 1
else:
break
print(res)
| N, M = list(map(int, input().split()))
req = [tuple(map(int, input().split())) for _ in range(M)]
req.sort(key=lambda x: x[1])
res = 0
i = 1
for m in range(M):
if req[m][0] >= i:
i = req[m][1]
res += 1
print(res)
| p03295 |
n,m=list(map(int,input().split()))
itv=[]
for i in range(m):
a,b=list(map(int,input().split()))
start=min(a,b)
end=max(a,b)
itv.append([end,start])
t,ans=0,0
itv=sorted(itv)
for e,s in itv:
if t<=s:
t=e
ans+=1
print(ans) | n,m=list(map(int,input().split()))
itv=[]
for i in range(m):
a,b=list(map(int,input().split()))
itv+=[(b,a)]
itv=sorted(itv)
cnt=0
l=1
for t,s in itv:
if l<=s:
l=t
cnt+=1
print(cnt) | p03295 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p03295 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p03295 |
n,m = list(map(int,input().split()))
ab = [list(map(int,input().split())) for i in range(m)]
ab.sort()
l,r = ab[0][0],ab[0][1]-1
ans = 1
for i in range(1,m):
l = max(l,ab[i][0])
r = min(r,ab[i][1]-1)
if l > r:
ans += 1
l,r = ab[i][0],ab[i][1]-1
print(ans) | N,M = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(M)]
AB.sort(key=lambda x: x[1])
ans = 1
t = AB[0][1]-1
for i in range(M):
if t < AB[i][0]:
t = AB[i][1]-1
ans += 1
print(ans)
| p03295 |
n,m = list(map(int, input().split()))
t = [[n] for i in range(n)]
for i in range(m):
a,b = list(map(int, input().split()))
t[a-1].append(b-1)
g = []
for i in t:
g.append(sorted(i))
k = 0
ans=0
while k <=n-1:
e = n
for i in g[k:]:
e = min(e,i[0])
if e==n:
break
ans+=1
k = e
prin... | n,m = list(map(int, input().split()))
t = [[n] for i in range(n)]
for i in range(m):
a,b = list(map(int, input().split()))
t[a-1].append(b-1)
g = []
for i in t:
g.append(min(i))
k = 0
ans=0
while k <=n-1:
e = min(g[k:])
if e==n:
break
ans+=1
k = e
print(ans) | p03295 |
N,M = list(map(int,input().split()))
src = [tuple([int(x)-1 for x in input().split()]) for i in range(M)]
src.sort()
ans = 0
minb = N
for a,b in src:
if a >= minb:
ans += 1
minb = b
else:
minb = min(minb,b)
if src[-1][0] < minb:
ans += 1
print(ans) | N,M = list(map(int,input().split()))
src = [tuple(map(int,input().split())) for i in range(M)]
ans = 0
cut = -1
src.sort(key=lambda x:x[1])
for a,b in src:
if a < cut: continue
cut = b
ans += 1
print(ans) | p03295 |
from operator import itemgetter
n, m = list(map(int, input().split()))
ab = sorted([list(map(int, input().split())) for i in range(m)], key=itemgetter(1))
removed = -1
ans = 0
for a, b in ab:
if a > removed:
removed = b - 1
ans += 1
print(ans) | from operator import itemgetter
n, m = list(map(int, input().split()))
ab = sorted([tuple(map(int, input().split())) for i in range(m)], key=itemgetter(1))
removed = -1
ans = 0
for a, b in ab:
if a > removed:
removed = b - 1
ans += 1
print(ans) | p03295 |
# islands war
n,m=list(map(int,input().split()))
lists=[]
for i in range(m):
a,b=list(map(int,input().split()))
lists.append((a,b))
lists=sorted(lists,key=lambda x:(x[0],x[1]))
Uselist=[0 for i in range(n)]
for j in lists:
if not Uselist[j[0]]:
Uselist[j[0]]=j
else:
continu... | # atcoder -take a rest-(easy)
def main():
N, M = list(map(int, input().split()))
conflict = [tuple(map(int, input().split())) for i in range(M)]
newest_destroyed = -1
conflict.sort(key=lambda x: x[1])
res = 0
for l, r in conflict:
if not (l <= newest_destroyed < r):
... | p03295 |
# atcoder -take a rest-(easy)
def main():
N, M = list(map(int, input().split()))
conflict = [tuple(map(int, input().split())) for i in range(M)]
newest_destroyed = -1
conflict.sort(key=lambda x: x[1])
res = 0
for l, r in conflict:
if not (l <= newest_destroyed < r):
... | # atcoder -take a rest-(easy)
#typical greedy
def main():
N, M = list(map(int, input().split()))
conflict = [tuple(map(int, input().split())) for i in range(M)]
newest_destroyed = -1
conflict.sort(key=lambda x: x[1])
res = 0
for l, r in conflict:
if not (l <= newest_destroyed < ... | p03295 |
N,M = list(map(int,input().split()))
Map = [[] for i in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
Map[a-1].append(b-1)
b_list = []
count=0
for i in range(N):
if i in b_list:
b_list=[]
count+=1
b_list=b_list+Map[i]
print(count) |
N,M = list(map(int,input().split()))
Map = [[] for i in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
Map[a-1].append(b-1)
b_list = [0 for i in range(N)]
count=0
for i in range(N):
if b_list[i]==1:
b_list=[0 for i in range(N)]
count+=1
for j in Map[i]:... | p03295 |
import heapq
N, M = list(map(int, input().split()))
data = []
for i in range(M):
a, b = list(map(int, input().split()))
heapq.heappush(data, (b, a))
bridge = [1] * N
for i in range(M):
b, a = heapq.heappop(data)
if sum(bridge[a:b]) == b - a:
bridge[b-1] = 0
print((N-sum(bridge))) | import heapq
N, M = list(map(int, input().split()))
data = []
for i in range(M):
a, b = list(map(int, input().split()))
heapq.heappush(data, (b, a))
cut = 0
answer = 0
for i in range(M):
b, a = heapq.heappop(data)
if cut <= a:
answer += 1
cut = b
print(answer) | p03295 |
n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(m)]
ab = sorted(ab, key = lambda x : x[1])
ans = 0
end = 0
for i in range(m):
if ab[i][0] >= end:
end = ab[i][1]
ans += 1
print(ans) | n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(m)]
ab.sort(key=lambda x: x[1])
ans = m
for i in range(1, m):
if ab[i][0] < ab[i-1][1]:
ab[i][1] = ab[i-1][1]
ans -= 1
print(ans)
| p03295 |
N, M = list(map(int,input().split()))
m=[list(map(int, input().split())) for _ in range(M)]
m=sorted(m, key=lambda x: x[1])
p=0
for _ in range(M):
if m!=[]:
tmp=max(m)[0]
m=[l for l in m if l[1]<=tmp]
p+=1
else:
break
print(p) | N, M = list(map(int,input().split()))
m=[list(map(int, input().split()))[::-1] for _ in range(M)]
m.sort()
b=[]
for i in m:
if len([tmp for tmp in b if tmp>=i[1]])==0:
b.append(i[0]-1)
print((len(b))) | p03295 |
import copy
N,M=list(map(int,input().split()))
bridge=[0]*(N-1)
l=[]
for _ in range(M):
l.append(list(map(int,input().split())))
for sl in l:
for i in range(sl[0]-1,sl[1]-1):
bridge[i]+=1
ans=0
# bridge=[4,6,6,4]
while max(bridge)>=1:
m=bridge.index(max(bridge)) #m=1
l1=copy.deepcopy(l)
... | N,M = list(map(int,input().split()))
l = [list(map(int,input().split())) for _ in range(M)]
l.sort(key= lambda x: x[1])
removed = 0
ans = 0
for i in l:
s = i[1]
if removed<i[0]:
removed = s-1
ans+=1
print(ans) | p03295 |
n,m = list(map(int,input().split()))
data = []
for i in range(m):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
data.append((b,a))
data.sort()
cnt = 0
dis = -1
for i in range(m):
b,a = data[i]
if(dis < a):
cnt += 1
dis = b - 1
print(cnt) | n,m = list(map(int,input().split()))
data = []
for i in range(m):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
data.append((a,b))
data = sorted(data,key=lambda x:x[1])
cnt = 0
dis = -1
for i in range(m):
a,b = data[i]
if(dis < a):
cnt += 1
dis = b - 1
print(c... | p03295 |
n,m=list(map(int,input().split()))
ass=[tuple(map(int,input().split())) for i in range(m)]
ass.sort(key=lambda x:x[1])
acum = []
for ab in ass:
if [x for x in acum if ab[0]<x <=ab[1]] == []:
acum =acum + [ab[1]]
print((len(acum)))
| n,m=list(map(int,input().split()))
ass=[tuple(map(int,input().split())) for i in range(m)]
ass.sort(key=lambda x:x[1])
acum = []
def ifsatisfied(ab):
for x in acum:
if ab[0]<x <=ab[1]:
return(True)
return(False)
for ab in ass:
if not ifsatisfied(ab):
acum.append(... | p03295 |
n,m=list(map(int,input().split()))
ass=[tuple(map(int,input().split())) for i in range(m)]
ass.sort(key=lambda x:x[1])
acum = []
def ifsatisfied(ab):
for x in acum:
if ab[0]<x <=ab[1]:
return(True)
return(False)
for ab in ass:
if (acum == [] or ab[0]>=acum[-1]):
... | n,m=list(map(int,input().split()))
ass=[tuple(map(int,input().split())) for i in range(m)]
ass.sort(key=lambda x:x[1])
reg = 0
counter = 0
for ab in ass:
if ab[0]>=reg:
counter = counter+1
reg=ab[1]
print(counter)
| p03295 |
n , m = list(map(int, input().split()))
l = [list(map(int,input().split())) for _ in range(m)]
l.sort()
cut = [l[0]]
for i in range(1,m):
for j in range(len(cut)):
key = 0
if cut[j][0] <= l[i][0] and l[i][0] < cut[j][1] :
cut[j][0] = l[i][0]
key +=1
if cu... | n , m = list(map(int, input().split()))
l = [list(map(int,input().split())) for _ in range(m)]
l.sort()
l = l[::-1]
cnt = 1
key = l[0][0]
for i in range(1,m):
if key >= l[i][1]:
cnt += 1
key = l[i][0]
print(cnt)
| p03295 |
# coding: utf-8
def sIsland(slist):
b1, b0 = slist[0][1], slist[0][1]-1
slist = slist[1:]
rest = []
for i in range(len(slist)):
if not(slist[i][0] <= b0 and b1 <= slist[i][1]):
rest.append(slist[i])
return rest
def solve(matrix):
n_call = 1
deleted = ... | # coding: utf-8
def getG(N, M):
G=[list() for i in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
a-=1
b-=1
G[a].append(b)
G[b].append(a)
return G
def solve(G, N):
ans = 0
index = -1
for i in range(1, N):
for ... | p03295 |
N, M = list(map(int, input().split()))
demand_list = []
for _ in range(M):
ai, bi = list(map(int, input().split()))
demand_list.append([ai, bi])
# ソート
demands = sorted(demand_list, key=lambda d: d[1])
# 分断開始 切断されている橋は1で表現される
cut_bilagge_list = [0 for _ in range(N)]
for demand in demands:
# す... | # https://atcoder.jp/contests/abc103/tasks/abc103_d
# ToDo not yet
# biについて昇順にソートする
# それぞれのbiについて、
# 1: すでに分断されているなら何もしない
# 2: 分断されていないならbi - 1番目の橋を切断する
N, M = list(map(int, input().split()))
demand_list = []
for _ in range(M):
ai, bi = list(map(int, input().split()))
demand_list.append([ai, bi]... | p03295 |
import sys
import math
import collections
import bisect
import copy
# import numpy as np
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline())
ns = lambda: list(map(int, sys.stdin.readline().split()))
na = lambda: list(map(int, sys.std... | import sys
import math
import collections
import bisect
import copy
# import numpy as np
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline())
ns = lambda: list(map(int, sys.stdin.readline().split()))
na = lambda: list(map(int, sys.std... | p03295 |
import heapq
n, m = list(map(int, input().split()))
ls = [list(map(int, input().split())) for _ in range(m)]
heapq.heapify(ls)
res = 0
r = min([r for _, r in ls])
while True:
res += 1
while ls:
ll, rr = heapq.heappop(ls)
if ll >= r:
heapq.heappush(ls, [ll, rr])
... | n, m = list(map(int, input().split()))
ls = [list(map(int, input().split())) for _ in range(m)]
ls.sort()
res = 1
rmin = float('inf')
for l, r in ls:
if l >= rmin:
res += 1
rmin = r
else:
rmin = min(rmin, r)
print(res) | p03295 |
n,m=list(map(int, input().split(" ")))
#min=0
#max=1000000000
arr=[[0,100000000]]
for i in range(m):
flag=1
a,b=list(map(int, input().split(" ")))
for n,j in enumerate(arr):
flag=1
if j[0]<=a and j[1]>=b:
del arr[n]
#arr.remove(j)
elif j[0]>=a an... | n,m=list(map(int, input().split(" ")))
arr=[]
for i in range(m):
a,b=list(map(int, input().split(" ")))
arr.append([a,b])
#arr.sort(key=lambda x:x[0])
arr.sort(key=lambda x:(x[0],x[1]))
left=0
num=0
count=0
for i in range(len(arr)):
if arr[i][0]==left:
pass
if arr[i][1]<=num:
... | p03295 |
from bisect import bisect_left
N, M = list(map(int, input().split()))
ab = [0]*M
for i in range(M):
ab[i] = tuple(map(int, input().split()))
ab.sort()
used = [False]*M
count = 0
for i in range(M):
if used[i]:
continue
head, tail = ab[i]
used[i] = True
j = i+1
while j ... | from bisect import bisect_left
N, M = list(map(int, input().split()))
ab = [0]*M
for i in range(M):
ab[i] = tuple(map(int, input().split()))
ab.sort(key=lambda x: x[1])
cutted = [-1]
for i in range(M):
a, b = ab[i]
if a <= cutted[-1]:
continue
cutted.append(b-1)
print((len(cutted... | p03295 |
N, M = list(map(int, input().split()))
Query = []
for _ in range(M):
Query.append(list(map(int, input().split())))
Query.sort(key = lambda x : x[1])
count = 0
while len(Query) > 0:
Query = list([x for x in Query if x[0] >= Query[0][1]])
count += 1
print(count)
| N, M = list(map(int, input().split()))
Query = []
for _ in range(M):
Query.append(list(map(int, input().split())))
Query.sort(key = lambda x : x[1])
count = 1
last = Query[0][1]
for i in range(1, M):
if Query[i][0] >= last:
count += 1
last = Query[i][1]
print(count)
| p03295 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, M, *AB = list(map(int, read().split()))
Q = [[] for _ in range(N - 1)]
for i, (a, b) in enumerate(zip(*[iter(AB)] * 2)... | import sys
read = sys.stdin.buffer.read
INF = 1 << 60
def main():
N, M, *AB = list(map(int, read().split()))
Q = [[] for _ in range(N - 1)]
for a, b in zip(*[iter(AB)] * 2):
Q[a - 1].append(b - 2)
min_y = INF
ans = 0
for i, ys in enumerate(Q):
if ys:
... | p03295 |
import sys
from operator import itemgetter
read = sys.stdin.buffer.read
INF = 1 << 60
def main():
N, M, *AB = list(map(int, read().split()))
Q = [0] * M
for i, (a, b) in enumerate(zip(*[iter(AB)] * 2)):
Q[i] = (a - 1, b - 1)
Q.sort(key=itemgetter(1))
ans = 0
last =... | import sys
from operator import itemgetter
read = sys.stdin.buffer.read
INF = 1 << 60
def main():
N, M, *AB = list(map(int, read().split()))
Q = list(zip(*[iter(AB)] * 2))
Q.sort(key=itemgetter(1))
ans = 0
last = 0
for a, b in Q:
if last < a:
last = b - ... | p03295 |
import itertools
import collections
N,M=list(map(int,input().split()))
L=list()
for i in range(M):
a,b=list(map(int,input().split()))
A=list(range(a,b))
L.append(A)
R=tuple(itertools.chain.from_iterable(L))
i=0
while True:
L=[i for i in L if collections.Counter(R).most_common()[0][0] not in i]
R... | N,M=list(map(int,input().split()))
L=list()
for i in range(M):
a,b=list(map(int,input().split()))
A=list([b,a])
L.append(A)
L=sorted(L)
R=[L[0][0]-1]
for j in range(M):
if R[-1] not in list(range(L[j][1],L[j][0])):
R.append(L[j][0]-1)
print((len(R))) | p03295 |
n,m = list(map(int,input().split()))
d = [0]*m
ma = 0
mi = 0
for i in range(m):
a,b = list(map(int,input().split()))
d[i] = ((1<<a)-1) ^ ((1<<b)-1)
ma = max(ma,a,b)
mi = min(mi,a,b)
s = ((1<<ma)-1) | ((1<<mi)-1)
for bit in range(1<<n):
if bit & s:
spr = [True]*m
for k in ... |
n,m = list(map(int,input().split()))
d = [0]*m
spr = [True]*m
ma = 0
mi = 0
for i in range(m):
a,b = list(map(int,input().split()))
d[i] = [a,b]
d = sorted(d)
pre = d[0][1]
ans = 1
for i,(a,b) in enumerate(d):
if a < pre:
if b < pre:
pre = b
else:
ans += 1
pre = b
p... | p03295 |
n, m = list(map(int, input().split()))
A = [[int(i) for i in input().split()] for i in range(m)]
A.sort(key=lambda x: x[1])
posi = 0
count = 0
for i in range(m):
if A[i][0] >= posi:
count += 1
posi = A[i][1]
print(count) | n, m = list(map(int, input().split()))
A = [[int(i) for i in input().split()] for i in range(m)]
A.sort(key=lambda x: x[1])
posi = A[0][1]
count = 1
for i in range(m):
if posi <= A[i][0]:
count += 1
posi = A[i][1]
print(count) | p03295 |
n, m = list(map(int, input().split()))
SG = sorted([[int(i) for i in input().split()] for i in range(m)], key = lambda x: x[1])
cnt = 1
b = SG[0][1]
for s, g in SG:
if s >= b:
b = g
cnt += 1
print(cnt) | n, m = list(map(int, input().split()))
A = sorted([[int(i) for i in input().split()] for i in range(m)], key = lambda x: x[1])
cnt = 0
posi = 0
for s, g in A:
if s >= posi:
posi = g
cnt += 1
print(cnt) | p03295 |
n, m = list(map(int, input().split()))
A = sorted([[int(i) for i in input().split()] for i in range(m)], key = lambda x: x[1])
cnt = 0
posi = 0
for s, g in A:
if s >= posi:
posi = g
cnt += 1
print(cnt) | N, M = list(map(int, input().split()))
AB = sorted([[int(i) for i in input().split()] for i in range(M)], key = lambda x: x[1])
cnt = 1
posi = AB[0][1]
for i in range(1, M):
if AB[i][0] >= posi:
cnt += 1
posi = AB[i][1]
print(cnt) | p03295 |
N,M=list(map(int,input().split()))
ab=[]
for m in range(M):
[a,b]=[int(i) for i in input().split()]
ab.append([a,b])
ab.sort(key=lambda x:x[1])
count=[]
count.append(ab[0][1]-1)
for i in range(1,M):
if ab[i][0]<=count[-1]<ab[i][1]:
pass
elif ab[i][0]<=count[-1] and ab[i][1]-1==count[-1]:
cou... | n,m=list(map(int,input().split()))
B=[]
for _ in range(m):
a,b=list(map(int,input().split()))
B.append([a-1,b-1])
B=sorted(B,key=lambda x:x[1])
ans=m
for i in range(1,m):
if B[i][0]<B[i-1][1]:
ans-=1
B[i][1]=B[i-1][1]
print(ans) | p03295 |
# ABC103D_IslandsWar.py
import operator
"""
区画スケジューリング
まず、(ai, bi) の組を bi について昇順にソートします。ソートした順に、以下を行う。
• 既にその要望を満たしている場合、何もしない。
• 要望を満たしていない場合、bi − 1 番目の島と bi 番目の島を接続する橋を取り除く。
TLE に注意
"""
n, m = list(map(int, input().split()))
bridges = set()
ms2 = sorted((tuple(map(int, input().split())) for i in rang... | # ABC103D_IslandsWar.py
import operator
"""
区画スケジューリング
まず、(ai, bi) の組を bi について昇順にソートします。ソートした順に、以下を行う。
• 既にその要望を満たしている場合、何もしない。
• 要望を満たしていない場合、bi − 1 番目の島と bi 番目の島を接続する橋を取り除く。
TLE に注意
"""
n, m = list(map(int, input().split()))
bridges = [0]
ms = sorted((tuple(map(int, input().split())) for i in range(m... | p03295 |
n, m = list(map(int, input().split()))
v = [[] for i in range(n+1)]
path = [0 for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
v[b].append(a)
for i in range(n+1):
if v[i] == []:
continue
m = max(v[i])
found = 0
for e in path[m:i]:
if e == 1... | n, m = list(map(int, input().split()))
v = [0 for i in range(n+1)]
path = [0 for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
if v[b] < a:
v[b] = a
last = 0
for i in range(n+1):
if v[i] == 0:
continue
m = v[i]
if last < m:
path[i... | p03295 |
def s(a,i,b,c):
return b==sorted(b) and c==sorted(c) if i==10 else s(a,i+1,b+[a[i]],c) or s(a,i+1,b,c+[a[i]])
for roop in range(int(input())):
print("YES" if s(list(map(int,input().split())),0,[],[]) else "NO") | def s(a):
b = c = 0
for i in a:
if i > b:
b = i
elif i > c:
c = i
else:
return False
return True
for n in range(int(input())):
print("YES" if s(list(map(int,input().split()))) else "NO") | p00033 |
N = int(eval(input()))
for testCase in range(N):
A = list(map(int, input().split()))
ok = False
for i in range(2 ** 10):
x = []
y = []
for j in range(10):
if i & (1 << j):
x.append(A[j])
else:
y.append(A[j])
... | def dfs(i, b, c):
if i == 11:
return (b == sorted(b) and c == sorted(c))
if dfs(i + 1, b + [balls[i - 1]], c):
return True
if dfs(i + 1, b, c + [balls[i - 1]]):
return True
return False
if __name__ == '__main__':
N = int(eval(input()))
for i in range(N... | p00033 |
import sys
from itertools import compress
def is_right_order(B, C):
max_val = 0
for b in B:
if b < max_val:
return False
max_val = b
max_val = 0
for c in C:
if c < max_val:
return False
max_val = c
return True
def solve_... | # import sys
from itertools import compress
# from random import shuffle, seed, random
from time import perf_counter
def is_right_order(B, C):
""" B, C????????§??????????????????????????????(??????)????????§???????????? """
max_val = 0
for b in B:
if b < max_val:
return Fals... | p00033 |
import sys
input = sys.stdin.readline
import copy
S = [ord(s) - ord('a') for s in input().rstrip()]
INF = 10 ** 9
N = len(S)
dp = [None] * (N+1)
# そこから始めたとき、次にxが現れる位置、および、次にxをとった場合に長さLのものが全て作れる
dp[N] = [[INF] * 26, [0] * 26, 0]
for n in range(N-1,-1,-1):
prev = dp[n+1]
cur = copy.deepcopy(prev)... | import sys
input = sys.stdin.readline
S = [ord(s) - ord('a') for s in input().rstrip()]
INF = 10 ** 9
N = len(S)
dp = [None] * (N+1)
# そこから始めたとき、次にxが現れる位置、および、次にxをとった場合に長さLのものが全て作れる
dp[N] = [[INF] * 26, [0] * 26, 0]
for n in range(N-1,-1,-1):
prev = dp[n+1]
cur = [prev[0].copy(), prev[1].copy(),... | p03629 |
from collections import defaultdict
inf = 10**10
A = input()
N = len(A)
abc = 'abcdefghijklmbopqrstuvwxyz'
s_to_i = [defaultdict(lambda:N) for _ in range(N+1)]
for x in abc:
s_to_i[-1][x] = N
for i in range(N)[::-1]:
for x in abc:
s_to_i[i][x] = s_to_i[i+1][x]
s_to_i[i][A[i]] = i
def ... | from collections import defaultdict
inf = 10**10
A = list(map(lambda x:ord(x)-ord('a'), list(input())))
N = len(A)
abc = 'abcdefghijklmbopqrstuvwxyz'
s_to_i = [[N]*26 for _ in range(N+1)]
for i in range(N)[::-1]:
for x in range(26):
s_to_i[i][x] = s_to_i[i+1][x]
s_to_i[i][A[i]] = i
dp = [0]*(N... | p03629 |
# AGC014B - Unplanned Queries
from collections import Counter
def main():
*A, = list(map(int, open(0).read().split()))
T = list(Counter(A[2:]).values())
flg = all(i % 2 == 0 for i in T)
print(("YES" if flg else "NO"))
if __name__ == "__main__":
main() | # AGC014B - Unplanned Queries
from collections import Counter
def main():
# all vertices need to appear even times in A
*A, = list(map(int, open(0).read().split()))
T = list(Counter(A[2:]).values())
flg = any(i % 2 for i in T)
print(("NO" if flg else "YES"))
if __name__ == "__main__"... | p03724 |
# -*- coding: utf-8 -*-
def main():
n, m = list(map(int, input().split()))
a = [0 for _ in range(n)]
b = [0 for _ in range(n)]
# スターグラフを作ってみる
for i in range(m):
ai, bi = list(map(int, input().split()))
# 0-index
ai -= 1
bi -= 1
if ai == 0:
... | # -*- coding: utf-8 -*-
def main():
n, m = list(map(int, input().split()))
c = [0 for _ in range(n)]
# KeyInsight
# https://www.youtube.com/watch?v=UHfTqvaD0pk：
# とっかかりとして，根付き木を考える（最終的には，木の形状は関係ない）
# 始点x，終点yとして，根をrとする．
# x -> yを x -> r, y -> rの形に分解
# 関心があるのは偶奇のみ，同じ操作が偶数回ある... | p03724 |
n,m=list(map(int,input().split()))
x=[0]*n
for i in range(m):
a,b=list(map(int,input().split()))
x[a-1]+=1
x[b-1]+=1
ans="YES"
for i in range(n):
if x[i]%2:ans="NO"
print(ans) | n,m=list(map(int,input().split()))
ans=[0]*n
for i in range(m):
a,b=list(map(int,input().split()))
ans[a-1]^=1
ans[b-1]^=1
if 1 not in ans:print('YES')
else:print('NO') | p03724 |
N, M = list(map(int, input().split()))
lst = [0] * (N + 1)
for _ in range(M):
a, b = list(map(int, input().split()))
lst[a] += 1
lst[b] += 1
for i in lst:
if i % 2 == 1:
print ('NO')
exit()
print ('YES') | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
lst = [0] * (N + 1)
for _ in range(M):
a, b = list(map(int, input().split()))
lst[a] += 1
lst[b] += 1
for i in lst:
if i % 2 == 1:
print ('NO')
exit()
print ('YES') | p03724 |
def main():
import sys
input = sys.stdin.buffer.readline
N, M = (int(i) for i in input().split())
G = [[] for i in range(N)]
for i in range(M):
x, y = (int(i)-1 for i in input().split())
G[x].append(y)
G[y].append(x)
for i in range(N):
if len(G[i]) % 2... | def main():
import sys
input = sys.stdin.buffer.readline
N, M = (int(i) for i in input().split())
cnt = [0]*N
AB = [[int(i)-1 for i in input().split()] for j in range(M)]
for a, b in AB:
cnt[a] += 1
cnt[b] += 1
if all(c % 2 == 0 for c in cnt):
print("YES")
... | p03724 |
from collections import Counter
N, M = list(map(int, input().split()))
print(("YES" if all(x % 2 == 0 for x in list(Counter(sum([list(map(int, input().split())) for _ in range(M)], [])).values())) else "NO"))
| from collections import Counter
N, M = list(map(int, input().split()))
cnt = Counter()
for _ in range(M):
a, b = list(map(int, input().split()))
cnt[a] += 1
cnt[b] += 1
print(("YES" if all(x % 2 == 0 for x in list(cnt.values())) else "NO"))
| p03724 |
import sys
def solve():
N, M = list(map(int, input().split()))
ncnt = [0]*N
for i in range(M):
a, b = list(map(int, sys.stdin.readline().split()))
a -= 1
b -= 1
ncnt[a] += 1
ncnt[b] += 1
if all(ni & 1 == 0 for ni in ncnt):
print('YES')... | import sys
def solve():
N, M = list(map(int, input().split()))
ncnt = [0]*N
for i in range(M):
a, b = list(map(int, sys.stdin.readline().split()))
a, b = a-1, b-1
ncnt[a] ^= 1
ncnt[b] ^= 1
print(('NO' if any(ni for ni in ncnt) else 'YES'))
if __name_... | p03724 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p03724 |
from collections import Counter
N, M = list(map(int, input().split()))
counter = Counter()
for i in range(M):
a, b = list(map(int, input().split()))
counter[a] += 1
counter[b] += 1
if all(x % 2 == 0 for x in list(counter.values())):
print("YES")
else:
print("NO")
| n,m,*p=list(map(int,open(0).read().split()));c=[0]*n
for x in p:c[x-1]+=1
print(("YNEOS"[any(x%2for x in c)::2])) | p03724 |
#AGC014-B Unplanned Queries
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n,m = list(map(int,readline().split()))
dic1 = defaultdict(int)
for i in range(m):
a,b = list(map(int,readline().split()))
dic1[a] += 1
dic1[b] += ... | #AGC014-B Unplanned Queries
"""
今回は各辺の偶奇のみを考えるので、
根付き木を考えた時に、頂点a,bから親側に全部流した時に、
LCAより先は勝手に偶数になるので無視できる。
とした場合に、根をrootとして、各クエリに対して
a-root,b-rootへのパスに1を足すことと考えると、
結局各辺の偶奇はaとbの出現回数の偶奇によると考える事ができる。
よって、クエリに与えられる辺の回数をdictで保持し、
最終的に一つでも奇数回出現する頂点があるならばFalse
そうでないならTrueとなる
"""
import sys
from collections import ... | p03724 |
N, M = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(M)]
count = [0 for i in range(N)]
for aibi in ab:
ai = aibi[0]
bi = aibi[1]
if bi < ai:
tmp = ai
ai = bi
bi = tmp
for j in range(ai - 1, bi - 1):
count[j] += 1
... | N, M = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(M)]
count = [0 for i in range(N)]
# for aibi in ab:
# ai = aibi[0]
# bi = aibi[1]
#
# if bi < ai:
# tmp = ai
# ai = bi
# bi = tmp
#
# for j in range(ai - 1, bi - 1):
# ... | p03724 |
n,m=list(map(int,input().split()))
a=[0]*n
for i in range(m):
u,v=list(map(int,input().split()))
a[u-1]^=1
a[v-1]^=1
if sum(a):
print("NO")
else:
print("YES") | n,m=list(map(int,input().split()))
t=0
for i in range(m):
u,v=list(map(int,input().split()))
t^=u^v
print(("NO" if t else "YES")) | p03724 |
n,m = list(map(int,input().split()))
edge = [0] * (n-1)
for i in range(m):
a,b = list(map(int,input().split()))
if a > b:
a,b = b,a
for j in range(a,b):
edge[j-1] += 1
for i in range(len(edge)):
if edge[i] % 2 == 1:
print("NO")
exit()
print("YES")
| n,m = list(map(int,input().split()))
point = [0] * n
cnt = 0
for i in range(m):
a,b = list(map(int,input().split()))
point[a-1] += 1
point[b-1] += 1
# if a > b:
# a,b = b,a
# for j in range(a,b):
# edge[j-1] += 1
for i in range(len(point)):
if point[i] % 2 == 1:
... | p03724 |
from collections import Counter
N, M, *AB = list(map(int, open(0).read().split()))
C = Counter(AB)
if all(c % 2 == 0 for c in list(C.values())):
print("YES")
else:
print("NO")
| from collections import Counter
N, M, *AB = list(map(int, open(0).read().split()))
C = Counter(AB)
if any(c % 2 == 1 for c in list(C.values())):
print("NO")
else:
print("YES")
| p03724 |
N, M = list(map(int, input().split()))
Path = [0 for i in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
a, b = min(a, b), max(a, b)
Path[b-1] += 1
if a > 1:
Path[a-1] += 1
for p in Path:
if p % 2 != 0:
print("NO")
break
else: print("YES") | import sys
def solve():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
count = [0] * N
for _ in range(M):
a, b = list(map(int, input().split()))
a, b = min(a, b), max(a, b)
if a > 1: count[a-1] += 1
count[b-1] += 1
for i, a in enumer... | p03724 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.rea... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.rea... | p03724 |
N,M = list(map(int,input().split()))
k = 0
while True:
if 2**k>=N:
break
k += 1
A = [0 for i in range(2**k+1)]
for _ in range(M):
a,b = list(map(int,input().split()))
if b<a:
a,b = b,a
A[a] += 1
A[b] -= 1
B = [0 for i in range(2**k+2)]
for i in range(2**k+1):
B... | N,M = list(map(int,input().split()))
C = {i:0 for i in range(1,N+1)}
for _ in range(M):
a,b = list(map(int,input().split()))
C[a] = (C[a]+1)%2
C[b] = (C[b]+1)%2
flag = 0
for i in range(1,N+1):
if C[i]==1:
flag = 1
break
if flag==0:
print("YES")
else:
print("NO") | p03724 |
import sys
# 整数の入力
N,M=list(map(int, input().split()))
p=[]
q=0
count=[]
for i in range(0,M):
p.append(list(map(int, input().split())))
count.append(0)
for i in range(0,M):
q+=p[i][0]-p[i][1]
if q%2==1:
print("NO")
else:
for j in range(0,M):
for i in range(0,M):
if p[i][0]==j or p[i]... | import sys
# 整数の入力
N,M=list(map(int, input().split()))
p=[]
for i in range(0,N):
p.append(0)
for i in range(0,M):
count=list(map(int, input().split()))
p[count[0]-1]+=1
p[count[1]-1]+=1
for i in range(0,M):
if p[i]%2==1:
print("NO")
sys.exit()
print("YES") | p03724 |
from collections import Counter
n,m=list(map(int,input().split()))
l=[]
for _ in range(m):
a,b=list(map(int,input().split()))
if a>b:a,b=b,a
l.extend([(i,i+1) for i in range(a,b)])
c=Counter(l)
*v,=[x for x in list(c.values()) if x%2]
if v:
print("NO")
else:
print("YES") | from itertools import accumulate as ac
n,m=list(map(int,input().split()))
l=[0]*(n+1)
for _ in range(m):
a,b=list(map(int,input().split()))
if a>b:a,b=b,a
l[a]+=1
l[b]-=1
*l,=ac(l)
*l,=[x for x in l if x%2]
if l:
print("NO")
else:
print("YES") | p03724 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.