input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#!/usr/bin/env python3
#ABC67 D
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from... | #!/usr/bin/env python3
#ABC67 D
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from... | p03660 |
import sys
sys.setrecursionlimit(10**7)
def tree(p):
for x in neighbor[p]:
if x==par[p]: continue
par[x]=p
descend[p]+=tree(x)
return descend[p]
n=int(eval(input()))
neighbor=[set() for _ in range(n+1)]
descend=[1]*(n+1)
par=[0]*(n+1)
for _ in range(n-1):
a,b=list... | import sys
sys.setrecursionlimit(10**7)
def tree(p):
for x in neighbor[p]:
if x==par[p]: continue
par[x]=p
descend[p]+=tree(x)
return descend[p]
n=int(eval(input()))
neighbor=[[] for _ in range(n+1)]
descend=[1]*(n+1)
par=[0]*(n+1)
for _ in range(n-1):
a,b=list(ma... | p03660 |
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from collections import deque
N=int(eval(input()))
graph=[[] for _ in range(N+1)]
for _ in range(N-1):
a,b=list(map(int,input().split()))
graph[a].append(b)
graph[b].append(a)
#print(graph)
def dfs_init(u,ls):
global path
visite... | import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from collections import deque
N=int(eval(input()))
graph=[[] for _ in range(N+1)]
for _ in range(N-1):
a,b=list(map(int,input().split()))
graph[a].append(b)
graph[b].append(a)
#print(graph)
dist_f=[-1]*(N+1)
d=0
queue=[1]
while que... | p03660 |
N = int(eval(input()))
G = [[] for _ in range(N)]
visited = [0]*N
visited[0],visited[N-1] = 1,1
visited_all = [1]*N
for i in range(N-1):
a,b = list(map(int,input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
nextA,nextB = G[0],G[N-1]
scoreA,scoreB = 1,1
while visited != visited_all:
l = ... | N = int(eval(input()))
A = [[] for _ in range(N)]
for i in range(N-1):
a,b = list(map(int,input().split()))
A[a-1].append(b-1)
A[b-1].append(a-1)
B = [False]*N
visited = [True]*N
Fp,Sp = 0,0
Fi,Si = [0],[N-1]
while B != visited:
# Fennec
nextXi = []
for i in Fi:
if no... | p03660 |
import sys
sys.setrecursionlimit(10**6)
def main():
N = int(eval(input()))
d = {}
for _ in range(N-1):
a, b = list(map(int, input().split()))
if a in d:
d[a].append(b)
else:
d[a] = [b]
if b in d:
d[b].append(a)
el... | import sys
sys.setrecursionlimit(10**6)
def main():
N = int(eval(input()))
d = {}
for _ in range(N-1):
a, b = list(map(int, input().split()))
if a in d:
d[a].append(b)
else:
d[a] = [b]
if b in d:
d[b].append(a)
el... | p03660 |
import sys
sys.setrecursionlimit(1000000)
N=int(eval(input()))
ab=[[] for _ in range(N)]
for _ in range(N-1):
a,b=list(map(int,input().split()))
ab[a-1].append(b)
ab[b-1].append(a)
def dfs(pre,p,pa):
global path
if p==N:
path=pa
else:
for i in ab[p-1]:
if i!=pre:
dfs... | import sys
sys.setrecursionlimit(1000000)
N=int(eval(input()))
ab=[[] for _ in range(N)]
for _ in range(N-1):
a,b=list(map(int,input().split()))
ab[a-1].append(b)
ab[b-1].append(a)
"""
N=10**5
ab=[[]]*N
ab[0]=[2]
ab[N-1]=[N-1]
for i in range(1,N-1):
ab[i]=[i,i+2]
"""
par=[0]*N
def dfs(pre,p... | p03660 |
#高速化heapqダイクストラ
from collections import *
from heapq import*
import sys
input=lambda:sys.stdin.readline()
def DIJKSTRA(point,d):
cost = [float("inf")]*(n+1)
Q = []
cost[point]=0
heappush(Q,(point,cost[point]))
while Q:
prefnd,tmpC=heappop(Q)
if cost[prefn... | #高速化heapqダイクストラ
from collections import *
from heapq import*
import sys
input=lambda:sys.stdin.readline()
def BFS(point,d):
cost=[1e7]*(n+1)
cost[point]=0
Q=[]
heappush(Q,(0,point))
while Q:
c,p=heappop(Q)
for np in d[p]:
if cost[np]==1e7:
... | p03660 |
#高速化heapqダイクストラ
from collections import *
from heapq import*
import sys
input=lambda:sys.stdin.readline()
def BFS(point,d):
cost=[1e7]*(n+1)
cost[point]=0
Q=[]
heappush(Q,(0,point))
while Q:
c,p=heappop(Q)
for np in d[p]:
if cost[np]==1e7:
... | #高速化heapqダイクストラ
from collections import *
from heapq import*
import sys
input=lambda:sys.stdin.readline()
def BFS(point,d):
cost=[1e7]*(n+1)
cost[point]=0
Q=[]
heappush(Q,(0,point))
while Q:
c,p=heappop(Q)
for np in d[p]:
if cost[np]==1e7:
... | p03660 |
#高速化heapqダイクストラ
from collections import *
from heapq import*
import sys
input=lambda:sys.stdin.readline()
def BFS(point,d):
cost=[1e7]*(n+1)
cost[point]=0
Q=[]
heappush(Q,(0,point))
while Q:
c,p=heappop(Q)
for np in d[p]:
if cost[np]==1e7:
... | from collections import *
from heapq import*
import sys
input=lambda:sys.stdin.readline()
def BFS(point,d):
cost=[1e7]*(n+1)
cost[point]=0
Q=[]
Q.append((0,point))
while Q:
c,p=Q.pop()
for np in d[p]:
if cost[np]==1e7:
cost[np]=c+1
... | p03660 |
from collections import *
from heapq import*
import sys
input=lambda:sys.stdin.readline()
def BFS(point,d):
cost=[1e7]*(n+1)
cost[point]=0
Q=[]
Q.append((0,point))
while Q:
c,p=Q.pop()
for np in d[p]:
if cost[np]==1e7:
cost[np]=c+1
... | from collections import *
from heapq import*
import sys
input=lambda:sys.stdin.readline()
def BFS(point,d):
cost=[1e7]*(n+1)
cost[point]=0
Q=deque()
Q.appendleft((0,point))
while Q:
c,p=Q.pop()
for np in d[p]:
if cost[np]==1e7:
cost[... | p03660 |
from collections import deque
N = int(eval(input()))
edges = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
edges[a].append(b)
edges[b].append(a)
que = deque([])
que.append((0, 0))
minDist = [float('inf') for _ in range(N)]
wh... | N = int(eval(input()))
edges = [[] for _ in range(N)]
for _ in range(N - 1):
fr, to = list(map(int, input().split()))
fr -= 1
to -= 1
edges[fr].append(to)
edges[to].append(fr)
def calc(s):
st = [s]
minDist = [10**18] * N
minDist[s] = 0
while st:
now = st.pop(... | p03660 |
N = int(eval(input()))
T = [[] for i in range(N)]
for i in range(N - 1):
a, b = list(map(int, input().split()))
T[a - 1].append(b - 1)
T[b - 1].append(a - 1)
def dijkstra(N, s0):
D = [N] * N
Q = [s0]
D[s0] = 0
while Q:
s = Q[0]
Q = Q[1:]
for adj in T[s]:
if D[s] + 1 < D[adj... | N = int(eval(input()))
T = [[] for i in range(N)]
for i in range(N - 1):
a, b = list(map(int, input().split()))
T[a - 1].append(b - 1)
T[b - 1].append(a - 1)
def dijkstra(N, s0):
D = [N] * N
D[s0] = 0
Q = [N] * N
Q[0] = s0
tail = 1
for i in range(N):
s = Q[i]
for adj in T[s]:
... | p03660 |
N = int(eval(input()))
inf = float('inf')
import heapq
def dijkstra(adj, n, st=1):
dj = [inf] * (n + 1)
paths = dict((x, [x]) for x in range(n + 1))
dj[st] = 0
q = []
heapq.heappush(q, (0, st))
while q:
fc, fn = heapq.heappop(q)
if dj[fn] < fc: continue
fo... | N = int(eval(input()))
inf = float('inf')
import heapq
def dijkstra(adj, n, st=1):
dj = [inf] * (n + 1)
dj[st] = 0
q = []
heapq.heappush(q, (0, st))
while q:
fc, fn = heapq.heappop(q)
if dj[fn] < fc: continue
for tn, lc in adj[fn]:
if dj[fn] + lc <... | p03660 |
from collections import deque
def bfs(s, dist):
visited = [False] * (N+1)
q = [(s, 1)]
visited[s] = True
while q:
u, c = q.pop()
for v in graph[u]:
if not visited[v]:
visited[v] = True
dist[v] = c
q.append((v, c... |
from collections import deque
# BFSで、B/Wそれぞれのスタート地点から拡張点への距離を取得
def bfs(s, distance):
visited = [False] * (N+1)
q = [(s, 1)]
visited[s] = True
while q:
u, dist = q.pop()
for v in graph[u]:
if not visited[v]:
visited[v] = True
d... | p03660 |
from collections import defaultdict
from heapq import heappop, heappush
N = int(eval(input()))
class Graph(object):
def __init__(self):
self.graph = defaultdict(list)
def __len__(self):
return len(self.graph)
def add_edge(self, src, dst, weight=1):
self.graph[src].... | import sys
from collections import defaultdict
from heapq import heappop, heappush
input = sys.stdin.readline
N = int(eval(input()))
class Graph(object):
def __init__(self):
self.graph = defaultdict(list)
def __len__(self):
return len(self.graph)
def add_edge(self, src,... | p03660 |
# [数学、特にグラフ理論の分野における木（き、）とは、連結で閉路を持たないグラフである。]
# なので1->Nは1通り。つまり1->Nの最短経路上にあるマスをつぶすのが先
# で、残ったのを探索できるが、こういう二段構えで実装するのが面倒。
# もうちょっと考えると、1->i とi->Nの距離をみたとき、前者が小さければ先に到達できるので黒で埋められることが分かる
# （進めなくなったら負け、がめんどくさいが、すすめなくなったらパス、とすると、勝敗は変わらないことになる）
# 1とNからスタートして2回BFSすりゃいいか
import sys
from collections import deque
sy... | from collections import deque
import sys
sys.setrecursionlimit(10**8)
n = int(eval(input()))
graph = [[] for _ in range(n)]
for _ in range(n - 1):
a, b = [int(x) - 1 for x in input().split()]
graph[a].append(b)
graph[b].append(a)
fennec = [10**5 + 10] * n
fennec[0] = 0
snuke = [10**5 + 10] * n
s... | p03660 |
from collections import defaultdict
N = int(eval(input()))
dic = defaultdict(list)
for i in range(N-1):
a, b = list(map(int, input().split()))
dic[a-1] += [b-1]
dic[b-1] += [a-1]
dist1 = [float('inf')]*N
dist2 = [float('inf')]*N
q1 = [0]
q2 = [N-1]
dist1[0] = 0
dist2[N-1] = 0
while q1:
... | from collections import deque
N, *L = list(map(int, open(0).read().split()))
dic = [[] for i in range(N+1)]
for a,b in zip(*[iter(L)]*2):
dic[a] += [b]
dic[b] += [a]
fdist = [-1]*(N+1)
sdist = [-1]*(N+1)
fdist[1] = 0
sdist[N] = 0
q = deque([1])
while q:
v = q.popleft()
for u in dic[v]:
if fdis... | p03660 |
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | p03660 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
### 木の読み込み tree
# サイズが大きいとdefaultdictが早い(for文を書かなくて済む)
from collections import defaultdict
n = int(eval(input()))
ns = defaultdict(set)
for _ in range(n-1):
u,... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
### 木の読み込み tree
# サイズが大きいとdefaultdictが早い(for文を書かなくて済む)
from collections import defaultdict
n = int(eval(input()))
ns = [[] for _ in range(n)]
for _ in range(n-1):
... | p03660 |
#!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
import queue
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return l... | #!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
import queue
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return l... | p03660 |
from collections import deque
N, *AB = list(map(int, open(0).read().split()))
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
E[a].append(b)
E[b].append(a)
def get_dist(src):
Q = deque([(src, 0)])
dist = [-1] * (N + 1)
while Q:
v, d = Q.popleft()
... | from collections import deque
N, *AB = list(map(int, open(0).read().split()))
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
E[a].append(b)
E[b].append(a)
def get_dist(src):
Q = deque([src])
dist = [0] * (N + 1)
while Q:
v = Q.popleft()
for u in ... | p03660 |
import sys
input = sys.stdin.readline
#O(ElogV)
import heapq
def dijkstra_heap(s):
#始点sから各頂点への最短距離
d = [float("inf")] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for e in edge[s]:
heapq.heappush(edgelist,e)
while len(edgelist):
m... | import sys
input = sys.stdin.readline
import heapq
def dijkstra(s):
# 始点sから各頂点への最短距離
d = [float('inf')]*n
d[s] = 0
# 各頂点が訪問済みかどうか
used = [False]*n
used[s] = True
# 仮の距離を記録するヒープ
que = []
for e in edge[s]:
heapq.heappush(que, e)
while que:
minedge =... | p03660 |
# -*- coding: utf-8 -*-
#Python
import sys
N=eval(input())
a=[[] for i in range(N+1)]
for i in range(N-1):
u,v=list(map(int,input().split()))
a[u].append(v)
a[v].append(u)
#print a
#初期化
kyori=(N+1)*[0]
sys.setrecursionlimit(1000000)
#深さ優先探索
def dfs(Graph, Start, Visited=None):
if (... | # -*- coding: utf-8 -*-
#Python
import sys
N=eval(input())
adj=[[] for i in range(N+1)]
#隣接リスト
for i in range(N-1):
x,y=list(map(int,input().split()))
adj[x].append(y)
adj[y].append(x)
#print adj
#訪問判別フラグ
F=(N+1)*[0]
#Stack
S=[]
#距離
dist=(N+1)*[0]
#先頭から深さ優先探索
S.append(1)
w... | p03660 |
from collections import deque
N = int(eval(input()))
G = {}
for i in range(N-1):
a,b = list(map(int,input().split()))
if a not in G:
G[a] = []
G[a].append(b)
if b not in G:
G[b] = []
G[b].append(a)
hist = [-1 for _ in range(N+1)]
heapF = deque([(1,0)])
hist[1] = 0
heapS... | from collections import deque
N = int(eval(input()))
G = {i:[] for i in range(1,N+1)}
for _ in range(N-1):
a,b = list(map(int,input().split()))
G[a].append(b)
G[b].append(a)
dist = [0 for _ in range(N+1)]
que = deque([(1,0)])
hist = [0 for _ in range(N+1)]
hist[1] = 1
while que:
x,d = que.po... | p03660 |
import sys
sys.setrecursionlimit(2000000)
def input():
return sys.stdin.readline()[:-1]
n=int(eval(input()))
ab=[list(map(int,input().split())) for i in range(n-1)]
ki=[[] for i in range(n+1)]
for i in range(n-1):
ki[ab[i][0]].append(ab[i][1])
ki[ab[i][1]].append(ab[i][0])
# print(ki)
kyori=[[0,0... | import sys
sys.setrecursionlimit(2000000)
def input():
return sys.stdin.readline()[:-1]
n=int(eval(input()))
ab=[list(map(int,input().split())) for i in range(n-1)]
ki=[[] for i in range(n+1)]
for i in range(n-1):
ki[ab[i][0]].append(ab[i][1])
ki[ab[i][1]].append(ab[i][0])
# print(ki)
kyori=[[flo... | p03660 |
import queue
inf = float('inf')
N = int(eval(input()))
paths = [{} for i in range(N+1)]
for i in range(N-1):
s,t = list(map(int, input().split()))
paths[s][t] = 1
paths[t][s] = 1
def dijkstra(start, nodes, N):
fixed = {}
cost = [inf] * (N + 1)
cost[start] = 0
q = queue.Priority... | #import queue
import heapq
inf = float('inf')
N = int(eval(input()))
paths = [{} for i in range(N+1)]
for i in range(N-1):
s,t = list(map(int, input().split()))
paths[s][t] = 1
paths[t][s] = 1
def dijkstra(start, nodes, N):
cost = [inf] * (N + 1)
cost[start] = 0
q = []
heapq.h... | p03660 |
from collections import*
n,*L=list(map(int,open(0).read().split()))
G=[[]for _ in range(n)]
for a,b in zip(*[iter(L)]*2):
G[a-1]+=[b-1]
G[b-1]+=[a-1]
def F(m):
q=deque([m])
d=[-1]*n
while q:
cur=q.popleft()
for nxt in G[cur]:
if d[nxt]<0:
q.append(nxt)
d[nxt]=d[cur]+1
return d
print... | from collections import deque
def F(m):
q=deque([m])
d=[-1]*n
while q:
cur=q.popleft()
for nxt in G[cur]:
if d[nxt]<0:
q.append(nxt)
d[nxt]=d[cur]+1
return d
def solve():
global n,G
n,*L=list(map(int,open(0).read().split()))
G=[[]for _ in range(n)]
for a,b in zip(*[iter(L)]*2):
... | p03660 |
import sys
sys.setrecursionlimit(1000000000)
n = int(eval(input()))
G = [[] for _ in range(n)]
for _ in range(n-1):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
dist = [(0,-1) for _ in range(n)]
def dfs(now,prev=-1):
for nxt in G[now]:
... | import sys
sys.setrecursionlimit(1000000000)
n = int(eval(input()))
G = [[] for _ in range(n)]
for _ in range(n-1):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
dist1 = [-1]*n
dist1[0] = 0
dist2 = [-1]*n
dist2[n-1] = 0
def dfs(now,dist):
for... | p03660 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
def main():
n = int(eval(input()))
F = [[] for _ in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
F[a].append(b)
F[b].append(a)
seenB = [False]*n
seenW = [False]*n
dis... | import sys
input = sys.stdin.readline
n = int(eval(input()))
T = [[] for _ in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
T[a].append(b)
T[b].append(a)
def dfs(v):
dist = [-1]*n
dist[v] = 0
stack = [v]
while stack:
nv = stack.pop()
for ... | p03660 |
import sys
from collections import defaultdict
from collections import deque
n=int(eval(input()))
edges=[tuple(map(int,input().split())) for _ in range(n-1)]
d=defaultdict(list)
for e in edges:
d[e[0]].append(e[1])
d[e[1]].append(e[0])
fnc=[-1]*(n+1)
snk=[-1]*(n+1)
fnc[1]=0
snk[n]=0
cv=deque([1])
nv... | from collections import deque, defaultdict
def main():
n=int(eval(input()))
edges=[tuple(map(int,input().split())) for _ in range(n-1)]
d=defaultdict(list)
for e in edges:
d[e[0]].append(e[1])
d[e[1]].append(e[0])
def dist(m):
c=-1
dl=[-1]*(n+1)
cv=deque([m])
nv=deque([1]... | p03660 |
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
input=sys.stdin.readline
inf=float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float, input().split()))... | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
input=sys.stdin.readline
inf=float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float, input().split()))... | p03660 |
#高速化heapqダイクストラ
from collections import *
from heapq import*
import sys
input=lambda:sys.stdin.readline()
def BFS(point,d):
cost=[1e7]*(n+1)
cost[point]=0
Q=deque([(0,point)])
while Q:
c,p = Q.popleft()
for np in d[p]:
if cost[np]==1e7:
... | #高速化heapqダイクストラ
from collections import *
from heapq import*
import sys
input=lambda:sys.stdin.readline()
def BFS(point,d):
cost=[1e7]*(n+1)
cost[point]=0
Q=deque([(0,point)])
while Q:
c,p = Q.popleft()
for np in d[p]:
if cost[np]==1e7:
... | p03660 |
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
def killme(num,lis):
visited[num]=1
if num==N-1:
lis.append(num)
for index,item in enumerate(lis):
highway[item]=index
else:
for next_n in way[num]:
if visited[next_n]==0... | # coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
def killme(num,lis):
visited[num]=1
if num==N-1:
lis.append(num)
for index,item in enumerate(lis):
highway[item]=index
else:
for next_n in way[num]:
if visited[next_n]==0... | p03660 |
N=int(eval(input()))
import collections
import heapq
ab=[tuple(map(int,input().split())) for i in range(N-1)]
G=[set() for i in range(N)]
for a,b in ab:
a-=1
b-=1
G[a].add(b)
G[b].add(a)
q=collections.deque()
dis=[[-1]*N for i in range(2)]
dis[0][0]=0
q.append(0)
while(q):
x=q.popleft()
fo... | import collections
N = int(eval(input()))
G = [set() for i in range(N)]
for i in range(N-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].add(b)
G[b].add(a)
F = [-1]*N
F[0] = 0
q = collections.deque()
q.append(0)
while(q):
x = q.popleft()
for y in G[x]:
... | p03660 |
n = int(eval(input()))
p = [ [] for _ in range(n) ]
for i in range(n - 1):
a, b = list(map(int, input().split()))
p[a - 1].append(b - 1)
p[b - 1].append(a - 1)
f = [[0], []]
d = 1
f[1] = f[1] + p[0]
while 1:
if n - 1 in f[d]:
break
temp = []
for i in f[d]:
t... | n = int(eval(input()))
p = [[] for _ in range(n)]
for i in range(n - 1):
x, y = list(map(int, input().split()))
p[x - 1].append(y - 1)
p[y - 1].append(x - 1)
f = [n for _ in range(n)]
s = [n for _ in range(n)]
f[0] = 0
after = [] + p[0]
before = set()
dist = 0
while 1:
dist += 1
... | p03660 |
from collections import defaultdict,Counter
import queue
N=int(eval(input()))
ab=defaultdict(list)
for i in range(N-1):
a,b=list(map(int,input().split()))
ab[a].append(b)
ab[b].append(a)
q1=queue.Queue()
qN=queue.Queue()
dist=[None for i in range(N)]
dist[0]=1
dist[N-1]=-1
phase=1
F=0
... | from collections import defaultdict,Counter
import queue
N=int(eval(input()))
ab=defaultdict(list)
for i in range(N-1):
a,b=list(map(int,input().split()))
ab[a].append(b)
ab[b].append(a)
q1=queue.Queue()
qN=queue.Queue()
dist=[None for i in range(N)]
dist[0]=1
dist[N-1]=-1
phase=1
for ... | p03660 |
from collections import deque
N = int(eval(input()))
neighbor = [[0]*N for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
neighbor[a-1][b-1] = 1
neighbor[b-1][a-1] = 1
# 黒を0、白を1、未着色を-1で表す
black_white = [0] + [-1]*(N-2) + [1]
# 点iを与えると、点iからの最短距離のリストを返す
def shor... | from collections import deque
N = int(eval(input()))
neighbor = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
neighbor[a-1].append(b-1)
neighbor[b-1].append(a-1)
# 黒を0、白を1、未着色を-1で表す
black_white = [0] + [-1]*(N-2) + [1]
# 点iを与えると、点iからの最短距離のリストを返す
def s... | p03660 |
from collections import deque
N = int(eval(input()))
neighbor = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
neighbor[a-1].append(b-1)
neighbor[b-1].append(a-1)
# 黒を0、白を1、未着色を-1で表す
black_white = [0] + [-1]*(N-2) + [1]
# 点iを与えると、点iからの最短距離のリストを返す
def s... | from collections import deque
N = int(eval(input()))
neighbor = [[] for _ in range(N)]
for _ in range(N-1):
a, b = list(map(int, input().split()))
neighbor[a-1].append(b-1)
neighbor[b-1].append(a-1)
# 黒を0、白を1、未着色を-1で表す
black_white = [0] + [-1]*(N-2) + [1]
# 点iを与えると、点iからの最短距離のリストを返す
def s... | p03660 |
N=int(eval(input()))
E=[[] for i in range(N)]
for i in range(N-1):
a,b=list(map(int,input().split()))
a,b=a-1,b-1
E[a].append(b)
E[b].append(a)
stack=[]
import copy
stack.append([0,[],-1])
Nhalf=None
while stack:
node=stack.pop()
v=node[0]
route=node[1]
parent=node[2]
if v==N-1:
... | N=int(eval(input()))
E=[[] for i in range(N)]
for i in range(N-1):
a,b=list(map(int,input().split()))
a,b=a-1,b-1
E[a].append(b)
E[b].append(a)
F=[0]*N
S=[0]*N
stack=[]
# 番号、距離、親
stack.append([0,0,-1])
while stack:
node=stack.pop()
v=node[0]
dist=node[1]
parent=node[2]
F[v]=dist
... | p03660 |
N=int(eval(input()))
E=[[] for i in range(N)]
for i in range(N-1):
a,b=list(map(int,input().split()))
a,b=a-1,b-1
E[a].append(b)
E[b].append(a)
F=[0]*N
S=[0]*N
stack=[]
# 番号、距離、親
stack.append([0,0,-1])
while stack:
node=stack.pop()
v=node[0]
dist=node[1]
parent=node[2]
F[v]=dist
... | # 全ての頂点について、フェネックからの距離とすぬけくんからの距離を求める
# フェネックからの距離 <= すぬけくんから距離 の頂点は黒 そうでなければ白
import sys
readline = sys.stdin.readline
N = int(readline())
G = [[] for i in range(N)]
for i in range(N - 1):
a,b = list(map(int,readline().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
dist_from_fen = [-1 ... | p03660 |
n = int(eval(input()))
d = [[float("inf")]*n for i in range(n)]
ab = [tuple(map(int,input().split())) for i in range(n-1)]
es = [[] for i in range(n)]
for a,b in ab:
a,b = a-1,b-1
es[a].append(b)
es[b].append(a)
INF = float('inf')
dist0 = [INF] * n
dist0[0] = 0
import heapq
hq = [(0,0)]
heapq... | n = int(eval(input()))
d = [[float("inf")]*n for i in range(n)]
ab = [tuple(map(int,input().split())) for i in range(n-1)]
es = [[] for i in range(n)]
for a,b in ab:
a,b = a-1,b-1
es[a].append(b)
es[b].append(a)
INF = float('inf')
dist0 = [INF] * n
dist0[0] = 0
visited0 = [0]*n
def dfs0(v, par... | p03660 |
from functools import lru_cache
n = int(eval(input()))
d = [[float("inf")]*n for i in range(n)]
ab = [tuple(map(int,input().split())) for i in range(n-1)]
es = [[] for i in range(n)]
for a,b in ab:
a,b = a-1,b-1
es[a].append(b)
es[b].append(a)
INF = float('inf')
dist0 = [INF] * n
dist0[0] = 0... | n = int(eval(input()))
ab = [tuple(map(int,input().split())) for i in range(n-1)]
es = [[] for i in range(n)]
for a,b in ab:
a,b = a-1,b-1
es[a].append(b)
es[b].append(a)
INF = float('inf')
dist0 = [INF] * n
dist0[0] = 0
import heapq
hq = [(0,0)]
heapq.heapify(hq)
while hq:
c,v = heapq.h... | p03660 |
s = input()
s_len = len(s)
while True:
s_len_old = s_len
s_list = list(s)
for i in range(len(s_list) - 1):
if s[i] == 'S' and s[i + 1] == 'T':
s_len -= 2
s_list[i] = ''
s_list[i + 1] = ''
for j in range(1, i + 1):
if s_li... | input_string = input()
s_num = 0
str_len = len(input_string)
for c in input_string:
if c == 'S':
s_num += 1
elif c == 'T':
if s_num > 0:
s_num -= 1
str_len -= 2
print(str_len) | p03986 |
import sys
from collections import deque
X = list(sys.stdin.readline().strip())
s = []
q = deque(X)
while q:
char = q.popleft()
if len(s) == 0:
s.append(char)
continue
if char == "T" and s[-1] == "S":
s.pop()
else:
s.append(char)
print((len... | import sys
X = sys.stdin.readline().strip()
lx = len(X)
stack = []
pop_n = 0
for c in X:
if c == "S":
stack.append(c)
elif c == "T" and 0 < len(stack):
stack.pop()
pop_n += 1
print((lx - 2 * pop_n)) | p03986 |
# AGC005A - STring
def main():
X = input().rstrip()
ans, s, t = 0, 0, 0
for i in X:
if i == "S":
s += 1
else:
if t < s:
t += 1
else:
ans += 1
ans += s - t
print(ans)
if __name__ == "__main__":
... | # AGC005A - STring
def main():
X = input().rstrip()
ans, p = 0, 0 # pair
for i in X:
if i == "S":
p += 1
else:
if p:
p -= 1
else:
ans += 1 # remaining T
ans += p # add remaining S
print(ans)
if _... | p03986 |
#!/usr/bin/env python
s = input()
s1 = []
for x in s:
if not s1:
s1.append(x)
continue
if x == 'T' and s1[-1] == 'S':
s1 = s1[:-1]
else:
s1.append(x)
print(len(s1))
| ipt = input()
l = ""
for s in ipt:
if not l:
l += s
elif l[-1]+s == "ST":
l = l[:-1]
else:
l += s
print(len(l)) | p03986 |
import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
X = input().strip()
while X.count("ST"):
a = X.find("ST")
X = X[:a] + X[a + 2:]
print((len(X)))
if __name__ == '__main__':
main()
| import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
X = input().strip()
scount = 0
ans = 0
for s in X:
if s == "S":
scount += 1
elif s == "T":
if scount == 0:
continue
else:
... | p03986 |
s=input()
while True:
f=0
for i in range(len(s)-1):
if s[i]=="S" and s[i+1]=="T":
s=s[0:i]+s[i+2:len(s)]
f=1
break
if f==0:
break
print((len(s))) | s=input()
stack=[]
for i in range(len(s)):
if len(stack)==0 or s[i]=="S":
stack.append(s[i])
continue
if s[i]=="T":
if stack[-1]=="S":
stack.pop()
else:
stack.append(s[i])
print((len(stack))) | p03986 |
s=input()
stack=[]
for i in range(len(s)):
if len(stack)==0 or s[i]=="S":
stack.append(s[i])
continue
if s[i]=="T":
if stack[-1]=="S":
stack.pop()
else:
stack.append(s[i])
print((len(stack))) | x = input()
stack = []
ans = 0
for i in range(len(x)):
if x[i] == "S":
stack.append("S")
else:
if len(stack) == 0:
ans += 1
else:
stack.pop()
print(ans + len(stack))
| p03986 |
import sys
def main():
N = input().strip()
while True:
ngram_list=[]
#round 1
for i in range(len(N)-1):
ngram_list.append(N[i:i+2])
#round 2
if "ST" in ngram_list:
idx=ngram_list.index("ST")
if idx+2 > len(N):
... | def main():
N = input().strip()
stack = []
for s in N:
if len(stack)==0:
stack.append(s)
elif stack[-1]=="S" and s=="T":
stack.pop()
else:
stack.append(s)
print((len(stack)))
if __name__ == "__main__":
main() | p03986 |
from sys import stdin
X = (stdin.readline().rstrip())
for i in range(10**6):
X = X.replace("ST","")
print((len(X))) | from sys import stdin
from collections import deque
X = (stdin.readline().rstrip())
stack = []
for i in X:
if i == "S":
stack.append(i)
elif (i == "T" and stack == []):
stack.append(i)
elif (i == "T" and stack[-1] == "S"):
stack.pop()
else:
stack.append(i)
pr... | p03986 |
X = input().strip()
i = 0
while i<len(X):
if X[i:i+2]=="ST":
X = X[:i]+X[i+2:]
i -= 1
else:
i += 1
print((len(X))) | X = input().strip()
cnt = 0
cntmax = 0
for i in range(len(X)):
if X[i]=="T":
cnt += 1
cntmax = max(cntmax,cnt)
else:
cnt -= 1
print((cntmax*2)) | p03986 |
s = input()
while 1:
result = s.replace("ST", "")
if result == s:
s = result
break
else: s = result
print(len(s))
| s = input()
T = S = 0
for i in s:
if i == "T":
if S: S -= 1
else: T += 1
elif i == "S":
S += 1
print(T + S)
| p03986 |
s = input()
while s.find('ST') > -1:
s = ''.join(s.split('ST'))
print(len(s)) | s = input()
#while s.find('ST') > -1:
# s = ''.join(s.split('ST'))
#
#print len(s)
temp = []
for i in range(len(s)):
now = s[i]
if len(temp) == 0:
temp.append(now)
elif temp[-1] + now == 'ST':
temp.pop()
else:
temp.append(now)
print(len(temp)) | p03986 |
#AGC005A
x=input()
while x.count('ST')>0:
x=x.replace('ST','')
print(len(x))
| #AGC005A
s=input()
res=0
for c in s:
if c=='S':
res+=1
elif c=='T' and res>0:
res-=1
print(res*2)
| p03986 |
s = ''.join(input().split('ST'))
while 1:
i = s.find('ST')
if i > -1:
cnt = 0
for j in range(min(i, len(s)-2-i)):
if s[i-j-1] == 'S' and s[i+j+2] == 'T':
cnt += 1
else:
break
s = s[:i-cnt] + s[i+cnt+2:]
else:
... | s = ''.join(input().split('ST'))
cnts = 0
cnt = 0
for i in s:
if i == 'S' :
cnts += 1
elif cnts > 0:
cnts -= 1
cnt += 1
print((len(s)-cnt*2)) | p03986 |
s = ''.join(input().split('ST'))
cnts = 0
cnt = 0
for i in s:
if i == 'S' :
cnts += 1
elif cnts > 0:
cnts -= 1
cnt += 1
print((len(s)-cnt*2)) | def main():
s = input().replace('ST', '')
cnts = 0
cnt = 0
for i in s:
if i == 'S':
cnts += 1
elif cnts > 0:
cnts -= 1
cnt += 1
print((len(s)-cnt*2))
if __name__ == '__main__':
main() | p03986 |
from queue import Queue as q
from copy import deepcopy as cp
def l_move(data):
global flag
field,n,i,j = data[0],data[1],data[2],data[3]
if j == 0 or field[i][j-1] == 1 or n == 0:
return(None)
field = cp(field)
field[i][j] = 0
while(j):
if field[i][j-1] == 0:
... | from queue import Queue as q
from copy import deepcopy as cp
def l_move(data):
global flag
field,n,i,j = data[0],data[1],data[2],data[3]
if j == 0 or field[i][j-1] == 1 or n == 0:
return(None)
while(j):
if field[i][j-1] == 0:
j -= 1
elif field[i][j-1] == 3... | p00725 |
import collections
import copy
import sys
if sys.version[0] == '2':
range, input = xrange, raw_input
drc = [(0, -1), (1, 0), (0, 1), (-1, 0)]
def in_board(r, c):
return 0 <= r < H and 0 <= c < W
while True:
W, H = list(map(int, input().split()))
if not (W | H):
break
orig... | import collections
import copy
import sys
if sys.version[0] == '2':
range, input = xrange, raw_input
drc = [(0, -1), (1, 0), (0, 1), (-1, 0)]
def in_board(r, c):
return 0 <= r < H and 0 <= c < W
while True:
W, H = list(map(int, input().split()))
if not (W | H):
break
orig... | p00725 |
# -*- coding: utf-8 -*-
answer = 0
def up(board, pos, count):
global answer
# print 'UP:'
# print 'pos: ' + str(pos)
# print 'count: ' + str(count)
# for row in board:
# print row
# print
y = pos[0]
while y > 0:
y -= 1
if board[y][pos[1]] == 3:
... | # -*- coding: utf-8 -*-
answer = 0
def up(board, pos, count):
global answer
# print 'UP:'
# print 'pos: ' + str(pos)
# print 'count: ' + str(count)
# for row in board:
# print row
# print
y = pos[0]
while y > 0:
y -= 1
if board[y][pos[1]] == 3:
... | p00725 |
import copy
while 1:
W,H = list(map(int,input().split()))
if W == 0: break
field = [list(map(int,input().split())) for _ in range(H)]
for y in range(H):
for x in range(W):
if field[y][x] == 2: sx,sy = x,y
que = [[sx,sy,10,field[:]]]
while que:
x,y,t,field ... | def rec(x,y,t):
global ans
if t >= ans: return
if field[y][x] == 3: ans = min(ans,t)
for dx,dy in zip([1,0,-1,0],[0,1,0,-1]):
nx,ny = x+dx,y+dy
while 0 <= nx < W and 0 <= ny < H:
if field[ny][nx] == 3:
rec(nx,ny,t+1)
if field[ny][nx] == 1:... | p00725 |
def rec(x,y,t):
global ans
if t >= ans: return
if field[y][x] == 3: ans = min(ans,t)
for dx,dy in zip([1,0,-1,0],[0,1,0,-1]):
nx,ny = x+dx,y+dy
while 0 <= nx < W and 0 <= ny < H:
if field[ny][nx] == 3:
rec(nx,ny,t+1)
if field[ny][nx] == 1:... | dxy = list(zip([1,0,-1,0],[0,1,0,-1]))
def rec(x,y,t):
global ans
if t >= ans: return
if field[y][x] == 3: ans = min(ans,t)
for dx,dy in dxy:
nx,ny = x+dx,y+dy
while 0 <= nx < W and 0 <= ny < H:
if field[ny][nx] == 3: ans = t
elif field[ny][nx] == 1:
... | p00725 |
from copy import deepcopy as dcp
delta = ((1, 0), (0, 1), (-1, 0), (0, -1))
def ds(here, lb, ub, field, count):
result = 11
if count == 11:
return count
for dx, dy in delta:
next = (here[0]+dx,here[1]+dy)
if ( not (lb[0] <= next[0] <= ub[0] and lb[1] <= next[1] <= ub[1]) or
field[next[1]][next[0]... | delta = ((1, 0), (0, 1), (-1, 0), (0, -1))
def ds(here, lb, ub, field, count):
result = 11
if count == 11:
return count
for dx, dy in delta:
next = (here[0]+dx,here[1]+dy)
if ( not (lb[0] <= next[0] <= ub[0] and lb[1] <= next[1] <= ub[1]) or
field[next[1]][next[0]] == 1) :
continue
tmp =... | p00725 |
# -*- coding: utf-8 -*-
import sys
import math
debug = False
def log(text):
if debug:
print(text)
def parse_input(lines_as_string = None):
global debug
lines = []
if lines_as_string is None:
debug = False
# for line in sys.stdin:
# lines.appen... | # -*- coding: utf-8 -*-
import sys
import math
debug = False
def log(text):
if debug:
print(text)
def parse_input(lines_as_string = None):
global debug
lines = []
if lines_as_string is None:
debug = False
# for line in sys.stdin:
# lines.appen... | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
rui = [None] * (N)
rui[0] = P[0]
# print(rui)
for i in range(1, N):
a = rui[i-1]
b = P[i]
rui[i] = min(a, b)
c = 0
for i in range(N):
if P[i] <= rui[i]:
c += 1
print(c) | N = int(eval(input()))
P = list(map(int, input().split()))
mn = N+1
c = 0
for pi in P:
if pi <= mn:
c += 1
mn = pi
print(c) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
isBigger = True
for i in range(len(P)):
for j in range(i):
isBigger = True
if not (P[i] <= P[j]):
isBigger = False
break
if isBigger:
count += 1
print(count) | N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
min_value = 2e5+1
for p in P:
if p <= min_value:
min_value = p
count += 1
print(count) | p02791 |
n = int(eval(input()))
data = [int(x) for x in input().split()]
total = 0
for i in range(n):
if min(data[:(i+1)]) == data[i]:
total += 1
print(total) | n = int(eval(input()))
data = [int(x) for x in input().split()]
min_num = data[0]
ans = 0
for i in range(n):
if min_num >= data[i]:
ans += 1
min_num = data[i]
print(ans) | p02791 |
N = int(eval(input()))
a = input().rstrip().split()
ans = 0
p = [0]*N
for i in range(N):
p[i] = int(a[i])
for i in range(N):
if i == 0:
ans += 1
else:
Plus = True
for i2 in range(i):
if p[i2] <= p[i]:
Plus = False
if Plus == True:
ans += 1
print(ans)
| N = int(eval(input()))
a = input().rstrip().split()
P = [0] * N
for i in range(N):
P[i] = int(a[i])
minP = P[0]
ans = 1
for i in range(N - 1):
if minP >= P[i + 1]:
ans += 1
minP = P[i + 1]
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
count=0
for i in range(N):
A=P[i]
if min(P[0:i+1])==A:
count += 1
else:
continue
print(count) | N = int(eval(input()))
P = list(map(int,input().split()))
count=0
mi=P[0] #minimum
for i in range(N):
A=P[i]
if A<=mi:
mi=A
count+=1
else:
continue
print(count) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
pp = list()
pp.append(p[0])
cnt=1
for i in range(1,n):
min_pp = min(pp)
if p[i] <= min_pp:
cnt +=1
pp.append(p[i])
print(cnt) | n = int(eval(input()))
p = list(map(int,input().split()))
min_p = p[0]
cnt=1
for i in range(1,n):
if p[i] <= min_p:
min_p = p[i]
cnt +=1
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(N):
if P[i] <= min(P[:(i+1)]):
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
min = float('inf')
ans = 0
for i in range(N):
if P[i] <= min:
min = P[i]
ans += 1
# if P[i] <= min(P[:(i+1)]):
# ans += 1
print(ans) | p02791 |
n = int(eval(input()))
ps = list(map(int,input().split()))
count = 1
x = ps[0]
for i in range(1,len(ps)):
if x>ps[i]:
x = ps[i]
mi = min(ps[0:i])
if mi>ps[i]:
count += 1
print(count) | n = int(eval(input()))
ps = list(map(int,input().split()))
count = 1
mi = ps[0]
for i in range(1,len(ps)):
if mi>=ps[i]:
mi = ps[i]
count += 1
print(count) | p02791 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
n = int(eval(input()))
pn = list(map(int, input().split()))
def checkAllLess(tgt):
for id in range(tgt):
# print("id=" + str(id) + ", pn[]=" + str(pn[id]) + ", tgt=" + str(tgt))
if(pn[id] < pn[tgt]):
# print('False')
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
n = int(eval(input()))
pn = list(map(int, input().split()))
cnt = 1
min = pn[0]
for i in range(1, n):
if min > pn[i]:
cnt += 1
min = pn[i]
print(cnt)
| p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
c=0
for i in range(n):
lFlag=True
for j in range(i):
if (p[i]>p[j]):
lFlag=False
break
if lFlag:
c=c+1
print(c)
| n=int(eval(input()))
p=list(map(int,input().split()))
c=0
min=2*10**5
for i in range(n):
if (p[i]<=min):
c=c+1
if p[i]<min:
min=p[i]
print(c)
| p02791 |
N = int(eval(input()))
Ps = list(map(int, input().split()))
answer = 0
for i in range(N):
if min(Ps[:i + 1]) >= Ps[i]:
answer = answer + 1
print(answer) | N = int(eval(input()))
Ps = list(map(int, input().split()))
answer = 0
min_num = 2 * 10 ** 5 + 1
for p in Ps:
min_num = min(p, min_num)
if min_num >= p:
answer = answer + 1
print(answer) | p02791 |
n=int(eval(input()))
p=list(map(int, input().split()))
count2=0
for i in range(n):
count1=0
for j in range(i+1):
if p[i] <= p[j]:
count1 += 1
if count1 == i+1:
count2 += 1
print(count2) | n=int(eval(input()))
p=list(map(int, input().split()))
min = p[0]
count=0
for i in range(n):
if p[i] <= min:
min = p[i]
count += 1
print(count)
| p02791 |
import sys
N = int(sys.stdin.readline())
P = list(map(int, sys.stdin.readline().split()))
count = 0
max = P[0]
for i in range(N):
if P[i] > max:
max = P[i]
else:
for j in range(i+1):
if P[i] > P[j]:
break
else:
count += 1
... | import sys
N = int(sys.stdin.readline())
P = list(map(int, sys.stdin.readline().split()))
count = 0
min = P[0]
for i in range(N):
if P[i] <= min:
min = P[i]
count += 1
"""
else:
for j in range(i+1):
if P[i] > P[j]:
break
else:
... | p02791 |
n = int(eval(input()))
ls = list(map(int, input().split()))
ans = 0
for i in range(n):
if(ls[i] == min(ls[:i+1])):
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
# 初期化
cnt = 1
min = p[0]
# カウント処理
for i in range(1, n):
if(p[i] <= min):
cnt += 1
min = p[i]
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 1
for i in range(1, N):
if P[i] == min(P[:i+1]):
cnt += 1
print(cnt) | N = int(eval(input()))
P = list(map(int, input().split()))
min_p = P[0]
cnt = 0
for p in P:
if p <= min_p:
min_p = p
cnt += 1
print(cnt) | p02791 |
#https://atcoder.jp/contests/abc152/tasks/abc152_c
# -*- coding: utf-8 -*-
N = int(eval(input()))
P = input().split()
T = []
L =0
T.insert(0,int(P[0]))
P[0] = int(P[0])
for i in range(1,len(P)):
P[i] = int(P[i])
if min(T)>=P[i]:
L =+ 1
T.append(P[i])
print((len(T))) | #https://atcoder.jp/contests/abc152/tasks/abc152_c
# -*- coding: utf-8 -*-
N = int(eval(input()))
P = input().split()
T = []
L =0
T.insert(0,int(P[0]))
P[0] = int(P[0])
for i in range(1,len(P)):
P[i] = int(P[i])
if T[-1]>=P[i]:
L =+ 1
if T[-1]>P[i]:
T.append(P[i])
print((len(T))) | p02791 |
def main():
n = int(eval(input()))
ps = list(map(int, input().split()))
li = []
ans = 0
for i in ps:
li.append(i)
if sorted(li)[0] >= i:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| def main():
n = int(eval(input()))
ps = list(map(int, input().split()))
ans = 0
minp = float("inf")
for p in ps:
minp = min(minp, p)
if minp >= p:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| p02791 |
def main():
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(N):
for j in reversed(list(range(0, i))):
if P[j] < P[i]:
break
else:
ans += 1
print(ans)
if __name__ == '__main__':
main() | def main():
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
m = P[0]
for i in range(1, N):
if P[i] > m:
continue
m = min(m, P[i])
ans += 1
print(ans)
if __name__ == '__main__':
main() | p02791 |
n = int(eval(input()))
ps = [int(elem) for elem in input().split()]
res = []
for i, p in enumerate(ps):
if ps[:i] == []:
res.append(p)
else:
if res[-1] > p:
res.append(p)
print((len(res))) | n = int(eval(input()))
ps = [int(elem) for elem in input().split()]
cnt = 0
for i, p in enumerate(ps):
if i == 0:
last = p
cnt += 1
else:
if last > p:
last = p
cnt += 1
print(cnt) | p02791 |
def main():
N=int(eval(input()))
P=list(map(int,input().split()))
sumCount=1
for i in range(1,N):
if(P[i]<=min(P[0:i+1])):
sumCount=sumCount+1
print(sumCount)
if __name__ == '__main__':
main() | n = int(eval(input()))
p = list(map(int, input().split()))
num = p[0]
ans = 1
for i in range(1, n):
if num >= p[i]:
ans += 1
num = p[i]
print(ans) | p02791 |
N=int(eval(input()))
a=list(map(int,input().split()))
b=1
for i in range(N-1):
if min(a[:i+2])==a[i+1]:
b+=1
print(b) | N=int(eval(input()))
a=list(map(int,input().split()))
b=1
c=a[0]
for i in range(N-1):
if c>a[i+1]:
b+=1
c=a[i+1]
print(b) | p02791 |
N, *P = list(map(int, open(0).read().split()))
min_v = 10 ** 6
max_v = 0
ans = 0
for i in range(N):
if P[i] < min_v:
ans += 1
min_v = P[i]
elif P[i] > max_v:
max_v = P[i]
print(ans)
|
N = int(eval(input()))
X = list(map(int, input().split()))
ans = 0
cur = 10 ** 6
for i in range(N):
if X[i] <= cur:
ans += 1
cur = min(cur, X[i])
print(ans)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 1
for _ in range(1,n):
for j in range(_):
if p[_] <= p[j]:
if _ == j+1:
cnt += 1
else:
break
print(cnt) | n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
for _ in p: #p[i]よりも小さいものが出てきたらだめ
if _ <= n:
cnt += 1
n = _
print(cnt) | p02791 |
N = int(eval(input()))
p = list(map(int, input().split()))
cnt = 1
if len(p) >= 2 and p[0] >= p[1]:
cnt += 1
for i in range(2, N):
if min(p[:i+1]) == p[i]:
cnt += 1
else:
continue
print(cnt)
| N = int(eval(input()))
p = list(map(int, input().split()))
cnt = 1
mi = p[0]
for i in range(N):
if mi > p[i]:
mi = p[i]
cnt += 1
print(cnt) | p02791 |
n = int(eval(input()))
lis = list(map(int, input().split()))
count = 0
minn = lis[0]
flug = 0
for i in range(n):
if flug == 0:
newlis = lis[0:i+1]
if minn >= lis[i]:
count += 1
minn = lis[i]
if minn == 1:
count += lis[i+1:].count(1)
... | n = int(eval(input()))
lis = list(map(int, input().split()))
count = 0
minn = lis[0]
minl = min(lis)
flug = 0
for i in range(n):
if flug == 0:
if minn >= lis[i]:
count += 1
minn = lis[i]
if minn == minl:
count += lis[i+1:].count(minl)
... | p02791 |
N=int(eval(input()))
P=list(map(int, input().split()))
ans=0
for i in range(N):
flag=True
for j in range(i):
if P[i]>P[j]:
flag=False
break
if flag:
ans+=1
print(ans) | N=int(eval(input()))
P=list(map(int, input().split()))
ans=1
mi=P[0]
for i in range(1,N):
if P[i]<=mi:
ans+=1
mi=P[i]
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
for i in range(N):
if all(list([x >= P[i] for x in P[:i]])):
count += 1
print(count)
| N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
m = P[0]
for i in range(N):
if (m >= P[i]):
count += 1
m = P[i]
print(count)
| p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
l = [2*10**5]
cnt=0
if n == 1:
print((1))
else:
for i in range(n-1):
l.append(p[i])
m = min(l)
if m > p[i+1]:
#print(p[i+1])
cnt+=1
print((cnt+1)) | n = int(eval(input()))
p = list(map(int,input().split()))
m = 2*10**5
cnt=0
if n == 1:
print((1))
else:
for i in range(n-1):
if m > p[i]:
m = p[i]
if m > p[i+1]:
#print(p[i+1])
cnt+=1
print((cnt+1)) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
count=0
for i in range(len(p)):
if min(p[:(1+i)])==p[i]:
count+=1
print(count) | n = int(eval(input()))
p = list(map(int, input().split()))
count=0
minmin=100000000
for i in range(len(p)):
if p[i]<minmin:
count+=1
minmin=p[i]
print(count) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
cnt=0
for i in range(1,n):
if min(p[0:i])<p[i]:
cnt+=1
print((n-cnt)) | n=int(eval(input()))
p=list(map(int,input().split()))
a=p[0]
cnt=1
for i in range(1,n):
if a>=p[i]:
cnt+=1
a=p[i]
print(cnt) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
count=0
flag=True
for i in range(N):
for k in range(1):
l=min(P[:i+1])
if P[i]>l:
flag=False
break
if flag:
count+=1
else:
flag=True
print(count) | N=int(eval(input()))
P=list(map(int,input().split()))
count=1
min=P[0]
for i in range(1,N):
if min>P[i]:
count+=1
min=P[i]
print(count)
| p02791 |
N = int(eval(input()))
nos = list(map(int, input().split()))
count = 1
for j in range(1,N):
if min(nos[0:j+1]) == nos[j]:
count += 1
print(count) | N = int(eval(input()))
nos = list(map(int, input().split()))
count = 1
min = nos[0]
for j in range(1,N):
if nos[j] <= min:
count += 1
min = nos[j]
print(count) | p02791 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, *a = list(map(int, read().split()))
r = 0
for i1 in range(n):
r += min(a[:i1+1]) >= a[i1]
print(r)
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, *a = list(map(int, read().split()))
r = 0
minp = a[0]
for i1 in range(n):
if minp >= a[i1]:
r += 1
minp = a[i1]
print(r)
if __name__ == '__main__':
main()
| p02791 |
n=int(eval(input()))
p =list(map(int,input().split()))
c=0
for i in range(n):
s=p[0:i+1]
s.sort()
if s[0]==p[i]:
c=c+1
print(c) | n=int(eval(input()))
p =list(map(int,input().split()))
c=0
mini=p[0]
for i in range(n):
if mini>=p[i]:
c=c+1
mini=p[i]
print(c) | p02791 |
# C - Low Elements
def main():
N, *P = list(map(int, open(0).read().split()))
ans, cur_min = 0, P[0]
for i in P:
if i <= cur_min:
ans += 1
cur_min = min(cur_min, i)
print(ans)
if __name__ == "__main__":
main()
| # C - Low Elements
def main():
N, *P = list(map(int, open(0).read().split()))
ans, cur_min = 0, P[0]
for i in P:
if i <= cur_min:
ans += 1
cur_min = i
print(ans)
if __name__ == "__main__":
main()
| p02791 |
a = int(eval(input()))
array = list(map(int, input().strip().split()))
out = 0
for i in range(a):
minn = min(array[0:i+1])
out = out + 1 if array[i] == minn else out
print(out) | a = int(eval(input()))
array = list(map(int, input().strip().split()))
out = 0
min_num = array[0]
for i in array:
min_num = min(min_num, i)
out = out + 1 if i == min_num else out
print(out) | p02791 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.