input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n,x,y = list(map(int, input().split()))
list =[]
for i in range(n):
for j in range(i):
b = i+1
a = j+1
if a<=x and b>=y:
list.append(b-y+x-a+1)
elif a>x and b>=y:
d =min(a-x+1,y-a)
list.append(d+b-y)
elif a<=x and b<y:
d =min(b-x,y-b+1)
list.append(x-a+... | n,x,y=list(map(int,input().split()))
ans=[0]*n
list =[]
for i in range(n):
for j in range(i):
b = i+1
a = j+1
if a<=x and b>=y:
k =b-y+x-a+1
elif a>x and b>=y:
d =min(a-x+1,y-a)
k =d+b-y
elif a<=x and b<y:
d =min(b-x,y-b+1)
k =x-a+d
elif a>x a... | p02726 |
N,X,Y = list(map(int,input().split()))
data = [[3000]*N for _ in range(N)]
for i in range(N-1):
data[i][i+1] = 1
data[i+1][i] = 1
data[i][i] = 0
data[0][0] = 0
data[X-1][Y-1] = 1
data[Y-1][X-1] = 1
for k in range(N):
for i in range(N):
for j in range(N):
data[i][j] = min(data[i][j],data[i]... | N,X,Y = list(map(int,input().split()))
a = [0]*(N-1)
for i in range(1,N):
for j in range(i+1,N+1):
ans = min(j-i,abs(X-i)+1+abs(Y-j),abs(X-j)+1+abs(Y-i))
a[ans -1] += 1
for item in a:
print(item) | p02726 |
import heapq
import sys
from collections import defaultdict
input = sys.stdin.readline
def dijkstra_heap(s,edge,n):
#始点sから各頂点への最短距離
d = [10**20] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
heapq.heappush(edgelist,a*(10**6... | def main():
N, X, Y = list(map(int, input().split()))
tree = [[float('inf')] * N for _ in range(N)]
ans = [0] * (N + 1)
X -= 1
Y -= 1
for i in range(N):
for j in range(i,N):
dist = min(j - i, abs(X - i) + 1 + abs(Y - j))
ans[dist] += 1
for i in ran... | p02726 |
N, X, Y = list(map(int, input().split(" ")))
counts = [0 for i in range(N-1)]
distances = [[] for i in range(N-1)]
for i in range(N):
for j in range(i+1, N):
dis = j-i
if i <= X-1 :
if j >= Y-1:
dis -= Y-X-1
elif j < Y-1:
dis =... | N, X, Y = list(map(int, input().split(" ")))
counts = [0 for i in range(N-1)]
for i in range(N):
for j in range(i+1, N):
if i <= X-1 :
if j >= Y-1:
dis = j-i -(Y-X-1)
elif j < Y-1:
dis = min([j-i, (X-1)-i+1+abs(j-(Y-1))])
... | p02726 |
from collections import deque
infty = 10 ** 4
def BFS(G, D, u):
queue = deque()
queue.append(u)
visit = [False for k in range(len(D))]
d = 0
L = 1
visit[i] = True
while queue:
add_v = 0
while L > 0:
v = queue.popleft()
D[v] = d
... | N, X, Y = list(map(int, input().split()))
count = [0 for i in range(N)]
dist = [[-1 for j in range(N)] for i in range(N)]
for i in range(N):
for j in range(i + 1, N):
dist[i][j] = min(abs(j - i), abs(X - 1 - i) + 1 + abs(Y - 1 - j))
for i in range(N):
for j in range(i + 1, N):
count[dist... | p02726 |
import heapq
import sys
def main():
input = sys.stdin.readline
def dijkstra(s,edge):
#始点sから各頂点への最短距離
d = [10**20] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
heapq.heappush(edgelist,a... | import heapq
import sys
input = sys.stdin.readline
def dijkstra(s,edge):
#始点sから各頂点への最短距離
d = [10**20] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
heapq.heappush(edgelist,a*(10**6)+b)
while len(edgelist):
mine... | p02726 |
import heapq
import sys
input = sys.stdin.readline
def dijkstra(s,edge):
#始点sから各頂点への最短距離
d = [10**20] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
heapq.heappush(edgelist,a*(10**6)+b)
while len(edgelist):
mine... | import heapq
import sys
def main():
input = sys.stdin.readline
def dijkstra(s,edge):
#始点sから各頂点への最短距離
d = [10**20] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
heapq.heappush(edgelist,a... | p02726 |
INT = lambda: int(eval(input()))
INTM = lambda: list(map(int,input().split()))
STRM = lambda: list(map(str,input().split()))
STR = lambda: str(eval(input()))
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
n,x,y=INTM()
z=y-x
sc=y-x-1
loop=... | INT = lambda: int(eval(input()))
INTM = lambda: list(map(int,input().split()))
STRM = lambda: list(map(str,input().split()))
STR = lambda: str(eval(input()))
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
n,x,y=INTM()
z=y-x
sc=y-x-1
loop=... | p02726 |
n, x, y = list(map(int, input().split()))
ans = [0 for i in range(n-1)]
for i in range(n-1):
for j in range(i+1, n):
k = i + 1
l = j + 1
a = l - k
b_1 = k - x
b_2 = l - y
c_1 = k - y
c_2 = l - x
if b_1 < 0:
b_1 = - b_1
if b_2 < 0:
b_2 = - b_2
if c_1 <... | n, x, y = list(map(int, input().split()))
ans = [0 for i in range(n-1)]
for i in range(n-1):
k = i + 1
b_1 = k - x
c_1 = k - y
if b_1 < 0:
b_1 = - b_1
if c_1 < 0:
c_1 = - c_1
for j in range(i+1, n):
l = j + 1
a = l - k
b_2 = l - y
c_2 = l - x
if b_2 < 0:
... | p02726 |
n, x, y = list(map(int, input().split()))
ans = [0 for i in range(n-1)]
for i in range(n-1):
k = i + 1
b_1 = k - x
if b_1 < 0:
b_1 = - b_1
for j in range(i+1, n):
l = j + 1
a = l - k
b_2 = l - y
if b_2 < 0:
b_2 = - b_2
b = b_1 + b_2 + 1
if b < a:
a = b
... | n, x, y = list(map(int, input().split()))
ans = [0 for i in range(n-1)]
for i in range(n-1):
k = i + 1
b_1 = k - x
for j in range(i+1, n):
l = j + 1
a = l - k
b = abs(k - x) + abs(l - y) + 1
if b < a:
a = b
ans[a-1] += 1
for i in range(n-1):
print((ans[i])) | p02726 |
n, x, y = list(map(int, input().split()))
ans = [0 for i in range(n-1)]
for i in range(n-1):
k = i + 1
b_1 = k - x
for j in range(i+1, n):
l = j + 1
a = l - k
b = abs(k - x) + abs(l - y) + 1
if b < a:
a = b
ans[a-1] += 1
for i in range(n-1):
print((ans[i])) | n, x, y = list(map(int, input().split()))
ans = [0 for i in range(n-1)]
for i in range(n-1):
k = i + 1
b_1 = k - x
for j in range(i+1, n):
l = j + 1
a = l - k
b = abs(k - x) + abs(l - y) + 1
if b < a:
ans[b-1] += 1
else:
ans[a-1] += 1
for i in range(n-1):
print((ans... | p02726 |
[N, X, Y] = [int(item) for item in input().split()]
X -= 1
Y -= 1
array=[[-1 for _ in range(N)]for _ in range(N)]
for i in range(N):
for j in range(i,N):
array[i][j]=min(abs(i-j),abs(i-X)+1+abs(Y-j),abs(i-Y)+1+abs(X-j))
#print(array)
count=[0 for _ in range(N)]
for i in range(N):
for j in ra... | [N, X, Y] = [int(item) for item in input().split()]
X -= 1
Y -= 1
count=[0 for _ in range(N)]
for i in range(N):
for j in range(i,N):
count[min(abs(i-j),abs(i-X)+1+abs(Y-j),abs(i-Y)+1+abs(X-j))]+=1
#print(array)
for i in range(1,N):
print((count[i]))
#print(count) | p02726 |
n,x,y = list(map(int,input().split()))
mn_ln = [[0 for _ in range(n-1)] for _ in range(n)]
dic = {}
x = x-1
y = y-1
for i in range(n):
for j in range(n):
if(i == j):
break
nm = abs(j - i)
if(abs(x-i) > abs(y-i)):
lp = abs(y-i) + abs(x-j) + 1
... | n,x,y = list(map(int,input().split()))
dic = {}
x = x-1
y = y-1
for i in range(n):
for j in range(n):
if(i == j):
break
nm = abs(j - i)
if(abs(x-i) > abs(y-i)):
lp = abs(y-i) + abs(x-j) + 1
else:
lp = abs(x-i) + abs(y-j) + 1
... | p02726 |
# coding: utf-8
# Your code here!
#保存
import heapq
import sys
import itertools
sys.setrecursionlimit(10**7)
def bfs(cost,node):
root[node]=min(root[node],cost)
visited[node]=1
for next_n in way[node]:
if visited[next_n]==0:
heapq.heappush(q,[cost+1,next_n])
return... | # coding: utf-8
# Your code here!
N,X,Y=list(map(int,input().split()))
X-=1
Y-=1
ans=[0]*N
for n in range(N-1):
for tgt in range(n+1,N):
temp=min(abs(tgt-n),abs(n-X)+abs(Y-tgt)+1)
#print(n,tgt,temp)
ans[temp]+=1
for a in ans[1:]:
print(a)
| p02726 |
INF = float('inf')
N, X, Y = list(map(int, input().split()))
G = [[0 if i == j else INF for j in range(N)] for i in range(N)]
for i in range(N-1):
G[i][i+1] = G[i+1][i] = 1
G[X-1][Y-1] = G[Y-1][X-1] = 1
for k in range(N):
for i in range(N):
for j in range(N):
G[i][j] = min(G[i][j], G[i][k] + G[k]... | N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
R = [0 for j in range(N)]
for i in range(N-1):
for j in range(N):
if j <= i:
continue
xd = abs(i - X)
yd = abs(j - Y)
dist = min(
j - i,
xd + yd + 1
)
R[dist] += 1
for r in R[1:]:
print(r) | p02726 |
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return list(map(int,input().split()))
def onem(): #Nとかの取得
return int(eval(input()))
def s(x): ... | import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return list(map(int,input().split()))
def onem(): #Nとかの取得
return int(eval(input()))
def s(x): ... | p02726 |
from collections import deque
n, x, y = list(map(int, input().split()))
inf = 100100100
x -= 1
y -= 1
ans = [0] * n
for i in range(n):
dist = [inf] * n
queue = deque()
queue.append(i)
dist[i] = 0
while queue:
current = queue.popleft()
d = dist[current]
... | from collections import deque, Counter
n, x, y = list(map(int, input().split()))
inf = 100100100
x -= 1
y -= 1
ans = [0] * n
for i in range(n):
dist = [inf] * n
queue = deque()
queue.append(i)
dist[i] = 0
while queue:
current = queue.popleft()
d = dist[current]
... | p02726 |
# D
# -*- coding: utf-8 -*-
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
ans_list = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N - 1):
for j in range(i + 1, N):
# ans_list[i][j] = min(abs(j - i), abs(X - i) + 1 + abs(j - Y))
ans_list[i][j] = min(abs(j - i), abs(X... | # D
# -*- coding: utf-8 -*-
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
ans_list = [0 for _ in range(N)]
for i in range(N - 1):
for j in range(i + 1, N):
ans_list[min(abs(j - i), abs(X - i) + 1 + abs(j - Y))] += 1
for i in range(1, N):
print((ans_list[i])) | p02726 |
n, x, y = [int(i) for i in input().split()]
ans = [0]*n
for i in range(n-1):
for j in range(i+1, n):
ans[min(j-i, abs(x-(i+1))+abs((j+1)-y)+1)] += 1
print(*ans[1:], sep='\n')
| n, x, y = [int(i) for i in input().split()]
ans = [0]*n
for i in range(1, n):
for j in range(i+1, n+1):
ans[min(j-i, abs(x-i)+abs(j-y)+1)] += 1
print(*ans[1:], sep='\n')
| p02726 |
import heapq
def set_heapq(que, edge, used, v, add_dist=0):
'''
確定地点vからつながる辺を全てqueに設定し、返却する
Parameters
que : heapque(touple or list)
辺を管理するキュー (距離、次の行き先)のtopuleまたはlistにて管理
edge : list
全ての辺を格納する二次元のリスト edge[0]にてノード0から伸びる辺であることを表し、
edge[0] → [距離、次の行き先] を表すlistが格納されてい... |
from itertools import combinations
from collections import Counter
N, X, Y = list(map(int, input().split()))
X, Y = X-1, Y-1
ans = []
for i, j in combinations(list(range(N)), 2):
ans.append(min(j-i, 1+abs(i-X)+abs(j-Y)))
c = Counter(ans)
for i in range(1,N):
print((c[i]))
| p02726 |
import sys
from itertools import combinations
from collections import Counter
N, X, Y = list(map(int, sys.stdin.readline().rstrip().split()))
nodes = list(range(1, N + 1))
distance_counter = Counter()
a = Y - X - 1
p = (Y - X) // 2 + X
ans = []
for i, j in combinations(nodes, 2):
if j - i == 1:
... | import sys
N, X, Y = list(map(int, sys.stdin.readline().rstrip().split()))
nodes = list(range(1, N + 1))
ans = [0] * N
for i in range(1, N):
for j in range(i + 2, N + 1):
distance = min(abs(X - i) + abs(Y - j) + 1, j - i)
ans[distance] += 1
for k in range(1, N):
if k == 1:
... | p02726 |
N,X,Y = list(map(int,input().split()))
ans = [0] * (N-1)
for i in range(1,N+1):
for j in range(1,N+1):
if i != j:
min_distance = min(abs(i-j), abs(i-X)+abs(j-Y)+1, abs(j-X)+abs(i-Y)+1)
ans[min_distance-1] += 1
for i in range(N-1):
print((int(ans[i]/2))) | N,X,Y = list(map(int,input().split()))
ans = [0] * (N-1)
for i in range(1,N):
for j in range(i+1,N+1):
min_distance = min(abs(i-j), abs(i-X)+abs(j-Y)+1, abs(j-X)+abs(i-Y)+1)
ans[min_distance-1] += 1
for i in range(N-1):
print((ans[i])) | p02726 |
n,x,y=list(map(int,input().split()))
ans=[[1000000]*n for i in range(n)]
for i in range(n-1):
for j in range(i+1,n):
ans[i][j]=min(j-i,abs(x-1-i)+1+abs(y-1-j))
_ans=[0]*(n-1)
for i in range(n-1):
for j in range(i+1,n):
_ans[ans[i][j]-1]+=1
for i in range(n-1):
print((_ans[i])) | 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])) | p02726 |
from collections import deque
n, x, y = list(map(int, input().split()))
graph = [[i-1,i+1] for i in range(n+1)]
graph[1]=[2]
graph[n]=[n-1]
graph[0]=[0]
graph[x].append(y)
graph[y].append(x)
def bfs(start,graph2):
dist = [-1] * (n+1)
dist[0] = 0
dist[start] = 0
d = deque()
d.a... | from collections import deque
n, x, y = list(map(int, input().split()))
graph = [[i-1,i+1] for i in range(n+1)]
graph[1]=[2]
graph[n]=[n-1]
graph[0]=[0]
graph[x].append(y)
graph[y].append(x)
def bfs(start,graph2):
dist = [-1] * (n+1)
dist[0] = 0
dist[start] = 0
d = deque()
d.a... | p02726 |
from collections import Counter
n,x,y = list(map(int, input().split()))
x -= 1
y -= 1
ans = [0]*n
dp = [[0]*n for _ in range(n)]
for i in range(n):
for j in range(n):
ans[min(abs(i-j),(abs(i-x)+abs(j-y)+1),(abs(i-y)+abs(j-x)+1))]+=1
for k in range(1,n):
print((ans[k]//2)) | from collections import Counter
n,x,y = list(map(int, input().split()))
x -= 1
y -= 1
ans = [0]*n
dp = [[0]*n for _ in range(n)]
for i in range(n):
for j in range(i,n):
ans[min(abs(i-j),(abs(i-x)+abs(j-y)+1),(abs(i-y)+abs(j-x)+1))]+=1
for k in range(1,n):
print((ans[k])) | p02726 |
import sys
input = lambda: sys.stdin.readline().rstrip()
from collections import deque
N,X,Y = list(map(int, input().split()))
edges = [[] for _ in range(N)]
for i in range(N-1):
edges[i].append(i+1)
edges[i+1].append(i)
edges[X-1].append(Y-1)
edges[Y-1].append(X-1)
ans = [0] * (N-1)
qu... | import sys
input = lambda: sys.stdin.readline().rstrip()
from collections import deque
N,X,Y = list(map(int, input().split()))
queue = deque()
edges = [[] for _ in range(N)]
for i in range(N-1):
edges[i].append(i+1)
edges[i+1].append(i)
edges[X-1].append(Y-1)
edges[Y-1].append(X-1)
ans = ... | p02726 |
"""
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools impo... | 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):
d = min(j - i, abs(X - i) + 1 + abs(Y - j))
ans[d] += 1
for i in range(1, N):
print((ans[i]))
| p02726 |
from collections import defaultdict, deque
N, X, Y = list(map(int, input().split()))
G = defaultdict(list)
for i in range(1, N):
G[i].append(i+1)
G[i+1].append(i)
#print(G)
G[X].append(Y)
G[Y].append(X)
#print(G)
d = [0] * N
for i in range(1, N+1):
q = deque()
q.append(i)
visit... | N, X, Y = list(map(int, input().split()))
d = [0] * N
for i in range(0, N-1):
for j in range(i+1, N):
k = min(j-i, abs(X-1-i) + 1 + abs(Y-1-j))
d[k] += 1
for i in range(1, N):
print((d[i]))
| p02726 |
import queue
N,X,Y=list(map(int,input().split()))
X -= 1
Y -= 1
INF = 1001001001
ans=[0]*N
def push(v, d):
if dist[v]!= INF:
return
dist[v]=d
q.put(v)
for sv in range(N):
q=queue.Queue()
dist=[INF]*N
push(sv,0)
while(not q.empty()):
v=q.get()
d=dist[v]
if v-1 >= 0:
... | import queue
N,X,Y=list(map(int,input().split()))
X-=1
Y-=1
ans=[0]*N
for i in range(N-1):
for j in range(i+1,N):
ans[min(j-i, abs(X-i)+1+abs(Y-j))]+=1
for i in range(1,N):
print((ans[i])) | p02726 |
import queue
N,X,Y=list(map(int,input().split()))
count=[0]*N
def bfs(start):
dist=[-1]*(N+1)#indexと頂点の番号を合わせる
q=queue.Queue()
q.put([start,0])
dist[start]=0
while not q.empty():
j,kyori=q.get()
if j-1>=1:
if dist[j-1]==-1:
q.put([j-1,kyo... | from collections import deque
N,X,Y=list(map(int,input().split()))
count=[0]*N
def bfs(start):
dist=[-1]*(N+1)#indexと頂点の番号を合わせる
q=deque()
q.append([start,0])
dist[start]=0
while q:
j,kyori=q.popleft()
if j-1>=1:
if dist[j-1]==-1:
q.append... | p02726 |
from collections import Counter, deque, defaultdict
n, x, y = list(map(int, input().split()))
v = defaultdict(list)
for i in range(n):
if i + 1 < n: v[i].append(i + 1)
if i - 1 >= 0: v[i].append(i - 1)
v[x - 1].append(y - 1)
v[y - 1].append(x - 1)
cnt = Counter()
for start in range(n):
dist ... | from collections import Counter, deque, defaultdict
def main():
n, x, y = list(map(int, input().split()))
v = defaultdict(list)
for i in range(n):
if i + 1 < n: v[i].append(i + 1)
if i - 1 >= 0: v[i].append(i - 1)
v[x - 1].append(y - 1)
v[y - 1].append(x - 1)
cnt =... | p02726 |
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
d= [[float('inf')]*n for _ in range(n)]
for i in range(n-1):
if i == 0:
d[0][1] = 1
d[n-1][n-2] = 1
else:
d[i][i+1] = 1
d[i][i-1] = 1
for i in range(n):
d[i][i] = 0
d[x][y] = 1
d[y][x] = 1
def warshall_floyd(d):
#d[i][... | from collections import deque
from collections import defaultdict
n, x, y = list(map(int, input().split()))
graph = [[] for _ in range(n)]
for i in range(n-1):
graph[i] += [i+1]
graph[i+1] += [i]
graph[x-1] += [y-1]
graph[y-1] += [x-1]
moves = ((1, 0), (0, 1), (0, -1), (-1, 0))
def bfs(s):
dis... | p02726 |
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
edge = []
for i in range(N):
edge.append([])
if i != 0:
edge[i].append(i - 1)
if i != N-1:
edge[i].append(i + 1)
edge[X].append(Y)
edge[Y].append(X)
answer = [0] * (N - 1)
for i in range(N):
queue = []
for e in ... | N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
edge = []
for i in range(N):
edge.append([])
if i != 0:
edge[i].append(i - 1)
if i != N-1:
edge[i].append(i + 1)
edge[X].append(Y)
edge[Y].append(X)
answer = [0] * (N - 1)
for i in range(N):
queue = []
for e in ... | p02726 |
import queue
N, X, Y = list(map(int, input().split()))
to = [[] * N for i in range(N)]
for i in range(N-1):
to[i].append(i+1)
to[i+1].append(i)
to[X-1].append(Y-1)
to[Y-1].append(X-1)
ans = [0] * N
for i in range(N):
dis = [0] * N
dis[i] = 0
visited = [False] * N
q = que... | from collections import deque
N, X, Y = list(map(int, input().split()))
to = [[] * N for i in range(N)]
for i in range(N-1):
to[i].append(i+1)
to[i+1].append(i)
to[X-1].append(Y-1)
to[Y-1].append(X-1)
ans = [0] * N
for i in range(N):
dis = [0] * N
dis[i] = 0
visited = [False]... | p02726 |
from collections import deque
N,X,Y = map(int,input().split())
edge = [[] for _ in range(N)]
for i in range(N):
if i == 0:
edge[i].append(i+1)
elif i == N-1:
edge[i].append(i-1)
else:
edge[i].append(i-1)
edge[i].append(i+1)
edge[X-1].append(Y-1)
edge[Y-1].append(X... | from collections import deque
import sys
input = sys.stdin.readline
def main():
N,X,Y = map(int,input().split())
edge = [[] for _ in range(N)]
for i in range(N):
if i == 0:
edge[i].append(i+1)
elif i == N-1:
edge[i].append(i-1)
else:
... | p02726 |
N,X,Y=list(map(int,input().split()))
G=[]
for i in range(1,N):
G.append([i,i+1])
G.append([X,Y])
graph=[[] for i in range(N+1)]
for i in range(N):
u,*v=G[i]
v.sort()
for j in v:
graph[u].append(j)
graph[j].append(u)
counter=[[] for i in range(N+1)]
for j in range(1,N+1):
... | N,X,Y=list(map(int,input().split()))
A=[[] for i in range(N+1)]
for i in range(1,N):
for j in range(i,N+1):
A[int(min(j-i,abs(X-i)+abs(Y-j)+1))].append(1)
for i in range(N):
if i!=0:
print((sum(A[i]))) | p02726 |
N,X,Y=list(map(int,input().split()))
A=[[] for i in range(N+1)]
for i in range(1,N):
for j in range(i,N+1):
A[int(min(j-i,abs(X-i)+abs(Y-j)+1))].append(1)
for i in range(N):
if i!=0:
print((sum(A[i]))) | N,X,Y=list(map(int,input().split()))
A=[0 for i in range(N)]
for i in range(1,N):
for j in range(i+1,N+1):
A[int(min(j-i,abs(X-i)+abs(Y-j)+1))]+=1
del A[0]
print(*A,sep=('\n'))
| p02726 |
n,x,y = list(map(int,input().split()))
a = [0 for _ in range(n-1)]
for i in range(1,n):
for j in range(i+1,n+1):
l = min(j-i,abs(x-i)+1+abs(j-y))
a[l-1] += 1
print(("\n".join(map(str,a)))) | def main():
n,x,y = list(map(int,input().split()))
a = [0 for _ in range(n-1)]
for i in range(1,n):
for j in range(i+1,n+1):
l = min(j-i,abs(x-i)+1+abs(j-y))
a[l-1] += 1
print(("\n".join(map(str,a))))
main() | p02726 |
from collections import defaultdict
n, x, y = list(map(int, input().split()))
d = defaultdict(int)
for i in range(1, n):
for j in range(i + 1, n + 1):
a = j - i
b = abs(x - i) + 1 + abs(y - j)
d[min(a, b)] += 1
for i in range(1, n):
print((d[i])) | from collections import defaultdict
n, x, y = list(map(int, input().split()))
d = defaultdict(int)
for i in range(1, n):
for j in range(i + 1, n + 1):
d[min(j - i, abs(x - i) + abs(y - j) + 1)] += 1
for i in range(1, n):
print((d[i])) | p02726 |
N, X, Y = list(map(int, input().split()))
for k in range(1,N):
d = 0
for i in range(1,N+1):
for j in range(i+1,N+1):
if k==min(j-i, abs(X-i)+1+abs(j-Y), abs(Y-i)+1+abs(j-X)):
d+=1
print(d) | N, X, Y = list(map(int, input().split()))
a = [0]*N
for i in range(1,N+1):
for j in range(i+1,N+1):
a[min(j-i, abs(i-X)+1+abs(j-Y))-1]+= 1
for i in range(N-1):
print((a[i])) | p02726 |
n,x,y=map(int,input().split())
G=[[i,i+2] for i in range(n)]
G[0],G[-1]=[2],[n-1]
G[x-1].append(y)
G[y-1].append(x)
#print(G)
ans=[0]*(n-1)
#X,Yのショートカットに気を付けて上から見ていく
for i in range(n-1):
for j in range(i+1,n):
#i+1<=XかつY<=j+1の時ショートカットするのが最短
temp1=j-i
temp2=abs(x-(i+1))+1+abs(y-(j+1))... | n,x,y=map(int,input().split())
G=[[i,i+2] for i in range(n)]
G[0],G[-1]=[2],[n-1]
G[x-1].append(y)
G[y-1].append(x)
#print(G)
ans=[0]*(n-1)
for i in range(n-1):
for j in range(i+1,n):
temp1=j-i
temp2=abs(x-(i+1))+1+abs(y-(j+1))
dis=min(temp1,temp2)
ans[dis-1]+=1
print(*a... | p02726 |
n, x, y = map(int,input().split())
dis = [0] * (n - 1)
for i in range(n - 1):
for j in range(i + 1, n):
d = min(abs(x - i - 1) + abs(y - j - 1) + 1, j - i)
dis[d - 1] += 1
print(*dis, sep = '\n')
| n, x, y = map(int,input().split())
cnt = [0] * (n - 1)
for i in range(1, n):
for j in range(i + 1, n + 1):
temp1 = j - i
temp2 = abs(i - x) + abs(j - y) + 1
dis = min(temp1, temp2)
cnt[dis - 1] += 1
print(*cnt, sep='\n')
| p02726 |
N, X, Y = list(map(int, input().split()))
List = []
for i in range(1,N):
for j in range(i+1, N+1):
List.append(min(j-i, abs(X-i)+1+abs(j-Y), abs(Y-i)+1+abs(j-X)))
for k in range(1, N):
print((List.count(k))) | N, X, Y = list(map(int, input().split()))
List = [0 for _ in range(N-1)]
for i in range(1,N):
for j in range(i+1, N+1):
num = min(j-i, abs(X-i)+1+abs(j-Y), abs(Y-i)+1+abs(j-X))
List[num-1] += 1
for k in range(N-1):
print((List[k])) | p02726 |
import itertools
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
list1 = [0] * (n * n)
for i in range(n):
for j in range(n):
if list1[n * j + i] != 0:
continue
list1[n * i + j] = min([abs(j - i), abs(x - i) + 1 + abs(j - y), abs(y - i) + 1 + abs(x - j)])
... | n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
cnt_list = [0] * (n - 1)
for i in range(n):
for j in range(n):
if j <= i:
continue
#i < j,x < yのとき、i→y→x→jが最短になることはない
num = min([j - i, abs(x - i) + 1 + abs(y - j)]) - 1 #距離 - 1、距離ゼロはif文で排除
cn... | p02726 |
import itertools
N,X,Y = list(map(int,input().split()))
n = list(range(1,N+1))
l = []
for v in itertools.combinations(n,2):
l.append(min(abs(Y-v[1]) + abs(X-v[0]) + 1,abs(X-v[1]) + abs(Y-v[0]) + 1,v[1] - v[0]))
for k in range(1,N):
print((l.count(k))) | import itertools
N,X,Y = list(map(int,input().split()))
n = list(range(1,N+1))
l = [0]*N
for v in itertools.combinations(n,2):
l[min(abs(Y-v[1]) + abs(X-v[0]) + 1,v[1] - v[0])] += 1
for k in range(1,N):
print((l[k])) | p02726 |
from collections import Counter
import queue
def bfs(d, s, N):
dist = [-1]*N
q = queue.Queue()
q.put(s)
dist[i] = 0
while not q.empty():
From = q.get()
for To in d[From]:
if dist[To-1] == -1:
q.put(To)
dist[To-1] = dist[From... | from collections import Counter, deque
def bfs(d, s, N):
dist = [-1]*N
q = deque()
q.append(s)
dist[i] = 0
while len(q) != 0:
From = q.popleft()
for To in d[From]:
if dist[To-1] == -1:
q.append(To)
dist[To-1] = dist[From-1]+1... | p02726 |
n, x, y = list(map(int, input().split()))
distances = []
for ind1 in range(1,n+1):
for ind2 in range(ind1+1,n+1):
cur_dist = min(ind2-ind1, abs(x-ind1)+abs(y-ind2)+1)
# print(ind1,ind2,cur_dist)
distances.append(cur_dist)
# print(distances)
for k in range(1,n):
print((le... | n, x, y = list(map(int, input().split()))
cnt = [0] *n
for ind1 in range(1,n+1):
for ind2 in range(ind1+1,n+1):
cur_dist = min(ind2-ind1, abs(x-ind1)+abs(y-ind2)+1)
# print(ind1,ind2,cur_dist)
cnt[cur_dist] += 1
# print(cnt)
for k in range(1,n):
print((cnt[k]))
... | p02726 |
import itertools
n,x,y = list(map(int, input().split()))
a = [i for i in range(1, n+1)]
b = list(itertools.combinations(a, 2))
c = [0]*(n-1)
for j in range(len(b)):
d = min(abs(b[j][0]-b[j][1]), abs(x-b[j][0])+1+abs(b[j][1]-y), abs(y-b[j][0])+1+abs(b[j][1]-x))
c[d-1] += 1
for k in range(n-1):
... | import itertools
n,x,y = list(map(int, input().split()))
a = [i for i in range(1, n+1)]
b = [0]*(n-1)
for j in range(n):
for k in range(j+1, n):
c = min(abs(k-j),abs(j-(x-1)) +abs(k-(y-1))+1)
b[c-1] += 1
for l in range(n-1):
print((b[l])) | p02726 |
#!/usr/bin/env python3
import sys
def solve(N: int, X: int, Y: int):
distances = [0] * (N - 1)
for i in range(0, N - 1):
for j in range(i + 1, N):
if j < X - 1 or Y - 1 < i:
distance = j - i
else:
distance = min(j - i, abs(X - 1 - i) +... | #!/usr/bin/env python3
import sys
def solve(N: int, X: int, Y: int):
distances = [0] * (N - 1)
for i in range(0, N - 1):
for j in range(i + 1, N):
distance = min(j - i, abs(X - 1 - i) + abs(Y - 1 - j) + 1)
distances[distance - 1] += 1
for k in distances:
... | p02726 |
import sys
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
d = [[sys.maxsize for _ in range(N)] for _ in range(N)]
for i in range(N):
for j in range(N):
d[i][j] = min(abs(j-i), abs(X-i) + 1 + abs(j-Y))
answer = [0 for _ in range(N-1)]
for h in range(N):
for i in range(h+1, N):
i... | import sys
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
answer = [0 for _ in range(N-1)]
for i in range(N):
for j in range(i+1, N):
answer[min(j-i, abs(X-i) + 1 + abs(j-Y))-1] += 1
for k in range(N-1):
print((answer[k])) | p02726 |
from collections import defaultdict
n,x,y=list(map(int,input().split()))
d=defaultdict(list)
for i in range(1,n):
for j in range(i+1,n+1):
r=min(abs(i-j),abs(x-i)+1+abs(y-j),abs(x-j)+1+abs(y-i))
d[r].append((i,j))
for i in range(1,n):
print((len(d[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):
l[(min(abs(i-j),abs(x-i)+1+abs(y-j),abs(x-j)+1+abs(y-i)))-1]+=1
for i in l:
print(i)
| p02726 |
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
distances = [0]*N
for i in range(N):
for j in range(i+1,N):
d = min(abs(j-i), abs(X-i)+1+abs(j-Y), abs(Y-i)+1+abs(j-X))
distances[d] += 1
for i in range(1,N):
print((distances[i])) | N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
distances = [0]*N
for i in range(N):
for j in range(i+1,N):
# d = min(abs(j-i), abs(X-i)+1+abs(j-Y), abs(Y-i)+1+abs(j-X))
d = min(abs(j-i), abs(X-i)+1+abs(j-Y))
distances[d] += 1
for i in range(1,N):
print((distances[i... | p02726 |
from collections import defaultdict
import math
N, X, Y = list(map(int, input().split()))
res = defaultdict(int)
x = []
for i in range(1, N + 1):
for j in range(1, N + 1):
if i >= j:
continue
if i == X and Y == j:
key = 1
else:
key = int(min(j ... | N, X, Y = list(map(int, input().split()))
res = [0] * N
for i in range(1, N + 1):
for j in range(1, N + 1):
if i >= j:
continue
if i == X and Y == j:
key = 1
else:
key = int(min(j - i, abs(X - i) + abs(Y - j) + 1))
res[key] += 1
for i ... | p02726 |
N, X, Y = list(map(int, input().split()))
res = [0] * N
for j in range(1, N + 1):
for i in range(1, j):
if i == X and Y == j:
key = 1
else:
key = int(min(j - i, abs(X - i) + abs(Y - j) + 1))
res[key] += 1
for i in range(1, N):
print((res[i])) | N, X, Y = list(map(int, input().split()))
res = [0] * N
for j in range(1, N + 1):
for i in range(1, j):
res[min(j - i, abs(X - i) + abs(Y - j) + 1)] += 1
for i in range(1, N):
print((res[i]))
| p02726 |
from collections import defaultdict
import math
N, X, Y = list(map(int, input().split()))
res = defaultdict(int)
x = []
for i in range(1, N + 1):
for j in range(1, N + 1):
if i >= j:
continue
if i == X and Y == j:
key = 1
else:
key = int(min(j ... | N, X, Y = list(map(int, input().split()))
res = [0] * N
for j in range(1, N + 1):
for i in range(1, j):
res[min(j - i, abs(X - i) + abs(Y - j) + 1)] += 1
for i in range(1, N):
print((res[i]))
| p02726 |
n,x,y=map(int,input().split())
x-=1;y-=1
l=[[10**4 for g in range(n)] for i in range(n)]
fl=[0 for i in range(n-1)]
for i in range(n):
for j in range(i+1,n):
fl[min(abs(j-i),abs(j-x)+1+abs(y-i),abs(i-x)+1+abs(y-j))]+=1
print(*fl[1:],sep="\n")
print(fl[0])
| n,x,y=map(int,input().split())
x-=1;y-=1
fl=[0 for i in range(n-1)]
for i in range(n):
for j in range(i+1,n):
fl[min(abs(j-i),abs(j-x)+1+abs(y-i),abs(i-x)+1+abs(y-j))]+=1
print(*fl[1:],sep="\n")
print(0)
| p02726 |
n,x,y = list(map(int,input().split()))
INF = 10**5
d = [[INF]*n for _ in range(n)]
def wf(d):
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j],d[i][k] + d[k][j])
for i in range(n-1):
d[i][i+1] = 1
d[i+1][i] = 1
d[x-1][y-1]=1
d[y-1][x-1]=1
wf(d)
... | n,x,y = list(map(int,input().split()))
x,y = x-1,y-1
ans = [0]*(n)
for i in range(n):
for j in range(i+1,n):
sp = min(abs(j-i), abs(x-i)+abs(j-y)+1, abs(y-i)+1+abs(j-x))
ans[sp]+=1
for a in ans[1:]:
print(a) | p02726 |
N,X,Y = list(map(int,input().split()))
G = [[] for _ in range(N)]
# print(G)
# ぐらふの作成
for i in range(N-1):
G[i].append(i+1)
G[i+1].append(i)
G[X-1].append(Y-1)
G[Y-1].append(X-1)
# print(G)
from collections import deque
def bfs(G,v):
que = deque([v])
dist[v] = 0
while que:
... | N,X,Y = list(map(int,input().split()))
D= [0]*(N-1)
# print(X,Y)
for i in range(1,N+1):
for j in range(i+1,N+1): # i<j
# print((i,j))
# ver 1
if j<=X or Y<=i:
d = j-i
# ver 2
elif i<=X and Y<=j:
d = X-i + 1 + j-Y
... | p02726 |
N,X,Y = list(map(int,input().split()))
D= [0]*(N-1)
# print(X,Y)
for i in range(1,N+1):
for j in range(i+1,N+1): # i<j
# print((i,j))
# ver 1
if j<=X or Y<=i:
d = j-i
# ver 2
elif i<=X and Y<=j:
d = X-i + 1 + j-Y
... | N,X,Y = list(map(int,input().split()))
D= [0]*(N-1)
for i in range(1,N+1):
for j in range(i+1,N+1): # i<j
d = min(j-i,abs(X-i)+abs(Y-j)+1)
D[d-1] += 1
for d in D:
print(d) | p02726 |
from collections import deque
n,x,y=list(map(int,input().split()))
L=[[0]*n for i in range(n)]
for i in range(n-1):
L[i][i+1]=L[i+1][i]=1
L[x-1][y-1]=L[y-1][x-1]=1
R=[0]*n
def bfs(j):
V=[-1]*n
que=deque([])
que.append(j)
V[j]=0
while que:
p=que.popleft()
for i in range(n):
if V[i]==-1 ... | from collections import deque
n,x,y=list(map(int,input().split()))
L=[[1]]
for i in range(1,n-1):
L.append([i-1,i+1])
L.append([n-2])
L[x-1].append(y-1)
L[y-1].append(x-1)
R=[0]*n
def bfs(j):
V=[-1]*n
que=deque([])
que.append(j)
V[j]=0
while que:
p=que.popleft()
for np in L[p]:
if V[... | p02726 |
# coding: utf-8
import re
import math
from collections import defaultdict
from collections import deque
import collections
from fractions import Fraction
import itertools
from copy import deepcopy
import random
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
... | # coding: utf-8
import re
import math
from collections import defaultdict
from collections import deque
import collections
from fractions import Fraction
import itertools
from copy import deepcopy
import random
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
... | p02726 |
from collections import deque
def BFS(s):
color=["white" for _ in range(n+1)]
D=[0 for _ in range(n+1)]
D[s]=0
color[s]="gray"
queue=deque([s])
while len(queue)>0:
u=queue.popleft()
for i in M[u]:
if color[i]=="white":
D[i]=D[u]+1
... | from collections import deque
inf=10**9
def BFS(num):
color=["white" for _ in range(n+1)]
D=[inf for _ in range(n+1)]
queue=deque([num])
color[num]="gray"
D[num]=0
while len(queue)>0:
u=queue.popleft()
for i in M[u]:
if color[i]=="white" and D[u]+1<... | p02726 |
from collections import deque
def main():
n, x, y = list(map(int, input().split()))
cnt = [0]*n
q = deque()
for i in range(n):
q.appendleft([i, 0])
dist = [None]*n
dist[i] = 0
while q:
j, d = q.pop()
cnt[d] += 1
if j... | from collections import deque
def main():
n, x, y = list(map(int, input().split()))
cnt = [0]*n
q = deque()
for i in range(n):
q.appendleft(i)
dist = [None]*n
dist[i] = 0
while q:
j = q.pop()
d = dist[j]
cnt[d] += 1
... | p02726 |
import queue
def push(n, dist, dist_list):
if dist_list[n] > dist:
dist_list[n] = dist
q.put(n)
q = queue.Queue()
n, x, y = [int(i) for i in input().split()]
result = [0] * (n-1)
for p in range(n):
dist_list = [111111] * n
dist = 0
q.put(p)
dist_list[p] = dist
while not q.empty():
p... | n, x, y = [int(i) for i in input().split()]
# 0 index is 1 distance
result = [0] * (n-1)
for i in range(n-1):
for j in range(i+1, n):
dist = min(j-i, abs(x-1-i) + 1 + abs(j-y+1))
result[dist-1] += 1
for ans in result:
print(ans)
# TLE
# import queue
# q = queue.Queue()
# n, x, y = [int(i)... | p02726 |
def s0():return eval(input())
def s1():return input().split()
def s2(n):return [eval(input()) for x in range(n)]
def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(eval(input())) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in... | def s0():return eval(input())
def s1():return input().split()
def s2(n):return [eval(input()) for x in range(n)]
def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(eval(input())) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in... | p02726 |
import sys
from collections import deque
def main():
# n, x, y = 7, 3, 7
n, x, y = [int(s) for s in sys.stdin.readline().strip().split()]
score = {i: 0 for i in range(1, n)}
total_pair = set()
def bfs(start):
seen = set()
q = deque()
q.append((0, start))
... | import sys
def main():
n, x, y = [int(s) for s in sys.stdin.readline().strip().split()]
x1 = x-1
y1 = y-1
score = {i:0 for i in range(n)}
for i in range(n-1):
for j in range(i+1, n):
diff = j - i
cand = abs(x1 - i) + 1 + abs(y1 - j)
cand2 =... | p02726 |
N, X, Y = [int(i) for i in input().split()]
gp = [[float('inf')]*N for _ in range(N)]
def warshall_floyd(d,n):
#d[i][j]: iからjへの最短距離
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j],d[i][k] + d[k][j])
return d
for i in range(N... | N, X, Y = [int(i) for i in input().split()]
li = [0]*(N-1)
for i in range(1, N+1):
for j in range(i+1, N+1):
k = 0
if(i<X and j<X):
k = j-i
if(i<X and X<=j<=Y):
k = min(j-i, X-i+1+Y-j)
if(i<X and Y<j):
k = X-i+1+j-Y
if(X<=i<=Y an... | p02726 |
n, a1, a2 = list(map(int, input().split(" ")))
anscount = [0 for i in range(n + 1)]
for i in range(1, n):
for j in range(i + 1, n + 1):
anscount[min(abs(j - i), abs(i - a1) + abs(j - a2) + 1, abs(i - a2) + abs(j - a1) + 1)] += 1
for i in range(1, n):
print((anscount[i])) | n, a1, a2 = list(map(int, input().split(" ")))
print(n)
wa = a2 - a1 + 1
l1 = a1 - 1
l2 = n - a2
hwa = wa // 2
pari = wa % 2
# print(wa,l1,l2,hwa,pari)
tmp = 0
for i in range(2, n):
if l1 + l2 + 1 >= i:
tmp += l1 + l2 - i + 2
if i - 1 <= l1:
tmp -= 1
if i - 1 <= l2:
... | p02726 |
N,X,Y=list(map(int,input().split()))
def count(k):
ans=0
for i in range(1,N):
for j in range(i+1,N+1):
if min(abs(j-i),abs(X-i)+abs(Y-j)+1)==k:
ans+=1
return ans
for k in range(1,N):
print((count(k)))
| 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(j-i),abs(X-i)+abs(Y-j)+1)]+=1
for i in range(1,N):
print((ans[i])) | p02726 |
n, x, y = list(map(int, input().split()))
edge = [[] for _ in range(n+1)]
dist = [[abs(i-j) for i in range(n+1)] for j in range(n+1)]
counter = [0 for i in range(n)]
for i in range(1, n):
edge[i].append(i+1)
edge[i+1].append(i)
edge[x].append(y)
edge[y].append(x)
for i in range(y+1):
for j in rang... | n, x, y = list(map(int, input().split()))
edge = [[] for _ in range(n+1)]
dist = [[abs(i-j) for i in range(n+1)] for j in range(n+1)]
counter = [0 for i in range(n)]
for i in range(1, n):
edge[i].append(i+1)
edge[i+1].append(i)
edge[x].append(y)
edge[y].append(x)
for i in range(y+1):
for j in rang... | p02726 |
N, X, Y = list(map(int, input().split()))
ans = [0] * N
X -= 1
Y -= 1
for i in range(N):
for j in range(i+1, N):
distance = abs(i-j)
# X Y i j
if Y <= i:
pass
# i j X Y
elif j <= X:
pass
# X i Y j
elif X <= i < Y <= j:... | N, X, Y = list(map(int, input().split()))
ans = [0] * N
X -= 1
Y -= 1
for i in range(N):
for j in range(i+1, N):
distance = min(abs(i-j), abs(i-X) + 1 + abs(j-Y))
ans[distance] += 1
for k in range(1, N):
print((ans[k]))
| p02726 |
N,X,Y = list(map(int,input().split()))
ans = [0]*(N-1)
for i in range(1,N):
for j in range(i+1,N+1):
if i <= X and j <= X:
dic = j-i
elif i >= Y and j >= Y:
dic = j-i
elif i <= X and j >= Y:
dic = (j-i)-(Y-X)+1
elif X < i < Y and j >= Y:
dic = min(i-X+1,Y-i)+(j-Y)
... | n,x,y = list(map(int,input().split()))
ans = [0]*(n-1)
def f(N,X,Y):
for i in range(1,N):
for j in range(i+1,N+1):
if i <= X and j <= X:
dic = j-i
elif i >= Y and j >= Y:
dic = j-i
elif i <= X and j >= Y:
dic = (j-i)-(Y-X)+1
elif X < i < Y and j >= Y:... | p02726 |
n, x, y = list(map(int, input().split()))
kyori = []
def clc(i1, i2):
return min(1 + abs(i2 - y) + abs(i1 - x), i2 - i1)
for k in range(1, n+1):
for l in range(k+1, n+1):
tmp = clc(k, l)
kyori.append(tmp)
for i in range(n-1):
cnt = 0
for k in kyori:
if k == i + 1... | n, x, y = list(map(int, input().split()))
kyori = []
def clc(i1, i2):
if (i1 < x and i2 <= x) or (y <= i1 and y < i2):
return i2 - i1
else:
return min(1 + abs(i2 - y) + abs(i1 - x), i2 - i1)
for k in range(1, n+1):
for l in range(k+1, n+1):
tmp = clc(k, l)
kyori... | p02726 |
from itertools import *
n,x,y=map(int,input().split())
a=[0]*n
for i,j in combinations(range(1,n+1),2):
b=min(abs(i-j),abs(x-i)+1+abs(y-j),abs(x-j)+1+abs(y-i))
a[b]+=1
print(*a[1:],sep="\n")
| n,x,y=map(int,input().split())
a=[0]*n
for i in range(1,n+1):
for j in range(i,n+1):
b=min(abs(i-j),abs(i-x)+1+abs(y-j),abs(x-j)+1+abs(y-i))
a[b]+=1
print(*a[1:],sep="\n")
| p02726 |
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for... | p02726 |
from heapq import heappush, heappop
def solve(N, X, Y):
ans = [0] * (N)
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)
def dfs(vertex):
nears = [float('inf')] * (N + 1)
de... | # 解説を参考に作成
def solve(N, X, Y):
ans = [0] * (N)
for i in range(1, N):
for j in range(i + 1, N + 1):
k = min(abs(j - i), abs(X - i) + 1 + abs(Y - j))
ans[k] += 1
for i in ans[1:]:
print(i)
if __name__ == '__main__':
N, X, Y = list(map(int, inpu... | p02726 |
mod = 10**9 + 7
def iip(listed = False):
ret = [int(i) for i in input().split()]
if len(ret) == 1 and not listed:
return ret[0]
return ret
def soinsuu_bunkai(n):
ret = []
for i in range(2, int(n**0.5)+1):
while n % i == 0:
n //= i
ret.append(i)
... | mod = 10**9 + 7
def iip(listed = False):
ret = [int(i) for i in input().split()]
if len(ret) == 1 and not listed:
return ret[0]
return ret
def soinsuu_bunkai(n):
ret = []
for i in range(2, int(n**0.5)+1):
while n % i == 0:
n //= i
ret.append(i)
... | p02726 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
import heapq
from collections import defaultdict
INF = float("inf")
class Graph(object):
def __init__(self, N):
self.N = N
self.E = defaultdict(list)
def add_edge(self, s, t, w=1):
self.E[s].append((t, w))
... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
import heapq
from collections import defaultdict
INF = float("inf")
def solve(N: int, X: int, Y: int):
if X > Y:
X, Y = Y, X
ans = [0]*N
for i in range(N):
for j in range(i+1, N):
d = min(abs(j-i), a... | p02726 |
from collections import deque
n,x,y=list(map(int,input().split()))
g = [[i-1,i+1] for i in range(1,n-1)]
g.insert(0,[1])
g.append([n-2])
g[x-1].append(y-1)
g[y-1].append(x-1)
dist = []
def bfs(i):
d = [float("inf")]*n
que = deque([])
que.append(i)
d[i] = 0
while que:
... | 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):
a = min(j-i, abs(x-i)+1+abs(y-j))
ans[a-1] += 1
for i in range(n-1):
print((ans[i])) | p02726 |
import bisect as bs
n,x,y = list(map(int,input().split()))
x -= 1
y -= 1
array = [[-1 for i in range(n)] for j in range(n)]
for i in range(n):
for j in range(n):
array[i][j] = abs(j-i)
for i in range(n):
if array[i][x] == array[i][y]:
pass
elif array[i][x] > array[i][y]:
ar... | n,x,y = list(map(int,input().split()))
x -= 1
y -= 1
array1 = [0] * n
array2 = [0] * n
for i in range(x, y+1):
array1[i] = min(i-x, y-i+1)
array2[i] = min(i-x+1, y-i)
ans = [0] * (n+1)
dis = [[0 for i in range(n)] for i in range(n)]
for i in range(n):
if i <= x:
for j in range(i+1,n):
... | p02726 |
n, x, y = list(map(int, input().split()))
def distance(i,j):
d1 = abs(i-j)
d2 = abs(i-x)+1+abs(j-y)
d3 = abs(i-y)+1+abs(j-x)
d = min(d1,d2,d3)
return d
d = [0]*(n-1)
for i in range(1, n+1):
for j in range(i+1,n+1):
d[distance(i,j)-1] = d[distance(i,j)-1] + 1
for i ... |
n, x, y = list(map(int, input().split()))
d = [0]*(n-1)
for i in range(1, n+1):
for j in range(i+1,n+1):
c = min(j-i, abs(i-x)+1+abs(j-y))
d[c-1] = d[c-1] + 1
for i in d:
print(i) | p02726 |
from collections import deque, Counter
def bfs(start, graph):
q = deque([(start, 0)])
visited = set()
while q:
curr, dist = q.popleft()
if curr not in visited:
yield start, curr, dist
visited.add(curr)
for neighbor in graph[curr]:
... | def distance(i, j, x, y):
return min([abs(j - i), abs(x - i) + 1 + abs(j - y), abs(y - i) + 1 + abs(j - x)])
if __name__ == '__main__':
n, x, y = tuple([int(i) for i in input().split()])
x, y = min(x, y), max(x, y)
dists = [0 for k in range(n)]
for i in range(1, n):
for j in ran... | p02726 |
from collections import deque
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
# nl = lambda: list(map(int, input().split()))
n,x,y=nm()
class Node:
def __init__(self,x):
self.val = x
self.left=[]
self.right=[]
nodes = [Node(i) for i in range(n)]
for i in ran... | ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
n,x,y = nm()
dist = [0]*n
for i in range(1,n+1):
for j in range(i+1,n+1):
naive = j-i
cand = naive
if i<x:
if x<=j<=y:
cand = x-i+1+y-j
elif j>y:
... | p02726 |
import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, X, Y = list(map(int, readline().split()))
X -= 1
Y -= 1
G = [[] for _ in range(N... | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, X, Y = list(map(int, readline().split()))
X -= 1
Y -= 1
ans = [0] * N
for... | p02726 |
from collections import deque
def main():
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
ans = [0 for _ in range(N)]
for s in range(N):
dist = [-1 for _ in range(N)]
dist[s] = 0
d = deque([s])
while(len(d) > 0):
v = d.popleft()
... | from collections import deque
def main():
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
ans = [0 for _ in range(N)]
for s in range(N):
dist = [-1 for _ in range(N)]
dist[s] = 0
d = deque([s])
while(len(d) > 0):
v = d.popleft()
... | p02726 |
n, x, y = list(map(int, input().split()))
li = [0]*(n-1)
num = 0
for i in range(1,n+1):
for j in range(i+1,n+1):
if j<=x or y<i:
num = j-i
elif i<=x and x<j<=y:
num = (x-i)+min(j-x, y-j+1)
elif i<=x and y<j:
num = (x-i)+(j-y)+1
elif x<... | n, x, y = list(map(int, input().split()))
li = [0] * (n - 1)
num = 0
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
num = min(j-i, abs(i-x)+abs(j-y)+1)
li[num - 1] += 1
for i in li:
print(i) | p02726 |
from collections import deque
n,x,y=list(map(int,input().split()))
t=deque()
for i in range(1,n+1):
for j in range(i+1,n+1):
t.append(min(abs(j-i),abs(i-x)+abs(j-y)+1))
for k in range(1,n):
print((t.count(k))) |
n,x,y=map(int,input().split())
t=[0]*n
for i in range(1,n+1):
for j in range(i+1,n+1):
t[min(abs(j-i),abs(i-x)+abs(j-y)+1)]+=1
print(*t[1:],sep='\n')
| p02726 |
n,x,y = list(map(int,input().split()))
ans = {}
for i in range(1,n):
for j in range(i+1,n+1):
dist = min(abs(i-j),abs(i-x)+abs(j-y)+1,abs(i-y)+abs(j-x)+1)
if dist in list(ans.keys()):
ans[dist] += 1
else:
ans[dist] = 1
for k in range(1,n):
if k in list(a... | n,x,y = list(map(int,input().split()))
ans = {}
s = (y-x+1)//2
s = x+s
for i in range(1,n):
for j in range(i+1,n+1):
if i <= s:
dist = min(j-i,abs(i-x)+abs(j-y)+1)
else:
dist = j-i
if dist in list(ans.keys()):
ans[dist] += 1
else:
... | p02726 |
#D
line = [int(x) for x in input().split()]
n = line[0]
x = line[1]
y = line[2]
results =[0]*(n+2)
for i in range(1, n):
for j in range(i+1,n+1):
yeet = min([abs(j-i), abs(x-i) + 1 + abs(j-y), abs(y-i) + 1 + abs(j-x)])
results[yeet-1] += 1
for i in range(0, n-1):
print((result... | #D
line = [int(x) for x in input().split()]
n = line[0]
x = line[1]
y = line[2]
results =[0]*(n+2)
for i in range(1, n):
for j in range(i+1,n+1):
results[min([abs(j-i), abs(x-i) + 1 + abs(j-y)])-1] += 1
for i in range(0, n-1):
print((results[i]))
| p02726 |
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):
a1=abs(i-j)
a2=abs(x-i)+1+abs(y-j)
a3=abs(y-i)+1+abs(x-j)
d=min(a1,a2,a3)
ans[d]+=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+1): #i<jなるすべての頂点の組について最短距離を求める
for j in range(i+1,n+1):
dist1=j-i
dist2=abs(x-i)+abs(y-j)+1
dist3=abs(y-i)+abs(x-j)+1
d=min(dist1,dist2,dist3) #最短距離は上式により求められる
ans[d]+=1 #最短距離がdとなる組の個数を1増やす
for i in range(1,n):... | p02726 |
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):
a1=abs(i-j)
a2=abs(x-i)+1+abs(y-j)
a3=abs(y-i)+1+abs(x-j)
d=min(a1,a2,a3)
ans[d]+=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+1):
for j in range(i+1,n+1):
a1=j-i
a2=abs(x-i)+1+abs(y-j)
a3=abs(y-i)+1+abs(x-j)
d=min(a1,a2,a3)
ans[d]+=1
for i in range(1,n):
print((ans[i])) | p02726 |
#!/usr/bin/env python3
from collections import deque
n, x, y = list(map(int, input().split()))
to = [[] for _ in range(n)]
for i in range(n):
if i == 0:
to[i].append(i+1)
elif i == n-1:
to[i].append(i-1)
else:
to[i].append(i+1)
to[n-i-1].append(n-i-2)
to[x-1].a... | #!/usr/bin/env python3
# TLE解
from collections import deque
n, x, y = list(map(int, input().split()))
to = [[] for _ in range(n)]
for i in range(n):
if i == 0:
to[i].append(i+1)
elif i == n-1:
to[i].append(i-1)
else:
to[i].append(i+1)
to[n-i-1].append(n-i-2)
t... | p02726 |
import math
import bisect
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
b=[]
for i in range(1,50):
b.append(2**i)
ct=0
check=[1]*n
for i in range(n-1,-1,-1):
if a[i]==1:
break
if check[i]==1 and a[i] not in b:
check[i]=0
x=math.floor(math.log2(a[i]))
x=b[x]-a[i]
... | import math
import bisect
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
x=a[0]
ctn=1
l=[]
l2=[]
for i in range(1,n):
if x==a[i]:
ctn+=1
else:
l.append([x,ctn])
l2.append(x)
x=a[i]
ctn=1
l.append([x,ctn])
l2.append(x)
b=[]
for i in range(1,50):
b.append(2... | p03201 |
import math
from collections import defaultdict
def main():
_ = int(eval(input()))
nums = list(map(int, input().split()))
n = len(nums)
nums.sort()
nums_cnt = defaultdict(int)
for num in nums:
nums_cnt[num] += 1
cnt = 0
#print(num_bin_digits)
for cur in re... | import math
from collections import defaultdict
def main():
n = int(eval(input()))
nums = list(map(int, input().split()))
nums.sort()
nums_cnt = defaultdict(int)
for num in nums:
nums_cnt[num] += 1
cnt = 0
for num in reversed(nums):
if nums_cnt[num] <= 0:
... | p03201 |
import bisect
import collections
n = int(eval(input()))
a = list(map(int, input().split()))
a_counter = collections.Counter(a)
a_keys = sorted(list(a_counter.keys()), reverse=True)
targets = []
t = 0
vt = 1
for v in a:
while v >= vt:
t += 1
vt *= 2
targets.append(vt)
... | import bisect
import collections
n = int(eval(input()))
a = list(map(int, input().split()))
a_counter = collections.Counter(a)
a_keys = sorted(list(a_counter.keys()), reverse=True)
targets = []
t = 0
vt = 1
for v in a:
while v >= vt:
t += 1
vt *= 2
targets.append(vt)
... | p03201 |
n = int(eval(input()))
a = list(map(int,input().split()))
a.sort(reverse=True)
u = [0 for i in range(len(a))]
def binarySearch(alist, item,exhi):
first = 0
last = len(alist)-1
found = False
while first<=last and not found:
midpoint = (first + last)//2
if alist[midpoint] == ... | from bisect import bisect_left
n = int(eval(input()))
a = list(map(int,input().split()))
a.sort()
#print(a)
sum = 0
for i in range (len(a)-1,-1,-1):
b = 1
while b <= a[i]:
b = b<<1
t = b - a[i]
#print("2^",t)
k = bisect_left(a,t)
if a[k] == t and k < i:
sum... | p03201 |
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
dic = {}
for v in a:
if v in dic:
dic[v] += 1
else:
dic[v] = 1
key = [v for v in list(dic.keys())]
key.sort(reverse=True)
ans = 0
for v in key:
num = dic[v]... | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
dic = {}
for v in a:
if v in dic:
dic[v] += 1
else:
dic[v] = 1
key = [v for v in list(dic.keys())]
key.sort(reverse=True)
ans = 0
for v in key:
num = dic[v]... | p03201 |
import bisect
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
ans = 0
L=0
t=31
while(t>0):
if len(A) == 0:
break
if A[-1] >= (1 << t):
t -= 1
L = 0
continue
if A[-1] < (1 << (t-1)):
t -= 1
L = 0
continue
lar... | N = int(eval(input()))
A = list(map(int,input().split()))
A.sort(reverse=True)
dic = {}
for a in A:
dic[a] = dic.get(a,0)+1
ans = 0
for a in A:
small = (1<<(len(format(a,"b")))) - a
if small == a:
if dic[a] >= 2:
dic[a] -= 2
ans += 1
continue
if di... | p03201 |
from collections import defaultdict
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
cnt = defaultdict(int)
for a in A:
cnt[a] += 1
n = 1
while n <= 2 * A[0]:
n *= 2
n //= 2
ans = 0
while n > 0:
for a in A:
if cnt... | from collections import defaultdict
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
cnt = defaultdict(int)
for a in A:
cnt[a] += 1
n = 1
while n <= 2 * A[0]:
n *= 2
n //= 2
ans = 0
while n > 0:
for a in A:
if cnt... | p03201 |
import math
import bisect
N=int(eval(input()))
alist=list(map(int,input().split()))
alist.sort()
#print(alist)
flist=[False]*N
answer=0
for i in reversed(list(range(N))):
if flist[i]:
continue
p1=alist[i]
p2=2**math.ceil(math.log(p1+1,2))-p1
#print(p1,p2)
index1 = bisect.bisect... | import bisect
N=int(eval(input()))
alist=list(map(int,input().split()))
alist.sort(reverse=True)
blist=[]
for a in alist:
a2=a
digit_a2=0
while(a2>0):
a2>>=1
digit_a2+=1
b=2**(digit_a2)-a
blist.append(b)
#print(alist)
#print(blist)
dic_a={}
for a in alist:
if a in dic_a:
di... | p03201 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.