input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
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):
minedge = heapq.heappop(edgelist)
#まだ使わ... | n, x, y = list(map(int, input().split()))
dic = {i: 0 for i in range(1, n)}
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
dist = min(j - i, abs(i - x) + abs(j - y) + 1)
dic[dist] += 1
for i in range(1, n):
print((dic[i]))
| p02726 |
n,x,y=list(map(int,input().split()))
a=[[0 for _ in range(n)] for _ in range(n)]
ans=[0 for _ in range(n-1)]
for i in range(n-1):
for j in range(i+1,n):
t=i+1
u=j+1
a[i][j]=min(abs(u-t),abs(t-x)+1+abs(y-u),abs(t-y)+1+abs(x-u))
X=a[i][j]
ans[X-1]+=1
for l in ans:
print(l) | n,x,y=list(map(int,input().split()))
ans=[0 for _ in range(n-1)]
for i in range(n-1):
for j in range(i+1,n):
t=i+1
u=j+1
H=min(abs(u-t),abs(t-x)+1+abs(y-u),abs(t-y)+1+abs(x-u))
ans[H-1]+=1
for l in ans:
print(l)
| p02726 |
##？
n,x,y = list(map(int,input().split( )))
x-=1;y-=1
cnt = [0]*n
for i in range(n):
for j in range(i+1,n):
dist = min(abs(j-i),abs(x-i)+1+abs(j-y))
cnt[dist]+=1
for i in range(1,n):
print((cnt[i]))
| n,x,y=list(map(int, input().split()))
cnts=[0]*n
for i in range(1,n+1):
for j in range(1,i):
mn=min(abs(i-j),abs(i-x)+abs(j-y)+1,abs(i-y)+abs(j-x)+1)
cnts[mn]+=1
for ci in cnts[1:]:
print(ci)
| p02726 |
def resolve():
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
from collections import defaultdict, deque
matrix = [[0]*N for _ in range(N)]
for i in range(N-1):
matrix[i][i+1] = matrix[i+1][i] = 1
matrix[X][Y] = matrix[Y][X] = 1
ans = [0] * N
for i in ran... | def resolve():
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
from collections import defaultdict, deque
matrix = defaultdict(list)
for i in range(N-1):
matrix[i].append(i+1)
matrix[i+1].append(i)
matrix[X].append(Y)
matrix[Y].append(X)
ans = [0]... | p02726 |
# -*= coding: utf-8 -*-
import queue
N, X, Y = list(map(int, input().split()))
q = queue.Queue()
ans = [0] * N
# BFS
for i in range(N):
# 0 〜 N-1の各頂点からスタート
cost = [-1] * N
cost[i] = 0
q.put(i) # 基準とする頂点をノードiにする
while not q.empty():
# 現在のノードのインデックス
current = q.get()
... | # -*= coding: utf-8 -*-
from collections import deque
N, X, Y = list(map(int, input().split()))
d = deque() # 初期化
ans = [0] * N
# BFS
for i in range(N):
# 0 〜 N-1の各頂点からスタート
cost = [-1] * N
cost[i] = 0
d.append(i) # 基準とする頂点をノードiにする
while len(d) > 0:
# dequeueが空でない間ループ
... | p02726 |
from itertools import combinations as cb
node = []
n,x,y = list(map(int, input().split()))
for i in range(1, n+1):
node.append(i)
pair = list(cb(node, 2))
dist = [0]*n
for a in pair:
if a[1] <= x or a[0] >= y:
dist[a[1]-a[0]] += 1
else:
dist[min(abs(x-a[0])+abs(y-a[1])+1,a[1]-a[0])] += 1
for i... | from itertools import combinations as cb
n,x,y = list(map(int, input().split()))
pair = list(cb(list(range(1,n+1)), 2))
dist = [0]*n
for a in pair:
if a[1] <= x or a[0] >= y:
dist[a[1]-a[0]] += 1
else:
dist[min(abs(x-a[0])+abs(y-a[1])+1,a[1]-a[0])] += 1
for i in range(1, n):
print((dist[i])) | p02726 |
from collections import deque
# 全部ゼロ始まり
n, x, y = list(map(int, input().split()))
G = [[] for _ in range(n)]
for i in range(n-1):
G[i].append(i+1)
for i in range(1, n):
G[i].append(i-1)
x -= 1
y -= 1
G[x].append(y)
G[y].append(x)
# iとjの最短距離を返す
def bfs(i, j):
i -= 1
j -= 1
q = deque... | n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
cnt = [0] * n
for i in range(n-1):
for j in range(i+1, n):
direct = j - i
detour = abs(x-i) + abs(y-j) + 1
d = min(direct, detour)
cnt[d] += 1
for k in range(1, n):
print((cnt[k])) | p02726 |
# Author: cr4zjh0bp
# Created: Sat Mar 28 11:53:27 UTC 2020
import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf ... | # Author: cr4zjh0bp
# Created: Sat Mar 28 11:53:27 UTC 2020
import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf ... | p02726 |
# D - Line++
import queue
N, X, Y = list(map(int, input().split()))
X, Y = X - 1, Y - 1
M = [(i, []) for i in range(N)]
for i in range(N):
if i != 0:
M[i][1].append(i - 1)
if i != N - 1:
M[i][1].append(i + 1)
if i == X:
M[X][1].append(Y)
if i == Y:
M[Y][1... | # D - Line++
n, x, y = list(map(int, input().split()))
x, y = x - 1, y - 1
cnt = [0] * n
for i in range(n):
for j in range(i + 1, n):
dist = min(j - i, abs(x - i) + abs(y - j) + 1)
cnt[dist] += 1
for i in range(1, len(cnt)):
print((cnt[i]))
| p02726 |
import math
N, X, Y = list(map(int, input().split()))
distnum = [0 for i in range(N)]
dist = [[0 for i in range(N+1)] for j in range(N+1)]
for i in range(1, N+1):
for j in range(i, N+1):
dist[i][j] = min(abs(X-i) + 1 + abs(Y-j), abs(X-j)+1+abs(Y-i), abs(i-j))
distnum[dist[i][j]] += 1
for i i... | import math
N, X, Y = list(map(int, input().split()))
distnum = [0 for i in range(N)]
for i in range(1, N+1):
for j in range(i, N+1):
dist = min(abs(X-i) + 1 + abs(Y-j), abs(X-j)+1+abs(Y-i), abs(i-j))
distnum[dist] += 1
for i in range(1, N):
print((distnum[i])) | p02726 |
N, X, Y = list(map(int,input().split()))
k_list = [0]*N
for p in range(1, N):
for q in range(p, N+1):
p2X = abs(p - X)
p2Y = abs(p - Y)
q2X = abs(q - X)
q2Y = abs(q - Y)
distance = min(q-p, p2X+1+q2Y)
k_list[distance] += 1
for k in range(1, N):
pr... | N, X, Y = list(map(int,input().split()))
k_list = [0]*N
for p in range(1, N):
for q in range(p, N+1):
p2X = abs(p - X)
q2Y = abs(q - Y)
distance = min(q-p, p2X+1+q2Y)
k_list[distance] += 1
for k in range(1, N):
print((k_list[k])) | p02726 |
from collections import deque
def bfs(start):
global count
d = [float('inf') for i in range(N)]
d[start] = 0
que = deque()
que.append(start)
alr = [start]
while que:
q = que.popleft()
c = d[q]
for i in path[q]:
if i not in alr:
... | N,X,Y = list(map(int,input().split()))
ans = [0 for i in range(N-1)]
for i in range(1,N):
for j in range(i+1,N+1):
mina = min(j-i, abs(X-i)+1+abs(Y-j), abs(Y-i)+1+abs(X-j))
ans[mina-1] += 1
for i in ans:
print(i) | p02726 |
from heapq import heappush, heappop
from collections import deque
n, x, y = list(map(int, input().split()))
G = [[]*n for _ in range(n)]
for i in range(n-1):
G[i].append((i+1, 1))
G[i+1].append((i, 1))
G[x-1].append((y-1, 1))
G[y-1].append((x-1, 1))
# print(G)
INF = 10**30
N = n
# s: 開始頂点
# N... | from collections import defaultdict
from heapq import heappush, heappop
from collections import deque
n, x, y = list(map(int, input().split()))
G = [[]*n for _ in range(n)]
for i in range(n-1):
G[i].append((i+1, 1))
G[i+1].append((i, 1))
G[x-1].append((y-1, 1))
G[y-1].append((x-1, 1))
# print(G)
IN... | p02726 |
N,X,Y=list(map(int,input().split()))
X-=1
Y-=1
dist=[0]*(N+1)
for i in range(N):
for j in range(N):
dist[(min(abs(i-j),abs(i-Y)+abs(X-j)+1,abs(i-X)+abs(Y-j)+1))]+=1
for d in range(1,N):
print((dist[d]//2))
| N,X,Y=list(map(int,input().split()))
X-=1
Y-=1
dist=[0]*(N+1)
for i in range(N):
for j in range(i+1,N):
dist[(min(abs(i-j),abs(i-Y)+abs(X-j)+1,abs(i-X)+abs(Y-j)+1))]+=1
for d in range(1,N):
print((dist[d]))
| p02726 |
def dijkstra(s,n,w,cost, pre):
#始点sから各頂点への最短距離
#n:頂点数, w:辺の数, cost[u][v] : 辺uvのコスト(存在しないときはinf)
d = [float("inf")] * n
for i in range(len(pre)):
d[i] = pre[i]
used = [False] * n
d[s] = 0
while True:
v = -1
#まだ使われてない頂点の中から最小の距離のものを探す
for i in r... | a, b, c = list(map(int, input().split()))
b = b - 1
c = c - 1
A = []
for i in range(a):
for j in range(i+1, a):
A.append(min(abs(i - b) + 1 + abs(j - c), abs(j - i)))
import collections
C = collections.Counter(A)
for i in range(1, a):
print((C[i])) | p02726 |
from collections import deque
def main():
N, X, Y = list(map(int, input().split()))
ans = [0] * N # 距離ごとの合計 [d=0, d=1, d=2, d=3, d=4]の数
X -= 1
Y -= 1
for start_vertex in range(N):
dist = [float('inf')] * N
q = deque()
def push(vertex, distance):
... | import sys
input = sys.stdin.readline
from collections import deque
def main():
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
ans = [0] * N
for start_vertex in range(N):
q = deque()
distance_list = [float('inf')] * N
def push(vertex, distance):
... | p02726 |
N, X, Y = input().split()
N = int(N)
X = int(X)
x = X - 1
Y = int(Y)
y = Y -1
A = [[0] * N for _ in range(N)]
for i in range(N):
for j in range(N-i):
A[i][i + j] = min(abs(x- i) +1 +abs(y-i-j),j)
A[X-1][Y-1] = 1
ans = []
ans.append(sum(A, []))
for t in range(N):
if t == 0:
conti... |
N, X, Y = input().split()
N = int(N)
X = int(X)
x = X - 1
Y = int(Y)
y = Y -1
ans = [0] * (N)
A = [[] * N for _ in range(N)]
for i in range(N):
for j in range(N-i):
path = min(abs(x- i) +1 +abs(y-i-j),j)
ans[path] += 1
for _ in range(len(ans)):
if _ == 0:
continue
pr... | p02726 |
def main():
from collections import deque
N, X, Y = map(int, input().split())
X -= 1
Y -= 1
g = tuple(set() for _ in range(N))
for v in range(N):
if v > 0:
g[v].add(v - 1)
if v < N - 1:
g[v].add(v + 1)
g[X].add(Y)
g[Y].add(X)
... | # https://atcoder.jp/contests/abc160/submissions/11310424
def main():
N, X, Y = map(int, input().split())
X -= 1
Y -= 1
def dist(a, b):
return min(
abs(a - b),
abs(a - X) + abs(b - Y) + 1,
abs(a - Y) + abs(b - X) + 1
)
ctr = [0] * ... | p02726 |
# https://atcoder.jp/contests/abc160/submissions/11310424
def main():
N, X, Y = map(int, input().split())
X -= 1
Y -= 1
def dist(a, b):
return min(
abs(a - b),
abs(a - X) + abs(b - Y) + 1,
abs(a - Y) + abs(b - X) + 1
)
ctr = [0] * ... | # https://atcoder.jp/contests/abc160/submissions/11310424
def main():
N, X, Y = map(int, input().split())
X -= 1
Y -= 1
def dist(a, b):
return min(
abs(a - b),
abs(a - X) + abs(b - Y) + 1,
abs(a - Y) + abs(b - X) + 1
)
ctr = [0] * ... | p02726 |
def dist(a, b):
return min(
abs(a - b),
abs(a - x) + 1 + abs(y - b),
abs(a - y) + 1 + abs(x - b)
)
n, x, y = map(int, input().split())
x -= 1
y -= 1
d = [0] * n
for j in range(n):
for i in range(j):
d[dist(i, j)] += 1
it = iter(d)
next(it)
print(*it... | def main():
N, X, Y = map(int, input().split())
X -= 1
Y -= 1
ans = [0] * N
for j in range(N):
for i in range(j):
d = min(
j - i,
abs(j - X) + 1 + abs(Y - i),
abs(j - Y) + 1 + abs(X - i)
)
ans[d... | p02726 |
import pprint
from itertools import chain
import collections
n, x, y = (int(each) for each in input().split(' '))
# table1 = [[0] * n for i in range(n)]
# table2 = [[0] * n for i in range(n)]
table_shortest = [[0] * n for i in range(n)]
# cntr = {}
# # 点iから点jまでの距離をテーブルにする
# # 抜け道を通らないルートの場合
# for i in r... | import pprint
from itertools import chain
import collections
n, x, y = (int(each) for each in input().split(' '))
# table1 = [[0] * n for i in range(n)]
# table2 = [[0] * n for i in range(n)]
table = [[0] * n for i in range(n)]
# cntr = {}
# # 点iから点jまでの距離をテーブルにする
# # 抜け道を通らないルートの場合
# for i in range(n):
... | p02726 |
N, X, Y = map(int, input().split())
dis = [0] * (N - 1)
for i in range(1, N):
for j in range(i + 1, N + 1):
cmb = min(j - i, min(abs(X - i) + 1 + abs(Y - j), abs(Y - i) + 1 + abs(X - j)))
dis[cmb - 1] += 1
[print(i) for i in dis]
| N, X, Y = map(int, input().split())
dis = [0] * (N - 1)
for i in range(1, N):
for j in range(i + 1, N + 1):
cmb = min(j - i, abs(X - i) + 1 + abs(Y - j), abs(Y - i) + 1 + abs(X - j))
dis[cmb - 1] += 1
[print(i) for i in dis]
| p02726 |
from collections import deque, defaultdict
n, x, y = list(map(int, input().split()))
inf = 10**10
dp = [[inf]*n for _ in range(n)]
dic = defaultdict(int)
pas = defaultdict(list)
for i in range(n):
l=1
dp[i][i] = 0
if i==0 and x==1:
queue = deque([1, y-1])
dp[i][1]=1
... | from collections import deque, defaultdict
n, x, y = list(map(int, input().split()))
inf = 10**10
dp = [[inf]*n for _ in range(n)]
dic = defaultdict(int)
for i in range(n):
l=1
dp[i][i] = 0
if i==0 and x==1:
queue = deque([1, y-1])
dp[i][1]=1
dp[i][y-1]=1
... | p02726 |
n,x,y=list(map(int,input().split()))
s=[]
for i in range(1,n):
for j in range(i+1,n+1):
s.append(min(j-i,abs(x-j)+1+abs(y-i),abs(x-i)+1+abs(y-j)))
for l in range(1,n):
print((s.count(l))) | n,x,y=list(map(int,input().split()))
res=[0]*n
for i in range(1,n):
for j in range(i+1,n+1):
s=(min(j-i,abs(x-j)+1+abs(y-i),abs(x-i)+1+abs(y-j)))
res[s]+=1
for k in range(1,n):
print((res[k])) | p02726 |
from collections import deque
def dfs(rel, s):
dist = [-1] * len(rel)
q = deque()
q.append(s)
dist[s] = 0
while len(q):
e = q.popleft()
for ei in Rel[e]:
if dist[ei] >= 0:
continue
q.append(ei)
dist[ei] = dist[e]... | N, X, Y = list(map(int, input().split()))
D = [None] + [0] * (N - 1)
for i in range(1, N):
for j in range(i + 1, N + 1):
d = min(abs(j - i),
abs(X - i) + 1 + abs(j - Y),
abs(Y - i) + 1 + abs(j - X))
D[d] += 1
for d in D[1:]:
print(d)
| p02726 |
# coding: utf-8
from collections import deque
def main():
N, X, Y = map(int, input().split())
X -= 1
Y -= 1
D = [[float("inf") for _ in range(N)] for _ in range(N)]
D[X][Y] = 1
D[Y][X] = 1
queue = deque([[X, Y]])
visited = [[False for _ in range(N)] for _ in range(N)]
visi... | # coding: utf-8
from collections import deque
def main():
N, X, Y = map(int, input().split())
X -= 1
Y -= 1
D = [[0 for _ in range(N)] for _ in range(N)]
D[X][Y] = 1
D[Y][X] = 1
queue = deque([[X, Y]])
visited = [[False for _ in range(N)] for _ in range(N)]
visited[X][Y] =... | p02726 |
n,x,y = list(map(int, input().split()))
ans = [0]*(n)
for i in range(n-1):
for j in range(i+1, n):
r1 = min(j-i, (abs(x-i-1) + 1 + abs(y-j-1) ), (abs(y-i-1) + 1 + abs(x-j-1) ) )
ans[r1] += 1
for i in ans[1:]:
print(i) | n,x,y = list(map(int, input().split()))
ans = [0]*(n)
for i in range(n-1):
for j in range(i+1, n):
#r1 = min(j-i, (abs(x-i-1) + 1 + abs(y-j-1) ), (abs(y-i-1) + 1 + abs(x-j-1) ) )
r1 = min(j - i, (abs(x - i - 1) + 1 + abs(y - j - 1)))
ans[r1] += 1
for i in ans[1:]:
print(i) | p02726 |
n,x,y=list(map(int,input().split()))
x,y=x-1,y-1
adj=[[float("inf")]*n for i in range(n)]
for i in range(n):
for j in range(n):
adj[i][j]=abs(i-j)
adj[x][y]=adj[y][x]=1
for i in range(n):
for j in range(n):
for k in range(n):
adj[j][k]=min(adj[j][k],adj[j][i]+adj[i][k])
an... | n,x,y=list(map(int,input().split()))
x,y=x-1,y-1
adj=[[float("inf")]*n for i in range(n)]
adj[x][y]=adj[y][x]=1
for i in range(n):
for j in range(n):
adj[i][j]=min(abs(i-j),abs(i-x)+1+abs(y-j),abs(i-y)+1+abs(y-j))
ans=[0 for i in range(n)]
for i in range(n-1):
for j in range(i+1,n):
an... | p02726 |
n, x, y = list(map(int, input().split()))
ans = [0] * n
for i in range(1, n+1):
for j in range(1, n+1):
r = min(
abs(i-j),
abs(x-i) + 1 + abs(y-j),
abs(y-i) + 1 + abs(x-j)
)
if r > n-1:
continue
ans[r] += 1
print(("\n".joi... | n, x, y = list(map(int, input().split()))
ans = [0] * n
for i in range(1, n+1):
for j in range(i, n+1):
r = min(
abs(i-j),
abs(x-i) + 1 + abs(y-j),
abs(y-i) + 1 + abs(x-j)
)
ans[r] += 1
print(("\n".join(map(str, ans[1:]))))
| p02726 |
from collections import deque, Counter
N, X, Y = list(map(int, input().split()))
G = [[0]*N for _ in range(N)]
for i in range(N-1):
G[i][i+1] = 1
G[i+1][i] = 1
G[X-1][Y-1] = 1
G[Y-1][X-1] = 1
def bfs():
C = Counter([i+1 for i in range(N)])
for i in range(N):
color = ['W']*N
... | N, X, Y = map(int, input().split())
ans = [0]*(N-1)
for i in range(1, N):
for j in range(i+1, N+1):
d = min(j-i, abs(X-i)+abs(j-Y)+1)
ans[d-1] += 1
print(*ans, sep='\n')
| p02726 |
import itertools
N, X, Y = list(map(int, input().split()))
result = []
for i in range(1, N+1):
for j in range(i, N+1):
result.append(min(abs(j-i), abs(X-i) + 1 + abs(j-Y), abs(Y-i)+1+abs(j-X)))
for i in range(1, N):
print((result.count(i)))
| import itertools
N, X, Y = list(map(int, input().split()))
# dp = [[float('inf')] * (N+1) for _ in range(N+1)]
# # dp[Y][X] = 1
# dp[X][Y] = 1
# for i in range(1,N+1):
# for j in range(i,N+1):
# if i == j:
# dp[i][j] = 0
# elif i == X and j == Y:
# dp[X][Y] = ... | p02726 |
n,x,y = list(map(int,input().split()))
import heapq
def dijkstra(s):
hq = [(0, s)]
heapq.heapify(hq) # リストを優先度付きキューに変換
cost = [float('inf')] * n # 行ったことのないところはinf
cost[s] = 0 # 開始地点は0
while hq:
c, v = heapq.heappop(hq)
if c > cost[v]: # コストが現在のコストよりも高ければスルー
... | n,x,y = list(map(int,input().split()))
import heapq
def dijkstra(s):
hq = [(0, s)]
heapq.heapify(hq) # リストを優先度付きキューに変換
cost = [float('inf')] * n # 行ったことのないところはinf
cost[s] = 0 # 開始地点は0
while hq:
c, v = heapq.heappop(hq)
if c > cost[v]: # コストが現在のコストよりも高ければスルー
... | p02726 |
from collections import deque
class Node:
def __init__(self, idx):
self.idx = idx
self.a = []
n, x, y = list(map(int, input().split()))
nodes = []
for i in range(n):
node = Node(i+1)
nodes.append(node)
for i in range(n-1):
cur = nodes[i]
next = nodes[i+1]
... | from collections import deque
class Node:
def __init__(self, idx):
self.idx = idx
self.a = []
n, x, y = list(map(int, input().split()))
nodes = []
for i in range(n):
node = Node(i+1)
nodes.append(node)
for i in range(n-1):
cur = nodes[i]
next = nodes[i+1]
... | p02726 |
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def dijkstra(start):
INF = 10 ** 10
dist = [INF] * (N+1)
dist[start] = 0
que = [(0,start)]
while que:
d, prev = h... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, X, Y = lr()
dis = [[0] * (N+1) for _ in range(N+1)]
for i in range(1, N):
for j in range(i+1, N+1):
dis[i][j] = j - i
dis[j][i] = j - i
dis[X][Y]... | p02726 |
# -*- coding: utf-8 -*-
import collections
N,X,Y = list(map(int,input().split()))
ToltN=N*(N-1)/2
Dist=[[0 for i in range(N)] for i in range(N)]
for i in range(N):
for j in range(i,N):
MyDist=abs(i-(X-1))+abs(j-(Y-1))+1
if MyDist<j-i:
Dist[i][j]=MyDist
else:
... | # -*- coding: utf-8 -*-
import collections
N,X,Y = list(map(int,input().split()))
ToltN=N*(N-1)/2
Dist=[[0 for i in range(N)] for i in range(N)]
c=[0]*N
for i in range(N):
for j in range(i+1,N):
MyDist=abs(i-(X-1))+abs(j-(Y-1))+1
if MyDist<j-i:
Dist[i][j]=MyDist
c[... | p02726 |
n, x, y = list(map(int, input().split()))
ans = dict.fromkeys(list(range(1, n)), 0)
for i in range(1, n+1):
for j in range(i+1, n+1):
d = min(abs(j - i), abs(x - i) + 1 + abs(y - j), abs(x - j) + 1 + abs(y - i))
ans[d] += 1
for v in list(ans.values()):
print(v)
| n, x, y = list(map(int, input().split()))
ans = [0] * n
for i in range(1, n+1):
for j in range(i+1, n+1):
ans[min(abs(j - i), abs(x - i) + 1 + abs(y - j), abs(x - j) + 1 + abs(y - i))] += 1
for e in ans[1:]:
print(e)
| p02726 |
from itertools import combinations
N,X,Y = list(map(int, input().split()))
ans = [0]*(N-1)
for a,b in combinations(list(range(N)),2):
c = min([abs(a-b), abs(X-1-a)+abs(Y-1-b)+1, abs(Y-1-a)+abs(X-1-b)+1])
ans[c-1] += 1
print(("\n".join([str(i) for i in ans]))) | from itertools import combinations
N,X,Y = list(map(int, input().split()))
ans = [0]*(N-1)
for a,b in combinations(list(range(N)),2):
c = min([abs(a-b), abs(X-1-a)+abs(Y-1-b)+1, abs(Y-1-a)+abs(X-1-b)+1])
ans[c-1] += 1
for i in ans: print(i) | p02726 |
from collections import deque, Counter
INF = float("inf")
N, X, Y = list(map(int, input().split()))
E = [[] for _ in range(N + 1)]
for i in range(1, N):
E[i].append(i + 1)
E[i + 1].append(i)
E[X].append(Y)
E[Y].append(X)
C = Counter()
for s in range(1, N + 1):
dist = [INF] * (N + 1)
... | from itertools import combinations
N, X, Y = list(map(int, input().split()))
A = [0] * N
for i, j in combinations(list(range(1, N + 1)), 2):
A[min(abs(i - j), abs(X - i) + abs(Y - j) + 1, abs(X - j) + abs(Y - i) + 1)] += 1
for a in A[1:]:
print(a) | p02726 |
n, x, y = list(map(int,input().split()))
cnt = 0
ans=[0]*n
for i in range(1,n+1):
for j in range(i+1,n+1):
d = min(j-i,abs(x-i)+abs(y-j)+1)
ans[d] += 1
for i in range(1,n):
print((ans[i])) | def main():
n, x, y = list(map(int,input().split()))
cnt = 0
ans=[0]*n
for i in range(1,n+1):
for j in range(i+1,n+1):
d = min(j-i,abs(x-i)+abs(y-j)+1)
ans[d] += 1
for i in range(1,n):
print((ans[i]))
if __name__ == "__main__":
ma... | p02726 |
n, x, y = list(map(int, input().split()))
inf = 1000000000
edges = [[inf] * n for _ in range(n)]
for i in range(n - 1):
edges[i][i + 1] = 1
edges[i + 1][i] = 1
edges[x - 1][y - 1] = 1
for k in range(n):
for i in range(n):
for j in range(n):
edges[i][j] = min(edges[i][j], ... | n, x, y = list(map(int, input().split()))
ans = [0] * n
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
ans[min(j - i, min(abs(i - x) + 1 + abs(y - j),
abs(i - y) + 1 + abs(x - j)))] += 1
for x in ans[1:]:
print(x)
| p02726 |
n,x,y=list(map(int,input().split()))
x-=1
y-=1
d=[10000 for i in range(n)]
ans=[0 for i in range(n)]
for i in range(n):
d[i]=0
for j in range(i,n):
if(i==j):continue
d[j]=min(abs(i-j),abs(x-i)+abs(y-j)+1,abs(y-i)+abs(x-j)+1)
for j in range(n):
ans[d[j]]+=1
for i in rang... | n,x,y=list(map(int,input().split()))
x-=1
y-=1
d=[10000 for i in range(n)]
ans=[0 for i in range(n)]
for i in range(n):
for j in range(i,n):
m=min(abs(i-j),abs(x-i)+abs(y-j)+1,abs(y-i)+abs(x-j)+1)
ans[m]+=1
for i in range(1,n):
print((ans[i])) | p02726 |
N,X,Y = list(map(int,input().split()))
ans = [0]*(N-1)
X , Y = X-1 , Y-1#配列の場所に合わせる
for i in range(N):
for k in range(N):
if i == k:
pass
else:
if i < k:
ans_ = min(abs(k-i),abs(X-i)+abs(Y-k)+1)
ans[ans_-1] += 1
else:
ans_ = min(abs(k-i),abs(X-k)+abs(Y-i... | n,x,y=list(map(int,input().split()))
c=[0]*~-n
for i in range(n):
for j in range(i):
c[min(~j+i,abs(~j+x)+abs(~i+y))]+=1
for i in c:
print(i) | p02726 |
N,X,Y=list(map(int,input().split()))
L=[[i+1 for i in range(j+1)][::-1]+[0]*(N-1-j) for j in range(N-1)]
for i in range(len(L)):
L[i]=[0]+L[i]+[0]
L.append([0]*(N+2))
L.insert(0,[0]*(N+2))
L.insert(0,[0]*(N+2))
H=[i+1 for i in range(N-1)][::-1]
L[Y][X]=1
task=[(Y,X,1)]
while len(task)>0:
P=task... | N,X,Y=list(map(int,input().split()))
ans=[0]*N
X-=1
Y-=1
for i in range(N-1):
for j in range(i+1,N):
ans[min(j-i,abs(j-Y)+abs(i-X)+1)]+=1
ans.pop(0)
for i in ans:
print(i) | p02726 |
n, x, y = list(map(int, input().split()))
ans = [0] * n
a = [n] * n
x -= 1
y -= 1
for i in range(0, n):
a = [n] * n
a[i] = 0
for j in range(i, 0, -1):
if j == x:
a[y] = min(a[y], a[j] + 1)
if j == y:
a[x] = min(a[x], a[j] + 1)
a[j - 1] = min(a[j -... | n, x, y = list(map(int, input().split()))
ans = [0] * n
a = [n] * n
x -= 1
y -= 1
for i in range(0, n):
a = [n] * n
a[i] = 0
b = [i, x, y, x, y]
for k in b:
for j in range(k, 0, -1):
if j == x:
a[y] = min(a[y], a[j] + 1)
if j == y:
... | p02726 |
from itertools import combinations
N, X, Y = list(map(int, input().split()))
result = []
for i, j in combinations(list(range(1, N+1)), 2):
mins = min([j-i, abs(Y-j)+abs(X-i)+1])
result.append(mins)
print(N)
for i in range(1, N-1):
print((result.count(i+1))) | from itertools import combinations
N, X, Y = list(map(int, input().split()))
result = [0]*N
for i, j in combinations(list(range(1, N+1)), 2):
mins = min([j-i, abs(Y-j)+abs(X-i)+1])
result[mins] += 1
for i in range(1, N):
print((result[i])) | p02726 |
n,x,y = list(map(int,input().split()))
def dijkstra(s,n,w,cost):
#始点sから各頂点への最短距離
#n:頂点数, w:辺の数, cost[u][v] : 辺uvのコスト(存在しないときはinf)
d = [float("inf")] * n
used = [False] * n
d[s] = 0
while True:
v = -1
#まだ使われてない頂点の中から最小の距離のものを探す
for i in range(n):
... | import heapq
def dijkstra(edges, s):
hq = []
d = [-1] * n
d[s] = 0
heapq.heappush(hq, (0, s))
while hq:
d1, p = heapq.heappop(hq)
for i in edges[p]:
if d[i] == -1 or d[i] > d1 + 1:
d[i] = d1 + 1
heapq.heappush(hq, (d1+1, i))
... | p02726 |
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left #bisect_left(list, value)
import heapq
#from fractions import gcd
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input... | import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left #bisect_left(list, value)
import heapq
#from fractions import gcd
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input... | p02726 |
#設定
import sys
input = sys.stdin.buffer.readline
#ライブラリインポート
from collections import defaultdict
import queue
INF = float("inf")
class Graph(object):
def __init__(self):
self.graph = defaultdict(list)
def __len__(self):
return len(self.graph)
def add_edge(self, a, b):
self.graph[a].appen... | import sys; input = sys.stdin.buffer.readline
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")
def getlist():
return list(map(int, input().split()))
#処理内容
def main():
N, X, Y = getlist()
X -= 1; Y -= 1
D = defaultdict(int)
for i in range(N):
for j in range(i + 1, N):
v... | p02726 |
#!/usr/bin/env python3
import sys
import collections
def solve(N: int, X: int, Y: int):
def len_shortest_path(i, j, X, Y):
return min(abs(j-i), abs(X-i) + abs(Y-j) + 1)
result = collections.defaultdict(int)
for i in range(1, N+1):
for j in range(i+1, N+1):
shortest_pat... | #!/usr/bin/env python3
import sys
import collections
def solve(N: int, X: int, Y: int):
X = X - 1
Y = Y - 1
counter = collections.defaultdict(int)
for i in range(N):
for j in range(i+1, N):
k = min(j - i, abs(Y-j) + abs(X-i) + 1)
counter[k] += 1
for i i... | p02726 |
N, X, Y = list(map(int, input().split()))
neighbor = { i: [] for i in range(1, N+1) }
for i in range(1,N):
neighbor[i].append(i+1)
neighbor[N-i+1].append(N-i)
neighbor[X].append(Y)
neighbor[Y].append(X)
distanced_neighbor = { i: { j: [] for j in range(1, N)} for i in range(1, N+1) }
for i in range(1, ... | N, X, Y = list(map(int, input().split()))
for K in range(1,N):
res = 0
for i in range(N-1):
for j in range(i+1,N):
min_dist = min(abs(j-i), abs(X-1-i)+1+abs(Y-1-j), abs(Y-1-i)+1+abs(X-1-j))
if min_dist == K:
res += 1
print(res) | p02726 |
import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [s... | import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [s... | p02726 |
from collections import Counter
N, X, Y = list(map(int, input().split()))
def dijkstra(s, n, w, cost):
d = [float("inf")] * n
used = [False] * n
d[s] = 0
while True:
v = -1
for i in range(n):
if (not used[i]) and (v == -1):
v = i
eli... | from collections import Counter, defaultdict, deque
N, X, Y = list(map(int, input().split()))
d = defaultdict(set)
for i in range(N-1):
d[i].add(i+1)
d[i+1].add(i)
d[X-1].add(Y-1)
d[Y-1].add(X-1)
cost = [[N]*N for _ in range(N)]
q = deque()
for i in range(N):
q.append((i, 0))
cos... | p02726 |
n, x, y = list(map(int, input().split()))
li = []
x -= 1
y -= 1
for i in range(n-1):
li_i = []
for j in range(i+1, n):
li_i.append(min(j-i, abs(x-i)+abs(y-j)+1))
li.append(li_i)
for i in range(1,n):
a = 0
for j in range(n-1):
for k in range(n-1-j):
if li[j][k] == i:
a += 1
... | n, x, y = list(map(int, input().split()))
li = [0 for i in range(n-1)]
x -= 1
y -= 1
for i in range(n-1):
for j in range(i+1, n):
a = min(j-i, abs(x-i)+abs(y-j)+1)
li[a-1] += 1
for x in li:
print(x) | p02726 |
import heapq
INFTY = 10**4
N,X,Y = list(map(int,input().split()))
C = {k:0 for k in range(N)}
G = {i:[] for i in range(1,N+1)}
G[1].append(2)
G[N].append(N-1)
for i in range(2,N):
G[i].append(i-1)
G[i].append(i+1)
G[X].append(Y)
G[Y].append(X)
for i in range(1,N+1):
heap = [(0,i)]
dist = [... | import heapq
INFTY = 10**4
N,X,Y = list(map(int,input().split()))
G = {i:[] for i in range(1,N+1)}
for i in range(1,N):
G[i].append(i+1)
G[i+1].append(i)
G[X].append(Y)
G[Y].append(X)
dist = [[INFTY for _ in range(N+1)] for _ in range(N+1)]
for i in range(N+1):
dist[i][i] = 0
for i in range(1,N+... | p02726 |
# -*- coding: utf-8 -*-
import queue
n, x, y = map(int, input().split())
x -= 1
y -= 1
INF = 10010101010101
ans = [0]*n
def put(v, d):
if dist[v] != INF:
return
dist[v] = d
q.put(v)
for sv in range(n):
q = queue.Queue()
dist = [INF for _ in range(n)]
put(sv, 0)
whil... | # -*- coding: utf-8 -*-
n, x, y = map(int, input().split())
x -= 1
y -= 1
ans = [0]*n
for i in range(n):
for j in range(i + 1, n):
dist1 = j - i
dist2 = abs(x - i) + abs(y - j) + 1
ans[min(dist1, dist2)] += 1
print(*ans[1:], sep='\n')
| p02726 |
from collections import defaultdict, deque
def solve():
N, X, Y = list(map(int, input().split()))
cnter = [0] * N
for start in range(N-1):
deq = deque()
deq.append(start)
n_step = [float('inf')] * N
n_step[start] = 0
visited = [False] * N
while l... | from collections import defaultdict, deque
def solve():
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
cnter = defaultdict(int)
for i in range(N):
for j in range(i,N):
n_step = min(abs(j-i), abs(X-i)+1+abs(Y-j), abs(Y-i)+1+abs(j-X))
cnter[n_step] +... | p02726 |
import math
from math import gcd,pi,sqrt
INF = float("inf")
import sys
sys.setrecursionlimit(10**6)
import itertools
from collections import Counter,deque
def i_input(): return int(eval(input()))
def i_map(): return list(map(int, input().split()))
def i_list(): return list(i_map())
def i_row(N): return [i_i... | import math
from math import gcd,pi,sqrt
INF = float("inf")
import sys
sys.setrecursionlimit(10**6)
import itertools
from collections import Counter,deque
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _... | p02726 |
from collections import deque, defaultdict
n, x, y = list(map(int, input().split()))
edges = defaultdict(lambda: [])
for i in range(1, n):
edges[i].append(i+1)
edges[i+1].append(i)
edges[x].append(y)
edges[y].append(x)
# 幅優先
counter = [0 for i in range(n)]
for i in range(1, n+1):
d = deque()
... | from collections import deque, defaultdict
n, x, y = list(map(int, input().split()))
edges = defaultdict(lambda: [])
for i in range(1, n):
edges[i].append(i+1)
edges[i+1].append(i)
edges[x].append(y)
edges[y].append(x)
# 幅優先
counter = [0 for i in range(n)]
for i in range(1, n+1):
d = deque(... | p02726 |
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
D = [0] * N
for i in range(N):
for j in range(i, N):
m = min(abs(j - i), abs(i - X) + 1 + abs(j - Y), abs(i - Y) + 1 + abs(j - X))
D[m] += 1
for v in D[1:N]:
print(v) | N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
D = [0] * N
for i in range(N):
for j in range(i + 1, N):
m = min(abs(j - i), abs(i - X) + 1 + abs(j - Y))
D[m] += 1
for v in D[1:N]:
print(v) | p02726 |
from collections import defaultdict
import heapq
def dijkstra(n, s, edges, count):
dist = [float('inf') for _ in range(n)]
dist[s] = 0
q = []
heapq.heappush(q, (0, s))
while len(q):
d, p = heapq.heappop(q)
if s < p:
count[d] += 1
if dist[p] < d:
... | def submit():
n, x, y = list(map(int, input().split()))
count = {i: 0 for i in range(1, n)}
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
# i, j <= X, or Y <= i, j
if (i <= x and j <= x) or (x <= i and y <= j):
d = j - i
... | p02726 |
from sys import stdin
from collections import deque
def get_adj_list(num_nodes, data, undirected=True):
# adj_list ex) {1:[2,3,4], 2:[1,4,5], 3:[1,4], 4:[1,2,3,5], 5:[2,4]}
graph = {}
for i in range(num_nodes):
graph[i+1] = []
for val in data:
x, y = val
graph[x] = g... | # from sys import stdin
# # 解説のコード
# def get_result(data):
# N, X, Y = data
# dist_cnt = [0 for i in range(N)]
# for i in range(1, N+1):
# for j in range(i+1, N+1):
# min_dist = min([j-i, abs(X-i) + 1 + abs(Y-j), abs(Y-i) + 1 + abs(X-j)])
# dist_cnt[min_dist] += 1
... | p02726 |
# from sys import stdin
# # 解説のコード
# def get_result(data):
# N, X, Y = data
# dist_cnt = [0 for i in range(N)]
# for i in range(1, N+1):
# for j in range(i+1, N+1):
# min_dist = min([j-i, abs(X-i) + 1 + abs(Y-j), abs(Y-i) + 1 + abs(X-j)])
# dist_cnt[min_dist] += 1
... | from sys import stdin
from collections import deque
# 重みなしグラフの隣接リスト
# 0-indexed nodes
def get_adj_list(num_nodes, data, undirected=True):
graph = [[] for _ in range(num_nodes)]
for val in data:
x, y = val
graph[x-1].append(y-1)
if undirected:
graph[y-1].append(x... | p02726 |
from sys import stdin
from heapq import heappush, heappop
class Dijkstra:
def __init__(self, num_nodes):
self.n = num_nodes
# 隣接行列 d[u][v]: uからvへのコスト
self.adj_matrix = [[float("inf")]*self.n for i in range(self.n)]
# Edge数分回すことを想定
def add_edge(self, start, end, weight=1... | # from sys import stdin
# # 解説のコード
# def get_result(data):
# N, X, Y = data
# dist_cnt = [0 for i in range(N)]
# for i in range(1, N+1):
# for j in range(i+1, N+1):
# min_dist = min([j-i, abs(X-i) + 1 + abs(Y-j), abs(Y-i) + 1 + abs(X-j)])
# dist_cnt[min_dist] += 1
... | p02726 |
N, X, Y = list(map(int, input().split()))
l = []
for i in range(1, N):
for j in range(i+1, N+1):
s = j -i
if 0 < i < Y:
ss = abs(j - Y) + abs(X - i) + 1
l.append(min(s, ss))
elif i >= Y:
l.append(s)
for i in range(1, N):
print((l.count(i))) | N, X, Y = list(map(int, input().split()))
l = [0] * (N-1)
for i in range(1, N):
for j in range(i+1, N+1):
s = j -i
if 0 < i < Y:
ss = abs(j - Y) + abs(X - i) + 1
l[min(s, ss)-1] += 1
elif i >= Y:
l[s-1] += 1
for i in range(N-1):
print((l[i]... | p02726 |
n,x,y=list(map(int, input().split()))
dist=[]
for i in range(1,n+1):
for j in range(i+1,n+1):
dist.append(min(j-i,abs(j-y)+1+abs(i-x)))
for i in range(1,n):
print((dist.count(i))) | n,x,y=list(map(int, input().split()))
dist=[0]*(n+1)
for i in range(1,n+1):
for j in range(i+1,n+1):
dist[min(j-i,abs(j-y)+1+abs(i-x))]+=1
for i in range(1,n):
print((dist[i])) | p02726 |
from collections import deque
n,x,y = list(map(int,input().split()))
x,y = x-1 ,y-1
g = [[float('inf')]*n for _ in range(n)]
for i in range(n):
que = deque([(i, 0)])
while que:
node, cost = que.popleft()
if g[i][node]!=float('inf'):
continue
else:
g[i][... | from collections import deque
def main():
n,x,y = list(map(int,input().split()))
cnt = [0]*n
for i in range(n):
d = [float('inf')]*n
que = deque([(i, 0)])
while que:
idx, c = que.popleft()
if d[idx]!=float('inf'):
d[idx] = min(d[idx],... | p02726 |
def wf(d):
N = len(d)
for k in range(N):
for j in range(N):
for i in range(N):
d[j][i] = min(d[j][i], d[j][k] + d[k][i])
return d
N, x, y = list(map(int, input().split()))
x -= 1
y -= 1
d = [[float('inf') for _ in range(N)] for _ in range(N)]
for i in ran... | N, x, y = list(map(int, input().split()))
cnt = {n: 0 for n in range(1, N)}
for i in range(1, N + 1):
for j in range(i+1, N + 1):
d1 = abs(i - j)
d2 = 1 + min(abs(x - i) + abs(y - j), abs(x - j) + abs(y - i))
cnt[min(d1, d2)] += 1
for k in range(1, N):
print((cnt[k]))
| p02726 |
from collections import deque
import sys
input = sys.stdin.readline
n,x,y = list(map(int,input().split()))
to = [[] for _ in range(n)]
for i in range(n-1):
to[i].append(i+1)
to[i+1].append(i)
x -= 1
y -= 1
to[x].append(y)
to[y].append(x)
ans = [0]*(n-1)
d = {}
Q = deque()
flag = [False]*n
for ... | n,x,y = list(map(int,input().split()))
ans = [0]*(n-1)
x -= 1
y -= 1
for i in range(n-1):
for j in range(i+1,n):
dist = min(j-i,abs(x-i)+1+abs(j-y),abs(y-i)+1+abs(j-x))
ans[dist-1] += 1
print(("\n".join(map(str,ans)))) | p02726 |
N, X, Y = map(int, input().split())
ans = [0]*N
for i in range(1,N+1):
for j in range(i+1,N+1):
d = min(j-i,abs(i-X)+abs(j-Y)+1)
#print(i,j,d)
ans[d]+=1
print(*ans[1:], sep='\n')
| def solve():
N, X, Y = map(int, input().split())
ans = [0]*(N)
for i in range(1,N):
for j in range(i+1,N+1):
ans[min(abs(X-i)+abs(Y-j)+1,abs(j-i))] += 1
return ans[1:]
print(*solve(),sep='\n')
| p02726 |
N,X,Y = list(map(int,input().split()))
g = [[] for _ in range(N+1)]
for i in range(1,N):
g[i].append(i+1)
g[i+1].append(i)
g[X].append(Y)
g[Y].append(X)
from collections import deque
def bfs(u):
queue = deque([u])
d = [None]*(N+1)
d[u]=0
while queue:
v = queue.popleft()
... | N,X,Y = list(map(int,input().split()))
g = [[] for _ in range(N+1)]
for i in range(1,N+1):
if i != 1:
g[i].append(i-1)
if i != N:
g[i].append(i+1)
g[X].append(Y)
g[Y].append(X)
from collections import deque
answer = [0]*(N+1)
for i in range(1,N+1):
q = deque([i])
d = [None]*... | p02726 |
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans = [0] * n
for j in range(n):
for i in range(j):
d = min(j-i, abs(x-i)+1+abs(j-y))
ans[d] += 1
print(( "\n".join( [str(d) for d in ans[1:]] )))
| n,x,y = list(map(int, input().split()))
x -= 1
y -= 1
ans = [0] * (n-1)
for j in range(n):
for i in range(j):
ans[min(j-i, abs(x-i)+1+abs(j-y)) - 1] += 1
print(("\n".join([str(d) for d in ans]))) | p02726 |
n, x, y = list(map(int,input().split()))
x, y = x-1, y-1
d=[0 for i in range(n)]
for i in range(n):
for j in range(n):
m = min(abs(i-j), abs(x-i)+abs(y-j)+1, abs(x-j)+abs(y-i)+1)
d[m] += 1
for i in range(n-1):
print((d[i+1]//2)) | n, x, y = list(map(int,input().split()))
x, y = x-1, y-1
d=[0 for i in range(n)]
for i in range(n):
for j in range(i+1,n):
m = min(abs(i-j), abs(x-i)+abs(y-j)+1, abs(x-j)+abs(y-i)+1)
d[m] += 1
for i in range(n-1):
print((d[i+1])) | p02726 |
n,x,y=list(map(int,input().split()))
a=[0]*n
z=y-x-1
for i in range(1,n):
for j in range(i+1,n+1):
p=min(j-i,abs(i-x)+1+abs(j-y))
a[p]+=1
for k in a[1:]:
print(k)
| n,x,y=list(map(int,input().split()))
a=[0]*n
for i in range(1,n):
for j in range(i+1,n+1):
a[min(j-i,abs(i-x)+1+abs(j-y))]+=1
for k in a[1:]:
print(k)
| p02726 |
N, X, Y = list(map(int,input().split()))
X -= 1
Y -= 1
out = [0]*N
for i in range(N-1):
for j in range(i+1,N):
out[min(j-i, abs(i-X)+1+abs(j-Y))] += 1
for i in range(1,N):
print((out[i])) | N, X, Y = list(map(int,input().split()))
X -= 1
Y -= 1
out = [0]*N #最低距離が1からNまでの個数を表示するリストを作る
for i in range(N-1):
for j in range(i+1,N):
out[min(j-i, abs(i-X)+1+abs(j-Y))] += 1 #各最低距離の個数カウント
for i in range(1,N):
print((out[i])) | p02726 |
INF = float('inf')
from heapq import *
from collections import defaultdict
N,X,Y = list(map(int,input().split()))
X -= 1
Y -= 1
cost_pri = defaultdict(list)
for i in range(N-1):
cost_pri[i].append((i+1,1))
cost_pri[i+1].append((i,1))
cost_pri[X].append((Y,1))
cost_pri[Y].append((X,1))
ans = [0]*(N... | from heapq import *
from collections import defaultdict
N,X,Y = list(map(int,input().split()))
X -= 1
Y -= 1
cost_pri = defaultdict(list)
for i in range(N-1):
cost_pri[i].append((i+1,1))
cost_pri[i+1].append((i,1))
cost_pri[X].append((Y,1))
cost_pri[Y].append((X,1))
ans = [0]*(N-1)
for s in range(... | p02726 |
from queue import Queue
def bfs(target, graph, ans):
visited = [False]*len(graph)
que = Queue()
que.put(target)
visited[target] = True
distance = [0]*len(graph)
while not que.empty():
root = que.get()
for dst in graph[root]:
if visited[dst] is False:
... | n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
dist = [0]*(n-1)
for start in range(n):
for end in range(start+1, n):
dst = min(end-start, abs(x-start) + abs(end-y) + 1)
dist[dst-1] += 1
for d in dist:
print(d) | p02726 |
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
k = [0 for _ in range(n)]
for i in range(n):
for j in range(i + 1, n):
dist = min([j-i, abs(x-i)+1+abs(j-y), abs(y-i)+1+abs(j-x)])
if dist < n:
k[dist] += 1
for i in range(1, len(k)):
print((k[i]))
| n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
k = [0 for _ in range(n)]
for i in range(n):
for j in range(i + 1, n):
dist = min(j-i, abs(x-i)+1+abs(j-y))
if dist < n:
k[dist] += 1
for i in range(1, len(k)):
print((k[i]))
| p02726 |
"""
"""
n,x,y=list(map(int,input().split()))
k_mins=[]
for i in range(1,n):
for j in range(i+1,n+1):
k_mins.append(min(j-i,abs(x-i)+1+abs(y-j),abs(x-j)+1+abs(y-i)))
ret=[]
k_mins.sort(reverse=True)
for i in range(1,n):
c=0
while len(k_mins) > 0 and k_mins[len(k_mins)-1]==i:
k_min... | """
"""
n,x,y=list(map(int,input().split()))
ret=[0]*(n-1)
for i in range(1,n):
for j in range(i+1,n+1):
ret[min(j-i,abs(x-i)+1+abs(y-j),abs(x-j)+1+abs(y-i))-1]+=1
for r in ret:
print(r)
| p02726 |
from collections import deque
n,x,y = [int(x) for x in input().split()]
l = [[] for i in range(n+1)]
p = []
q = []
l[1].append(2)
for i in range(2,n):
l[i].append(i+1)
l[i].append(i-1)
l[n].append(n-1)
l[x].append(y)
l[y].append(x)
clist = [0]*(n+1)
#ここまでで、グラフが隣接リスト表記で表される
for k in range(1,n+1):
... | n,x,y = [int(x) for x in input().split()]
count = [0]*(n+1)
for i in range(1,n):
for j in range(i+1,n+1):
if i < x and j <= x:
nagasa = j - i
elif i < x and x < j and j < y:
nagasa = x-i + min(j-x,y-j+1)
elif i < x and y <= j:
nagasa = x-i + j - y... | p02726 |
from collections import deque, defaultdict
N, X, Y = list(map(int, input().split()))
# 全探索でいけるのでは？
# 有向グラフとしてN回幅優先すれば良いのでは？
tree = [[] for _ in range(N)]
for i in range(N-1):
tree[i].append(i+1)
tree[i+1].append(i)
tree[X-1].append(Y-1)
tree[Y-1].append(X-1)
ans = defaultdict(int)
q = deque()
# 更新... | from collections import deque, defaultdict
N, X, Y = list(map(int, input().split()))
# 全探索でいけるのでは？
# 有向グラフとしてN回幅優先すれば良いのでは？
tree = [[] for _ in range(N)]
for i in range(N-1):
tree[i].append(i+1)
tree[i+1].append(i)
tree[X-1].append(Y-1)
tree[Y-1].append(X-1)
ans = defaultdict(int)
q = deque()
# 更新... | p02726 |
import heapq
INF = float('inf')
class Edge():
def __init__(self, a, b, cost):
self.a = a
self.b = b
self.cost = cost
def __str__(self):
return 'Edge: {} -> {}, cost {}'.format(self.a, self.b, self.cost)
def dijkstra(n, G, s):
dist = [INF] * n
dist[s] = 0
... | import heapq
INF = float('inf')
def dijkstra(n, G, s):
dist = [INF] * n
dist[s] = 0
h = []
heapq.heappush(h, (0, s))
while h:
# 使っていない頂点のうち、現時点で最も距離の近いものを選びvとする
d, v = heapq.heappop(h)
if dist[v] < d:
continue
# vから到達可能な頂点について、距離が短くなれば更新
... | p02726 |
# coding: utf-8
DATA = """
10 4 8
""".split("\n")
def get_debug_line():
for i in DATA:
yield i
if 1:
get_line = input
else:
get_line = get_debug_line().__next__
get_line()
N, X, Y = [int(i) for i in get_line().strip().split(" ")]
X-=1
Y-=1
INF = 10 * 20
m = [[0] * N for _ in range(N)]
tt = ... | # coding: utf-8
DATA = """
10 4 8
""".split("\n")
def get_debug_line():
for i in DATA:
yield i
if 1:
get_line = input
else:
get_line = get_debug_line().__next__
get_line()
N, X, Y = [int(i) for i in get_line().strip().split(" ")]
X-=1
Y-=1
INF = 10 * 20
m = [[0] * N for _ in range(N)]
tt = ... | p02726 |
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
import heapq
n,x,y = list(map(int,input().split()))
G = [[]*n for i in range(n)]
for i in range(n... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
import heapq
n,x,y = list(map(int,input().split()))
G = [[]*n for i in range(n)]
for i in range(n... | p02726 |
#abc160 d
from collections import deque
import itertools
n,x,y=list(map(int,input().split()))
g=[[False]*n for _ in range(n)]
for i in range(n-1):
g[i][i+1]=True
g[i+1][i]=True
g[x-1][y-1]=True
g[y-1][x-1]=True
def bfs(s,e):
color=[False]*n
dis=[0]*n
q=deque()
q.append(s-1)
... | n,x,y=list(map(int,input().split()))
x,y=x-1,y-1
ans=[0]*(n+1)
for i in range(n):
for j in range(i+1,n):
a=abs(i-j)
b=abs(i-x)+1+abs(y-j)
c=abs(y-i)+1+abs(x-j)
ans[min(a,b,c)]+=1
for i in range(1,n):
print((ans[i]))
| p02726 |
N, x, y = list(map(int, input().split()))
INF = 10 ** 100
adj_mtx = [ [INF] * (N+1) for _ in range(N+1) ]
for i in range(1, N+1):
if i != N:
adj_mtx[i][i] = 0
adj_mtx[i][i+1] = 1
adj_mtx[i+1][i] = 1
adj_mtx[x][y] = 1
adj_mtx[y][x] = 1
for k in range(1, N+1):
for i in range(1, N+1):
f... | N, X, Y = list(map(int, input().split()))
result = [0] * N
for i in range(1, N):
for j in range(i+1, N+1):
step = min( j-i, abs(i-X)+1+abs(j-Y), abs(i-Y)+1+abs(j-X))
result[step] += 1
for e in result[1:]: print(e) | p02726 |
N, X, Y= list(map(int, input().split()))
Count = []
for i in range(N-1):
Count.append(0)
for k in range(1, N):
for i in range(1, N):
for j in range(i+1, N+1):
if (j-i > k) & ((abs(i-X) +abs(j-Y) +1)>k) & ((abs(i-X) +abs(j+1-Y) +1 )>(abs(i-X) +abs(j-Y) +1)>k):
break
if j-i <= (a... | N, X, Y= list(map(int, input().split()))
Count = [0]*(N-1)
for i in range(1, N):
for j in range(i+1, N+1):
Count[min(j-i, (abs(i-X) +abs(j-Y) +1), (abs(i-Y) +abs(j-X) +1))-1] += 1
for i in range(N-1):
print((Count[i])) | p02726 |
n,x,y = list(map(int, input().split()))
ans = [0]*n
for i in range(n):
for j in range(1,n-i):
d = min(j, abs(x-1-i)+abs(y-1-(i+j))+1, abs(x-1-(i+j))+abs(y-1-i)+1)
ans[d] += 1
for m in range(1,n):
print((ans[m])) | n,x,y = list(map(int, input().split()))
ans = [0]*(n-1)
for i in range(n):
for j in range(1,n-i):
d = min(j, abs(x-1-i)+abs(y-1-(i+j))+1)
ans[d-1] += 1
for m in range(n-1):
print((ans[m])) | p02726 |
import itertools
import collections
N, X, Y = list(map(int, input().split()))
pos = [i for i in range(1,N+1)]
ways = list(itertools.combinations(pos,2))
dist_l = [min(abs(i-j), abs(i - X) + 1 + abs(Y - j)) for i,j in ways]
dic = collections.Counter(dist_l)
for i in range(1,N):
print((dic[i])) | N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
dist_l = [0] * N
for i in range(N):
for j in range(i+1,N):
dist_l[min(j-i, abs(i - X) + 1 + abs(Y - j))] += 1
for i in range(1,N):
print((dist_l[i])) | p02726 |
n,x,y = list(map(int,input().split()))
ans = [0 for i in range(n)]
for i in range(n):
for j in range(i,n):
p= min(abs(i-j),(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))
ans[p] += 1
for i in range(1,n):
print((ans[i]))
| n,x,y = list(map(int,input().split()))
ans = [0 for i in range(n)]
for i in range(n):
for j in range(i,n):
ans[min(abs(i-j),(abs(i-(x-1))+1+abs(y-1-j)),(abs(i-(x-1))+1+abs(y-1-j)))] += 1
for i in range(1,n):
print((ans[i]))
| p02726 |
N, X, Y = list(map(int, input().split()))
dis = []
for i in range(1, N):
for j in range(i + 1, N + 1):
d = min(abs(i - j),
abs(i - X) + 1 + abs(j - Y),
abs(i - Y) + 1 + abs(j - X))
dis.append(d)
for k in range(1, N):
print((dis.count(k))) | N, X, Y = list(map(int, input().split()))
dis = [0 for _ in range(N)]
for i in range(1, N):
for j in range(i + 1, N + 1):
d = min(abs(i - j),
abs(i - X) + 1 + abs(j - Y),
abs(i - Y) + 1 + abs(j - X))
dis[d] += 1
for k in range(1, N):
print((dis[k])) | p02726 |
def warshallFloyd(n,l):
for k in range(n):
for i in range(n):
for j in range(n):
l[i][j]=min(l[i][j],l[i][k]+l[k][j])
return l
n,x,y=list(map(int,input().split()))
l=[[float('inf') for i in range(n)] for i in range(n)]
for i in range(n):
l[i][i]=0
for i in r... | n,x,y=list(map(int,input().split()))
ans=[0]*n
for i in range(1,n):
for j in range(i+1,n+1):
distance=min(j-i,abs(x-i)+1+abs(j-y))
ans[distance]+=1
for i in range(1,n):
print((ans[i])) | p02726 |
n,x,y = map(int,input().split())
ans = [0]*(n-1)
for i in range(n):
tbl = [0]*n
for j in range(i,n):
tbl[j] = min(abs(j+1-i-1),abs(i+1-x)+1+abs(j+1-y))
for i in range(1,n):
ans[i-1] += tbl.count(i)
[print(i) for i in ans]
| n,x,y = map(int,input().split())
ans = [0]*(n)
for i in range(n):
tbl = [0]*n
for j in range(i,n):
tbl[j] = min(abs(j+1-i-1),abs(i+1-x)+1+abs(j+1-y))
ans[tbl[j]] += 1
[print(i) for i in ans[1:]]
| p02726 |
N, X, Y = [int(n) for n in input().split(" ")]
X = X - 1
Y = Y - 1
D = {}
for i in range(N):
D[i] = []
for i in range(N):
if i != N - 1:
D[i].append(i + 1)
if i != 0:
D[i].append(i - 1)
else:
D[i].append(i - 1)
D[X].append(Y)
D[Y].append(X)
def ... |
def search(start, N, X, Y):
dist = [0 for _ in range(N)]
if start <= X:
for i in range(X):
dist[i] = abs(start - i)
for i in range(Y, N):
dist[i] = (X - start) + 1 + (i - Y)
for i in range(X, (Y - X) // 2 + X + 1):
dist[i] = (i - start)
... | p02726 |
import unittest
class TestD(unittest.TestCase):
def test_1(self):
self.assertEqual(think(5, 2, 4), [5, 4, 1, 0])
def test_2(self):
self.assertEqual(think(3, 1, 3), [3, 0])
def test_3(self):
self.assertEqual(think(7, 3, 7), [7, 8, 4, 2, 0, 0])
def test_4(self):
... | import unittest
class TestD(unittest.TestCase):
def test_1(self):
self.assertEqual(think(5, 2, 4), [5, 4, 1, 0])
def test_2(self):
self.assertEqual(think(3, 1, 3), [3, 0])
def test_3(self):
self.assertEqual(think(7, 3, 7), [7, 8, 4, 2, 0, 0])
def test_4(self):
... | p02726 |
n,x,y = list(map(int,input().split()))
ans=[0]*n
for i in range(1,n):
for j in range(i+1,n+1):
ans[min(abs(i-j),min(abs(i-x)+1+abs(j-y),abs(i-y)+1+abs(j-x)))]+=1
for i in range(1,n):
print((ans[i])) | n,x,y = list(map(int,input().split()))
ans=[0]*n
for i in range(1,n):
for j in range(i+1,n+1):
ans[min(j-i,abs(i-x)+1+abs(j-y))]+=1
for i in range(1,n):
print((ans[i])) | p02726 |
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
cnt = [0] * n
for i in range(n):
for j in range(n):
if i >= j:
continue
dist = min(j - i, abs(j - y) + 1 + abs(i - x), abs(j - x) + 1 + abs(i - y))
cnt[dist] += 1
for i in range(1, n):
print((cnt[i]))
| n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
cnt = [0] * n
dist = []
for i in range(n):
dist.append([-1] * n)
for i in range(n):
dist[i][x] = abs(i-x)
dist[i][y] = abs(i-y)
dist[x][i] = abs(i-x)
dist[y][i] = abs(i-y)
for i in range(n):
for j in range(n):
if... | p02726 |
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
cnt = [0] * n
dist = []
for i in range(n):
dist.append([-1] * n)
for i in range(n):
dist[i][x] = abs(i-x)
dist[i][y] = abs(i-y)
dist[x][i] = abs(i-x)
dist[y][i] = abs(i-y)
for i in range(n):
for j in range(n):
if... | n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
cnt = [0] * n
for i in range(n):
for j in range(i+1, n):
cnt[min(j - i, abs(i-x) + 1 + abs(y-j))] += 1
for i in range(1, n):
print((cnt[i]))
| p02726 |
n,x,y=list(map(int,input().split()))
from collections import deque
from collections import Counter
def bfs(i): # i番目の頂点を起点にしたbfs
visited=[0]*n
visited[i]=1
que=deque([])
que.append((i,1))
while len(que)>0:
di,c=que.popleft()
nm=di-1
np=di+1
no=-1... | n,x,y=list(map(int,input().split()))
ans=[0]*(n-1)
for i in range(n-1):
for j in range(i+1,n):
ans[min(abs(i-j),abs(i-x+1)+1+abs(j-y+1))-1]+=1
for i in range(n-1):
print((ans[i])) | p02726 |
import itertools
from collections import Counter
N, X, Y = list(map(int, input().split()))
n_iter = itertools.combinations(list(range(1,N+1)), 2)
count_list = []
for i, j in n_iter:
#1. abs(X - i) + abs(Y - j) + 1
#2. abs(Y - i) + abs(X - j) + 1
#3. abs(j - i)
x = min(
abs(X - i) + abs(Y -... | import itertools
N, X, Y = list(map(int, input().split()))
n_iter = itertools.combinations(list(range(1,N+1)), 2)
count_list = [0]*(N-1)
for i, j in n_iter:
#1. abs(X - i) + abs(Y - j) + 1
#2. abs(Y - i) + abs(X - j) + 1
#3. abs(j - i)
x = min(
abs(X - i) + abs(Y - j) + 1,
abs(Y - i) +... | p02726 |
N, X, Y = list(map(int, input().split()))
INF = 1 << 30
dis = [ [abs(i-j) if abs(i-j) < 2 else INF for i in range(N)] for j in range(N)]
dis[X-1][Y-1] = 1
dis[Y-1][X-1] = 1
for k in range(N):
for i in range(N):
for j in range(N): dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j])
for i in range(1, N)... | N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
ans = [0] * (N-1)
for i in range(N):
for j in range(i+1, N):
ans[min(j-i, abs(X-i)+1+abs(Y-j))-1] += 1
for x in ans: print(x)
| p02726 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.