input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#Fukushimaken:
from heapq import heappop, heappush
OUT, IN = 0, 1
def P(i):
return 31 if i % 5 == 1 else 3
def M(i):
return 17 * (i % 2) + 3 * (i % 3) + 19
def check(c, n):
for i in range(16):
if (c >> i) & n == 0:
return i
return None
ans = [-1] * 100 + [0]
eq = ... | #Fukushimaken:
from heapq import heappop, heappush
def P(i):
return 31 if i % 5 == 1 else 3
def M(i):
return 17 * (i % 2) + 3 * (i % 3) + 19
def check(c, n):
for i in range(16):
if (c >> i) & n == 0:
return i
return None
ans = [-1] * 100 + [0]
eq = [(i * 5, i, None... | p00147 |
n,x,y=list(map(int,input().split()))
x-=1
y-=1
a=[]
for i in range(n):
a.append(0)
for i in range(n):
for j in range(n):
if i<j:
p=min(abs(j-i),abs(x-i)+abs(y-j)+1,abs(y-i)+abs(x-j)+1)
a[p]+=1
for i in range(n-1):
print((str(a[i+1]))) | n,x,y=list(map(int,input().split()))
x-=1
y-=1
a=[]
for i in range(n):
a.append(0)
for i in range(n-1):
for j in range(n-i):
j=n-1-j
p=min(abs(j-i),abs(x-i)+abs(y-j)+1,abs(y-i)+abs(x-j)+1)
a[p]+=1
for i in range(n-1):
print((str(a[i+1]))) | p02726 |
N, X, Y = map(int, input().split())
X = X-1
Y = Y-1
cnt = [0]*N
for i in range(N):
for j in range(N):
if j >= i:
continue
dist = min(abs(i-j),
abs(X-i) + abs(Y-j) + 1,
abs(X-j) + abs(Y-i) + 1)
cnt[dist] += 1
print(*cnt[1:], se... | N, X, Y = map(int, input().split())
X = X-1
Y = Y-1
cnt = [0]*N
for i in range(N):
for j in range(i+1, N):
dist = min(abs(i-j),
abs(X-i) + abs(Y-j) + 1,
abs(X-j) + abs(Y-i) + 1)
cnt[dist] += 1
print(*cnt[1:], sep='\n')
| p02726 |
import sys
input = sys.stdin.readline
import collections
N, X, Y = list(map(int, input().split()))
def bfs(i, j):
dist = [-1]*N
dist[i] = 0
que = collections.deque([])
que.append(i)
while len(que) != 0:
v = que.popleft()
for nv in graph[v]:
if dist[n... | import sys
input = sys.stdin.readline
import collections
N, X, Y = list(map(int, input().split()))
def bfs(i):
dist = [-1]*N
dist[i] = 0
que = collections.deque([])
que.append(i)
while len(que) != 0:
v = que.popleft()
for nv in graph[v]:
if dist[nv] ... | p02726 |
import sys
input = sys.stdin.readline
import collections
N, X, Y = list(map(int, input().split()))
def bfs(i):
dist = [-1]*N
dist[i] = 0
que = collections.deque([])
que.append(i)
while len(que) != 0:
v = que.popleft()
for nv in graph[v]:
if dist[nv] ... | import sys
input = sys.stdin.readline
from collections import deque
from collections import Counter
def main():
N, X, Y = list(map(int, input().split()))
graph = {}
for i in range(N):
graph[i] = set()
for i in range(N-1):
graph[i].add(i+1)
graph[i+1].add(i)
graph[... | p02726 |
def main():
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
print(N)
for k in range(2, N):
ans = 0
for i in range(N):
ans += sum(1 for j in range(i + 1, N)
if min(j - i, abs(i - X) + abs(j - Y) + 1) == k)
print(ans)
... | def main():
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
print(N)
dist = [0] * (N + 1)
for i in range(N):
for j in range(i + 1, N):
d = min(j - i, abs(i - X) + abs(j - Y) + 1)
dist[d] += 1
for k in range(2, N):
print((dist[k... | p02726 |
from itertools import combinations
from collections import defaultdict
inf=10**7
n,x,y=list(map(int,input().split()))
x-=1
y-=1
dis={}
cnt=defaultdict(int)
for i,j in combinations(list(range(n)),2):
dis[(i,j)]=min(abs(j-i),abs(j-y)+1+abs(i-x),abs(j-x)+1+abs(i-y))
for i,j in combinations(list(range(n)),2):
... | from itertools import combinations
from collections import defaultdict
n,x,y=list(map(int,input().split()))
x-=1
y-=1
cnt=defaultdict(int)
for i,j in combinations(list(range(n)),2):
cnt[min(abs(j-i),abs(j-y)+1+abs(i-x),abs(j-x)+1+abs(i-y))]+=1
for k in range(1,n):
print((cnt[k])) | p02726 |
def main():
N,X,Y = list(map(int,input().split()))
d = [[float('inf') for _ in range(N)] for _ in range(N)]
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
for i in range(N):
d[i][i] = 0
for k in range(N):
for i in range(N):
for j in r... | def main():
N,X,Y = list(map(int,input().split()))
V = [[] for _ in range(N)]
for i in range(N-1):
V[i].append(i+1)
V[i+1].append(i)
X -= 1
Y -= 1
V[X].append(Y)
V[Y].append(X)
#print(V)
ans = [0 for _ in range(N)]
INF = float('INF')
for s in range(N):
D = [INF fo... | p02726 |
n,x,y=list(map(int,input().split()))
ans=[0 for _ in range(n+1)]
d=[]
for i in range(n+1):
d.append([abs(i-j) for j in range(n+1)])
# print(d[i])
d[x][y]=1
d[y][x]=1
for i in range(1,n+1):
for j in range(i+1,n+1):
d[i][j]=min(d[i][j],d[i][x]+d[x][y]+d[y][j],d[i][y]+d[y][x]+d[x][j])
... | n,x,y=list(map(int,input().split()))
ans=[0 for _ in range(n+1)]
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(y-i)+1+abs(j-x))]+=1
for i in range(1,n):
print((ans[i])) | p02726 |
n,x,y=list(map(int,input().split()))
dist=[[0 for i in range(n)] for j in range(n)]
m=n
connection=[[] for i in range(n)]
for i in range(n-1):
connection[i].append(i+1)
for i in range(1,n):
connection[i].append(i-1)
connection[x-1].append(y-1)
connection[y-1].append(x-1)
def bfs(v):
distance=[-1]*n
... | n,x,y=list(map(int,input().split()))
ct=[0 for i in range(n)]
for i in range(n):
for j in range(i+1,n):
ct[min(j-i,abs(j-y+1)+abs(i-x+1)+1)]+=1
for i in range(1,n):
print((ct[i])) | p02726 |
from collections import defaultdict
N, X, Y = list(map(int, input().split()))
dists = defaultdict(lambda: N)
for k in range(1, N):
for i in range(1 + k, N + 1):
dists[(i - k, i)] = min(dists[(i - k, i)], k)
for i in range(k):
for a, b in (
(X - i, Y + k - 1 - i),
... | N, X, Y = list(map(int, input().split()))
dists = [0] * N
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)
dists[d] += 1
for k in range(1, N):
print((dists[k])) | p02726 |
from collections import *
nxy=input().rstrip().split(" ")
n=int(nxy[0])
x=int(nxy[1])
y=int(nxy[2])
dis=[]
for i in range(1,n):
#print(i)
j=i+1
while j>i and j<=n:
l1=abs(x-i)+1+abs(y-j)
l2=j-i
if l1>=l2:
L=l2
else:
L=l1
#print(... | import collections
nxy=input().rstrip().split(" ")
n=int(nxy[0])
x=int(nxy[1])
y=int(nxy[2])
dis=[]
for i in range(1,n):
#print(i)
j=i+1
while j>i and j<=n:
l1=abs(x-i)+1+abs(y-j)
l2=j-i
if l1>=l2:
L=l2
else:
L=l1
#print(L)
... | p02726 |
import queue
n,x,y = list(map(int,input().split()))
l = [0] * n
for z in range(n):
q = queue.Queue()
q.put(z)
d = [-1] * n
d[z] = 0
while(not q.empty()):
i = q.get()
if(d[i] > 0 and i > z):l[d[i]] += 1
j = i + 1
if(j < n):
if(d[j] == -1):
... | import queue
n,x,y = list(map(int,input().split()))
x -= 1
y -= 1
l = [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+(j-x)])
l[d] += 1
for i in range(1,n):print((l[i])) | p02726 |
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(j-i), abs(X-i-1) + 1 + abs(j+1-Y ), abs(Y-i-1) + 1 + abs(j+1-X))-1]+=1
for i in range(N-1):
print((ans[i])) | 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):
ans[min(abs(j-i), abs(X-i) + 1 + abs(j-Y ), abs(Y-i) + 1 + abs(j-X))-1]+=1
for i in range(N-1):
print((ans[i])) | p02726 |
from collections import deque
Q = deque()
N, X, Y = list(map(int, input().split()))
K = [0 for i in range(N)]
edge = [[]for i in range(N+1)]
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(1, N):
Done = [-1 for j in range(N+... | N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
K = [0 for i in range(N)]
for i in range(N-1):
for j in range(i+1, N):
a = abs(j - i)
b = abs(X - i) + 1 + abs(j - Y)
c = abs(Y - i) + 1 + abs(j - X)
K[min(a, b, c)] += 1
for i in range(1, N):
print((K[i]))
| p02726 |
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
K = [0 for i in range(N)]
for i in range(N-1):
for j in range(i+1, N):
a = abs(j - i)
b = abs(X - i) + 1 + abs(j - Y)
c = abs(Y - i) + 1 + abs(j - X)
K[min(a, b, c)] += 1
for i in range(1, N):
print((K[i]))
| N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
K = [0] * N
for i in range(N-1):
for j in range(i+1, N):
a = abs(j - i)
b = abs(X - i) + 1 + abs(j - Y)
c = abs(Y - i) + 1 + abs(j - X)
K[min(a, b, c)] += 1
for i in range(1, N):
print((K[i]))
| p02726 |
N, X, Y = list(map(int, input().split()))
g = [[] for i in range(N)]
for i in range(N):
u = i
v = i + 1
if v < N:
g[u].append(v)
g[v].append(u)
g[X - 1].append(Y - 1)
g[Y - 1].append(X - 1)
from collections import deque
dis = [[float('Inf')] * N for _ in range(N)]
count = ... | N, X, Y = list(map(int, input().split()))
g = [[] for _ in range(N)]
for i in range(N - 1):
u = i
v = i + 1
g[u].append(v)
g[v].append(u)
g[X - 1].append(Y - 1)
g[Y - 1].append(X - 1)
from collections import deque
dis = [[0] * N for _ in range(N)]
def bfs(i):
visited = [False] * N
... | p02726 |
N, X, Y = list(map(int, input().split()))
g = [[] for i in range(N)]
for i in range(N):
u = i
v = i + 1
if v < N:
g[u].append(v)
g[v].append(u)
g[X - 1].append(Y - 1)
g[Y - 1].append(X - 1)
from collections import deque
dis = [[float('Inf')] * N for _ in range(N)]
count = ... | N, X, Y = list(map(int, input().split()))
g = [[] for i in range(N)]
for i in range(N):
u = i
v = i + 1
if v < N:
g[u].append(v)
g[v].append(u)
g[X - 1].append(Y - 1)
g[Y - 1].append(X - 1)
from collections import deque
dis = [[float('Inf')] * N for _ in range(N)]
count = ... | p02726 |
# -*- coding: utf-8 -*-
if True:
n,x,y = list(map(int, input().split()))
else:
# n=5
# x=2
# y=4
# n=3
# x=1
# y=3
n=7
x=3
y=7
# print(n)
# print(x)
# print(y)
#
ret = [0] * (n-1)
for i in range(1, n):
for j in range(i+1, n+1):
# print(str(i)... | 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):
p1 = j-i
p2 = abs(i - x) + 1 + abs(j - y)
p3 = abs(i - y) + 1 + abs(j - x)
if p1 > p2:
p1 = p2
if p1 > p3:
p1 = p3
ret[p1-1] ... | p02726 |
n, x, y = list(map(int, input().split()))
king_li = []
for i in range(1, n+1):
for j in range(i+1,n+1):
li = []
li.append(abs(y-j)+abs(x-i)+1)
li.append(j-i)
king_li.append(min(li))
for z in range(1,n):
print((king_li.count(z))) | n, x, y = list(map(int, input().split()))
dic={}
for i in range(1, n+1):
for j in range(i+1,n+1):
m = min(abs(y-j)+abs(x-i)+1,j-i)
if m in list(dic.keys()):
dic[m] += 1
else:
dic[m] =1
for z in range(1,n):
if z in list(dic.keys()):
print((dic[... | p02726 |
N, X, Y = list(map(int, input().split()))
minus = []
plus = []
for A in range(1,N):
for B in range(A+1,N+1):
if B - A > abs(X -A) + abs(Y - B) + 1:
minus.append(B-A)
plus.append(abs(X -A) + abs(Y - B) + 1)
for k in range(1,N):
print((N - k - minus.count(k) + plus.count(k... | N, X, Y = list(map(int, input().split()))
ks = [0]*(N-1)
for A in range(1,N):
for B in range(A+1,N+1):
if B - A > abs(X -A) + abs(Y - B) + 1:
ks[B-A-1] -= 1
ks[abs(X -A) + abs(Y - B)] += 1
for k in range(1,N):
print((N - k + ks[k-1])) | p02726 |
def solve(string):
n, x, y = list(map(int, string.split()))
ans = [0] * (n - 1)
for s in range(1, n + 1):
d = [abs(i - s) for i in range(1, n + 1)]
if d[x - 1] < d[y - 1]:
p = y - 1
d[p] = min(d[p], d[x - 1] + 1)
else:
p = x - 1
... | def solve(string):
n, x, y = list(map(int, string.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) + 1 + abs(j - y), abs(y - i) + 1 + abs(j - x))] += 1
return "\n".join(map(str, ans[1:]))
if __name__ == '__main__':
... | p02726 |
if __name__ == '__main__':
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):
l1 = abs(j-i)
l2 = abs(X-i) + 1 + abs(j-Y)
l3 = abs(Y-i) + 1 + abs(j-X)
lm = min(l1,l2,l3)
ans[lm - 1] += 1
for k in range(N-1):
print((ans[k])) | if __name__ == '__main__':
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):
l1 = abs(j-i)
l2 = abs(X-i) + 1 + abs(j-Y)
lm = min(l1,l2)
ans[lm - 1] += 1
for k in range(N-1):
print((ans[k])) | p02726 |
N, X, Y = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for i in range(1, N):
graph[i-1].append(i)
graph[i].append(i-1)
graph[X-1].append(Y-1)
graph[Y-1].append(X-1)
from collections import deque, defaultdict
dic = defaultdict(int)
def bfs(s):
checked = [0]*N
queue = deque(... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, X, Y = mapint()
X, Y = X-1, Y-1
dist = [0]*(N-1)
for i in range(N-1):
for j in range(i+1, N):
d = min(j-i, abs(i-X)+abs(j-Y)+1, abs(i-Y)+abs(j-X)+1)
... | p02726 |
# ANSHUL GAUTAM
# IIIT-D
from math import *
from copy import *
from string import * # alpha = ascii_lowercase
from random import * # l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from bisect import * # bisect_left(arr,x,start,end) => start and end parameters are temporary
from... | # ANSHUL GAUTAM
# IIIT-D
from math import *
from copy import *
from string import * # alpha = ascii_lowercase
from random import * # l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from bisect import * # bisect_left(arr,x,start,end) => start and end parameters are temporary
from... | p02726 |
N, X, Y = list(map(int, input().split()))
from collections import defaultdict
ans = defaultdict(int)
for i in range(N):
for j in range(i + 1, N):
idx = min(j - i, abs(j + 1 - Y) + 1 + abs(X - i - 1))
ans[idx] += 1
for i in range(1, N):
print((ans[i]))
|
from collections import defaultdict
N, X, Y = list(map(int, input().split()))
ctr = defaultdict(int)
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
d = min(j - i, abs(i - X) + 1 + abs(j - Y))
ctr[d] += 1
for i in range(1, N):
print((ctr[i]))
| p02726 |
from collections import defaultdict
N, X, Y = list(map(int, input().split()))
ctr = defaultdict(int)
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
d = min(j - i, abs(i - X) + 1 + abs(j - Y))
ctr[d] += 1
for i in range(1, N):
print((ctr[i]))
|
from collections import defaultdict
N, X, Y = list(map(int, input().split()))
ctr = defaultdict(int)
for u in range(1, N):
for v in range(u + 1, N + 1):
d = min(v - u, abs(u - X) + 1 + abs(Y - v))
ctr[d] += 1
for n in range(1, N):
print((ctr[n]))
| p02726 |
N, x, y = list(map(int, input().split()))
cnt = [0] * (N)
for i in range(1, N+1):
for j in range(i+1, N+1):
temp = min(abs(x-i) + 1 + abs(j-y), abs(y-i) + 1 + abs(j-x))
cnt[min(abs(j-i), temp)] += 1
for i in range(1, N):
print((cnt[i])) | N, x, y = [int(i) for i in input().split()]
cnt = [0] * N
for i in range(1, N+1):
for j in range(i+1, N+1):
temp = min(abs(j-i), abs(x-i) + 1 + abs(j-y), abs(y-i) + 1 + abs(j-x))
cnt[temp] += 1
for i in range(1, N):
print((cnt[i])) | p02726 |
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()... | # encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()... | p02726 |
# coding: utf-8
from copy import deepcopy
import sys
sys.setrecursionlimit(100000)
N, X, Y = list(map(int, input().split()))
# from time import time
# start = time()
# neighbor = {}
# for i in range(1, N):
# neighbor[i] = [i+1]
# for i in range(X+4, Y):
# neighbor[i] = [i-1, i+1]
# neighbo... | # coding: utf-8
N, X, Y = list(map(int, input().split()))
n_k = [0] * (N+1)
for i in range(1, N):
for j in range(i+1, N+1):
n_k[min(abs(j-i), abs(X-i) + 1 + abs(j-Y))] += 1
for k in range(1, N):
print((n_k[k]))
| p02726 |
import sys
import itertools
import queue
input = sys.stdin.readline
sys.setrecursionlimit(100000)
mod = 10 ** 9 + 7
def read_values(): return list(map(int, input().split()))
def read_index(): return [int(x) - 1 for x in input().split()]
def read_list(): return list(read_values())
def read_lists(N): return [r... | import sys
import itertools
import queue
input = sys.stdin.readline
sys.setrecursionlimit(100000)
mod = 10 ** 9 + 7
def read_values(): return list(map(int, input().split()))
def read_index(): return [int(x) - 1 for x in input().split()]
def read_list(): return list(read_values())
def read_lists(N): return [r... | p02726 |
n, x, y = list(map(int, input().split()))
lis = []
for i in range(1, n):
for j in range(i+1, n+1):
lis.append(min([j-i, abs(x-i)+1+abs(y-j), abs(y-i)+1+abs(x-j)]))
for i in range(1, n):
print((lis.count(i))) | n, x, y = list(map(int, input().split()))
lis = [0]*(n-1)
for i in range(1, n):
for j in range(i+1, n+1):
lis[min([j-i, abs(x-i)+1+abs(y-j), abs(y-i)+1+abs(x-j)])-1] += 1
for i in range(n-1):
print((lis[i])) | p02726 |
import queue
def main():
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans = [0]*n
t = [[i+1, i-1] for i in range(n)]
t[x].append(y)
t[y].append(x)
for i in range(n):
for j in range(i+1, n):
if j <= x:
ans[j-i] += 1
e... | def main():
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(x-i)+abs(y-j)+1)] += 1
for v in ans[1:]:
print(v)
if __name__ == "__main__":
main()
| p02726 |
import sys
read = sys.stdin.read
from itertools import chain
from collections import Counter
def main():
def warshall_floyd(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])
# 更新したdを返す。d[i]... | from collections import defaultdict
def main():
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
klist = defaultdict(int)
for i in range(n):
for j in range(i+1, n):
if (i <= x and j <= x) or (y <= i and y <= j):
k = j - i
klist[k] ... | p02726 |
import sys
sys.setrecursionlimit(1000000000)
from collections import Counter
def key(x, y):
return str(x)+str(y)
def main2():
# TLE
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
M = {}
for i in range(N):
for j in range(i, N):
M[key(i, j)] = j - i
... | import sys
sys.setrecursionlimit(1000000000)
from collections import Counter
def key(x, y):
return str(x)+str(y)
def main2():
# TLE
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
M = {}
for i in range(N):
for j in range(i, N):
M[key(i, j)] = j - i
... | p02726 |
# D - Line++
def main():
N, X, Y = list(map(int, input().split()))
dist = [0] * N
calc_min_dist = lambda x, y: min(
y - x, abs(X - x) + abs(y - Y) + 1, abs(Y - x) + abs(y - X) + 1
)
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
dist[calc_min_dist(i, j)]... | # D - Line++
def main():
N, X, Y = list(map(int, input().split()))
dist = [0] * N
calc_min_dist = lambda x, y: min(
y - x, abs(X - x) + abs(y - Y) + 1, abs(Y - x) + abs(y - X) + 1
) # assume x < y
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
dist[calc... | p02726 |
# D - Line++
def main():
N, X, Y = list(map(int, input().split()))
dist_cnt = [0] * N
calc_min_dist = lambda x, y: min(y - x, abs(X - x) + abs(Y - y) + 1) # assume x < y
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
dist_cnt[calc_min_dist(i, j)] += 1
print(("\n... | # D - Line++
def main():
N, X, Y = list(map(int, input().split()))
dist_cnt = [0] * N
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
dist_cnt[min(j - i, abs(X - i) + abs(j - Y) + 1)] += 1
print(("\n".join(map(str, dist_cnt[1:]))))
if __name__ == "__main__":
... | p02726 |
n,x,y = list(map(int,input().split()))
arr = [0] * (n-1)
for i in range(1,n):
for j in range(i+1,n+1):
arr[min((j-i),abs(i-x)+1+abs(j-y),abs(i-y)+1+abs(j-x)) - 1] += 1
for i in arr:
print(i) | 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):
ans[min((j-i),abs(i-x)+1+abs(j-y),abs(i-y)+1+abs(j-x))-1] += 1
for i in ans:
print(i) | p02726 |
#!/usr/bin/env python
# coding: utf-8
# In[18]:
N,X,Y = list(map(int, input().split()))
# In[19]:
for k in range(1,N):
ans = 0
for i in range(1,N+1):
for j in range(i+1,N+1):
dist = min(j-i,abs(X-i)+abs(Y-j)+1,abs(Y-i)+abs(X-j)+1)
if dist == k:
... | #!/usr/bin/env python
# coding: utf-8
# In[21]:
N,X,Y = list(map(int, input().split()))
# In[24]:
ans = [0]*N
for i in range(1,N):
for j in range(i+1,N+1):
dist = min(j-i,abs(X-i)+abs(Y-j)+1,abs(Y-i)+abs(X-j)+1)
ans[dist] += 1
for i in range(1,N):
print((ans[i]))
# ... | p02726 |
import sys
import itertools
from collections import Counter
sys.setrecursionlimit(10**6)
def DFS(i,v,d):
global dist
if d > N:
return
# 頂点vに隣接する頂点でvより大きいものが未発見
for u in adj[v]:
# distは最短距離なので上書き禁止
if i != u:
#print(i,u,d)
if dist[i][u] > d:
dist[i][u] = d
... | N, X, Y = list(map(int, input().split()))
ans = [0] * N
for i in range(N):
for j in range(i+1, N):
tmp = min(j-i, abs(X-1-i) + 1 + abs(Y-1-j))
ans[tmp] += 1
for k in range(1,N):
print((ans[k])) | p02726 |
import heapq
def inpl():
return list(map(int, input().split()))
class Graph:
def __init__(self):
self.edge = {}
self.cost = {}
self.vertex = set()
return
def addEdgeCost(self, i, j, c, directed=False):
self.vertex.add(i)
self.vertex.add(j)... | def inpl():
return list(map(int, input().split()))
N, X, Y = inpl()
X -= 1
Y -= 1
ans = {}
for i in range(N):
for j in range(i + 1, N):
c = min(j - i, abs(i - X) + 1 + abs(j - Y), abs(i - Y) + 1 + abs(j - X))
ans[c] = ans.get(c, 0) + 1
for i in range(1, N):
print((ans.get(i,... | p02726 |
n,x,y=list(map(int,input().split()))
x+=-1
y+=-1
k=[]
z=0
for i in range(n):
k.append(0)
for i in range(n-1):
for j in range(i+1,n):
z=min(abs(x-i)+1+abs(j-y),abs(x-i)+abs(j-x),abs(y-i)+abs(j-y),j-i)
k[z]+=1
z=0
for i in range(1,n):
print((k[i])) | n,x,y=list(map(int,input().split()))
x+=-1
y+=-1
k=[]
z=0
for i in range(n):
k.append(0)
for i in range(n-1):
for j in range(i+1,n):
z=min(abs(x-i)+1+abs(j-y),abs(y-i)+1+abs(j-x),j-i)
k[z]+=1
z=0
for i in range(1,n):
print((k[i])) | p02726 |
N,X,Y = list(map(int,input().split()))
cc = []
for i in range(1,N+1):
for j in range(i+1,N+1):
cc.append(min(j-i,abs(X-i)+1+abs(Y-j)))
for i in range(1,N):
print((cc.count(i))) | N,X,Y = list(map(int,input().split()))
cc = [0]*(N-1)
for i in range(1,N+1):
for j in range(i+1,N+1):
cc[min(j-i,abs(X-i)+1+abs(Y-j))-1] += 1
for i in cc:
print(i)
| p02726 |
n,x,y = list(map(int,input().split()))
cnt_l = [0 for i in range(0,n)]
from collections import deque
def bfs(start):
queue = deque()
queue.append([start,0])
isNotSearched = [False]*(n+1)
while(len(queue)>0):
i,cnt = queue.popleft()
if(isNotSearched[i]):
... | n,x,y = list(map(int,input().split()))
cnt_l = [0]*n
from collections import deque
def bfs(start):
queue = deque()
queue.append([start,0])
isSearched = [False]*(n+1)
while(len(queue)>0):
i,cnt = queue.popleft()
if(isSearched[i]):
continue
... | p02726 |
n,x,y = list(map(int,input().split()))
cnt_l = [0]*n
from collections import deque
def bfs(start):
queue = deque()
queue.append([start,0])
isSearched = [False]*(n+1)
while(len(queue)>0):
i,cnt = queue.popleft()
if(isSearched[i]):
continue
... | n,x,y = list(map(int,input().split()))
cnt_l = [0]*n
from collections import deque
def bfs(start):
queue = deque()
queue.append(start)
isSearched = [-1]*(n+1)
isSearched[start] = 0
while(len(queue)>0):
i = queue.popleft()
cnt = isSearched[i]
if(i==x):
... | p02726 |
n,x,y = list(map(int,input().split()))
cnt_l = [0]*n
from collections import deque
def bfs(start):
queue = deque()
queue.append(start)
isSearched = [-1]*(n+1)
isSearched[start] = 0
while(len(queue)>0):
i = queue.popleft()
cnt = isSearched[i]
if(i==x):
... | n,x,y = list(map(int,input().split()))
cnt_l = [0]*n
from collections import deque
def bfs(start):
queue = deque()
queue.append(start)
isSearched = [-1]*(n+1)
isSearched[start] = 0
while(queue):
i = queue.popleft()
cnt = isSearched[i]
if(i==x):
nex_l =... | p02726 |
from collections import Counter
n,x,y=list(map(int,input().split()))
x-=1
y-=1
dist=[]
for i in range(n-1):
for j in range(i+1,n):
dist.append(min(j-i,abs(i-x)+1+abs(j-y)))
c=Counter(dist)
for i in range(1,n):
print((c[i])) | n,x,y=list(map(int,input().split()))
x-=1
y-=1
dist=[0 for i in range(n)]
for i in range(n-1):
for j in range(i+1,n):
dist[min(j-i,abs(x-i)+1+abs(y-j))]+=1
for i in dist[1:]:
print(i) | p02726 |
# coding: utf-8
import sys
import math
import collections
import itertools
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(eval(input()))
def LI() : ... | # coding: utf-8
import sys
import math
import collections
import itertools
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return... | p02726 |
import sys
def input() -> str:
return sys.stdin.readline().rstrip("\r\n")
def main():
def min_dest(a, b):
return min(b-a, abs(x-a)+1+abs(y-b), abs(x-b)+1+abs(y-a))
n, x, y = list(map(int, input().split()))
x, y = x-1, y-1
ans = [0] * (n-1)
for i in range(n):
... | import sys
def input() -> str:
return sys.stdin.readline().rstrip("\r\n")
def main():
def min_dest(a, b):
return min(b-a, abs(x-a)+1+abs(y-b))
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, ... | p02726 |
K,X,Y = (int(x) for x in input().split())
num = K*(K-1)/2
distance = [0] *int(num)
ct = 0
for i in range(1,K):
for j in range (i+1,K+1):
distance[ct] = min(j-i,abs(i-X)+abs(j-Y)+1)
ct += 1
for k in range (1,K):
print((distance.count(k))) | K,X,Y = (int(x) for x in input().split())
ans = [0] * K
ct = 0
for i in range(1,K):
for j in range (i+1,K+1):
ans[min(j-i,abs(i-X)+abs(j-Y)+1)] += 1
for k in range (1,K):
print((ans[k])) | p02726 |
n, x, y = list(map(int, input().split()))
a = []
for s in range(1, n): #start
for g in range(s+1, n+1): #goal
a.append(min(g-s, abs(x-s)+1+abs(g-y), abs(y-s)+1+abs(g-x)))
#print(a)
for i in range(1, n):
print((a.count(i))) | n, x, y = list(map(int, input().split()))
a = [0 for i in range(n)]
for s in range(1, n): #start
for g in range(s+1, n+1): #goal
a[min(g-s, abs(x-s)+1+abs(g-y), abs(y-s)+1+abs(g-x))] += 1
#print(a)
for i in range(1, n):
print((a[i])) | p02726 |
#６回目、2020-0612
#2重ループ ＋O(1)
#i,jがループの中か外で場合分け
#初期入力
N, x, y = list(map(int, input().split()))
ans ={i:[]for i in range(1,N)}
for i in range(1,N):
for j in range(i+1,N+1):
#（i,jがループより共に左、ともに右）
if (j <=x or y <=i) :
ans[j-i].append((i,j))
# （iがループより左 and jがループより右）
... | #６回目、2020-0612
#2重ループ ＋O(1)
#i,jがループの中か外で場合分け
#初期入力
N, x, y = list(map(int, input().split()))
ans ={i:0 for i in range(1,N)}
for i in range(1,N):
for j in range(i+1,N+1):
#（i,jがループより共に左、ともに右）
if (j <=x or y <=i) :
ans[j-i] +=1
# （iがループより左 and jがループより右）
el... | p02726 |
#６回目、2020-0612
#2重ループ ＋O(1)
#i,jがループの中か外で場合分け
#初期入力
N, x, y = list(map(int, input().split()))
ans ={i:0 for i in range(1,N)}
for i in range(1,N):
for j in range(i+1,N+1):
#（i,jがループより共に左、ともに右）
if (j <=x or y <=i) :
ans[j-i] +=1
# （iがループより左 and jがループより右）
el... | #６回目、2020-0612
#2重ループ ＋O(1)
#場合分けを近道と通常のみ（絶対値を使う）
#初期入力
N, x, y = list(map(int, input().split()))
normal =0
short =0
ans ={i:0 for i in range(1,N)}
for i in range(1,N):
for j in range(i+1,N+1):
normal =j -i
short =abs(x-i) +1 +abs(j-y)
dist =min(normal,short)
ans[... | 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):
ans[min(min(j-i,abs(x-i)+1+abs(j-y)),abs(y-i)+1+abs(j-x))-1]+=1
for i in range(n-1):
print((ans[i])) | 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):
ans[min(j-i,abs(x-i)+1+abs(j-y),abs(y-i)+1+abs(j-x))-1]+=1
for i in range(n-1):
print((ans[i])) | p02726 |
N,X,Y = list(map(int,input().split()))
def f(i,j):
if j <= X:
return j-i
elif Y <= i:
return j-i
elif X <= i and j <= Y:
return min(j-i,(i-X)+1+(Y-j))
elif i <= X and Y <= j:
return (X-i)+1+(j-Y)
elif i <= X and X <= j and j <= Y:
return (X-i)+min(j-X,1+(Y-j))
else:
re... | N,X,Y = list(map(int,input().split()))
def f(i,j):
if j <= X:
return j-i
elif Y <= i:
return j-i
elif X <= i and j <= Y:
return min(j-i,(i-X)+1+(Y-j))
elif i <= X and Y <= j:
return (X-i)+1+(j-Y)
elif i <= X and X <= j and j <= Y:
return (X-i)+min(j-X,1+(Y-j))
else:
re... | p02726 |
n,x,y=list(map(int,input().split()))
dis=[0]*(n-1)
for i in range(1,n):
for j in range(i+1,n+1):
d=min(j-i,min(abs(j-x)+1+abs(i-y),abs(j-y)+1+abs(i-x)))
dis[d-1]+=1
for i in dis:
print(i) | n,x,y=list(map(int,input().split()))
dis=[0]*(n-1)
for i in range(1,n):
for j in range(i+1,n+1):
d=j-i
if d>abs(j-x)+1+abs(i-y):
d=abs(j-x)+1+abs(i-y)
if d>abs(j-y)+1+abs(i-x):
d=abs(j-y)+1+abs(i-x)
dis[d-1]+=1
for i in dis:
print(i) | p02726 |
from collections import defaultdict
N, X, Y = list(map(int, input().split()))
dic = defaultdict(int)
X = X - 1
Y = Y - 1
for i in range(N):
for j in range(i + 1, N):
if i <= X and Y <= j:
v = X - i + 1 + j - Y
elif (i <= X) and (X <= j and j <= Y):
v = min(j -... | N, X, Y = list(map(int, input().split()))
dic = {}
X = X - 1
Y = Y - 1
for i in range(N):
for j in range(i + 1, N):
if i <= X and Y <= j:
v = X - i + 1 + j - Y
elif (i <= X) and (X <= j and j <= Y):
v = min(j - i, X - i + 1 + Y - j)
elif (X <= i and ... | p02726 |
# D - Line++
from collections import deque
INF = 1001001001
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans = [0]*n
for i in range(n):
dist = [INF]*n
q = deque()
dist[i] = 0
q.append(i)
while len(q)>0:
v = q.popleft()
d = dist[v]
if v-1 ... | # D - Line++
from collections import deque
INF = 1001001001
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans = [0]*n
for i in range(n):
dist = [INF]*n
q = deque()
dist[i] = 0
q.append(i)
while len(q)>0:
v = q.popleft()
d = dist[v]
if v-1 ... | p02726 |
N, X, Y= list(map(int, input().split()))
List=[]
for i in range(1,N+1,1):
for j in range(i,N+1,1):
saitan = min(abs(i-j), abs(i-X)+abs(Y-j)+1, abs(i-Y)+abs(X-j)+1)
List.append(saitan)
for i in range(1,N):
print((List.count(i))) | N, X, Y= list(map(int, input().split()))
List=N*[0]
for i in range(1,N+1,1):
for j in range(i,N+1,1):
saitan = min(abs(i-j), abs(i-X)+abs(Y-j)+1, abs(i-Y)+abs(X-j)+1)
List[saitan] += 1
for i in range(1,N):
print((List[i])) | p02726 |
N, X, Y = list(map(int, input().split()))
dist_list = []
for i in range(1, N+1):
for j in range(i+1, N+1):
dist_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((dist_list.count(k))) | N, X, Y = list(map(int, input().split()))
result = [0]*N
for i in range(1, N+1):
for j in range(i+1, N+1):
result[min([j-i,abs(X-i)+1+abs(j-Y),abs(Y-i)+1+abs(j-X)])-1]+=1
s = '\n'.join(map(str, result[:-1]))
print(s) | p02726 |
import copy
N, X, Y = list(map(int, input().split()))
def check(num, distance):
if num!=0:
distance[num-1]=min(distance[num]+1, distance[num-1])
if num!=N-1:
distance[num+1]=min(distance[num+1], distance[num]+1)
if num==X-1:
distance[Y-1]=min(distance[Y-1], distance[X-1]+1)... | N, X, Y=list(map(int, input().split()))
answer=[0]*(N-1)
#i, j from 1 to N
for i in range(1, N):
for j in range(i+1, N+1):
temp=min(abs(j-i), abs(j-Y)+1+abs(X-i)) #, abs(j-X)+1+abs(Y-i)
#print(i, j, temp)
answer[temp-1]+=1
for val in answer:
print(val) | p02726 |
from collections import deque
from collections import Counter
n,x,y = list(map(int, input().split()))
x-=1
y-=1
dis=[['NONE']*n for i in range(n)]
d = deque()
for i in range(n):
d.append((i,0))
c=0
while d:
p,j=d.popleft()
if p==x and c==0:
d.append((y,j+1))
... | from collections import Counter
n,x,y = list(map(int, input().split()))
x-=1
y-=1
dis=[]
for i in range(n-1):
for j in range(i,n):
dis.append(min(abs(i-j),abs(i-x)+abs(j-y)+1,abs(i-y)+abs(j-x)+1))
c=Counter(dis)
for i in range(1,n):
print((c[i]))
| p02726 |
from collections import deque
n,x,y=list(map(int,input().split()))
x,y=x-1,y-1
e = [[2*10**3+1]*n for _ in range(n)]
for i in range(n):
e[i][i] = 0
def main():
for i in range(n):
s = deque([i]) # サーチstack. 初期条件を設定
dfs(s, e[i])
#print(e)
ans = [0]*n
for i,ee in enumer... | from collections import Counter
def main():
n,x,y=list(map(int,input().split()))
x,y=x-1,y-1
ans=[]
for i in range(n):
dp = [n]*n
dp[i] = 0
calcstep(i, dp)
dp[y] = min(dp[y], dp[x]+1)
dp[x] = min(dp[x], dp[y]+1)
calcstep(x, dp)
calcstep... | p02726 |
import queue
N, X, Y = list(map(int, input().split()))
X, Y = X - 1, Y - 1
ans = [0] * (N + 1)
def push(q, dist, index, dist_v):
if dist[index] != -1:
return
q.put(index)
dist[index] = dist_v
for i in range(N):
q = queue.Queue()
dist = [-1] * N
push(q, dist, i, 0)
... | from collections import deque
N, X, Y = list(map(int, input().split()))
X, Y = X - 1, Y - 1
ans = [0] * (N + 1)
def push(q, dist, index, dist_v):
if dist[index] != -1:
return
q.appendleft(index)
dist[index] = dist_v
for i in range(N):
q = deque()
dist = [-1] * N
push(... | p02726 |
N, X, Y = list(map(int, input().split()))
X = X-1
Y = Y-1
for kIndx in range(1, N):
kNum = 0
for jIndx in range(N):
for iIndx in range(jIndx):
if (jIndx <= X) or (iIndx >= Y):
if jIndx - iIndx == kIndx:
kNum += 1
elif (iIndx <= ... | N, X, Y = list(map(int, input().split()))
X = X-1
Y = Y-1
kDict = {}
for kIndx in range(1, N+1):
kDict[kIndx] = 0
for jIndx in range(N):
for iIndx in range(jIndx):
if (jIndx <= X) or (iIndx >= Y):
kDict[jIndx - iIndx] += 1
elif (iIndx <= X) and (jIndx >= Y):
... | p02726 |
n, x, y = list(map(int,input().split()))
d = [0 for i in range(1,n)]
for i in range(1,n+1):
for j in range(1,n+1):
if i < j:
d[min([j-i, abs(x-i) + 1 + abs(j-y), abs(y-i) + 1 + abs(j-x)])-1] += 1
for i in d:
print(i) | n, x, y = list(map(int,input().split()))
d = [0 for i in range(n-1)]
for i in range(1,n+1):
for j in range(i+1,n+1):
d[min([j-i, abs(x-i) + 1 + abs(j-y), abs(y-i) + 1 + abs(j-x)])-1] += 1
for i in d:
print(i) | p02726 |
import math
n, x, y = list(map(int,input().split()))
num = [0 for i in range(n)]
for i in range(n):
for j in range(i+1,n):
num[min([j-i,int(math.fabs(j-y+1))+1+int(math.fabs(i-x+1))])] += 1
for i in range(1,n):
print((num[i]))
| n, x, y = list(map(int,input().split()))
num = [0 for i in range(n)]
for i in range(1,n+1):
for j in range(i+1,n+1):
ban = min([j-i,abs(x-i)+1+abs(y-j)])
num[ban] += 1
for i in range(1,n):
print((num[i]))
| p02726 |
n, x, y = list(map(int, input().split()))
dp = [[0 for _ in range(n)] for _ in range(n)]
ans = [0 for _ in range(n-1)]
for i in range(1, n):
for j in range(i+1, n+1):
a = min(j-i, abs(x-i)+abs(y-j)+1, abs(x-j)+abs(y-i)+1)
ans[a-1] += 1
for i in range(n-1):
print((ans[i])) | n, x, y = list(map(int, input().split()))
ans = [0 for _ in range(n-1)]
for i in range(1, n):
for j in range(i+1, n+1):
a = min(j-i, abs(x-i)+abs(y-j)+1, abs(x-j)+abs(y-i)+1)
ans[a-1] += 1
for i in range(n-1):
print((ans[i])) | p02726 |
from collections import Counter
class Dijkstra():
""" ダイクストラ法
重み付きグラフにおける単一始点最短路アルゴリズム
* 使用条件
- 負のコストがないこと
- 有向グラフ、無向グラフともにOK
* 計算量はO(E*log(V))
* ベルマンフォード法より高速なので、負のコストがないならばこちらを使うとよい
"""
class Edge():
""" 重み付き有向辺 """
def __init__(self,... | from collections import Counter
class Dijkstra():
""" ダイクストラ法
重み付きグラフにおける単一始点最短路アルゴリズム
* 使用条件
- 負のコストがないこと
- 有向グラフ、無向グラフともにOK
* 計算量はO(E*log(V))
* ベルマンフォード法より高速なので、負のコストがないならばこちらを使うとよい
"""
class Edge():
""" 重み付き有向辺 """
def __init__(self,... | p02726 |
#import pysnooper
#import numpy
#import os,re,sys,operator
#from collections import Counter,deque
#from operator import itemgetter,mul
#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations
from sys import stdin,setrecursionlimit
#from bisect import bisect_left,bisect_r... | #import pysnooper
#import numpy
#import os,re,sys,operator
#from collections import Counter,deque
#from operator import itemgetter,mul
#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations
from sys import stdin,setrecursionlimit
#from bisect import bisect_left,bisect_r... | p02726 |
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):
if (not used[i]) and (v == -1):
... | def main():
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans_list = [0]*n
for i in range(n):
for j in range(i,n):
ans_list[min(abs(i-j), abs(i-x)+abs(j-y)+1, abs(j-x)+abs(i-y)+1)] += 1
for i in range(1,n):
print((ans_list[i]))
if __name_... | p02726 |
n, x, y = list(map(int,input().split()))
ans = []
for i in range(1,n+1):
for j in range(i+1,n+1):
ans.append(min(j-i,abs(x-i)+1+abs(y-j)))
for k in range(1,n):
print((ans.count(k)))
| n, x, y = list(map(int,input().split()))
ans = [0]*(n-1)
for i in range(1,n+1):
for j in range(i+1,n+1):
ans[min(j-i,abs(x-i)+1+abs(y-j))-1] += 1
#ans.append(min(j-i,abs(x-i)+1+abs(y-j)))
for k in range(n-1):
print((ans[k]))
| p02726 |
import sys
from collections import OrderedDict
sys.setrecursionlimit(10 ** 6) # 再帰関数の再帰の深さを設定
to_index = lambda x: int(x) - 1 # 入力した数字に1を引いたものを返す
print_list_in_2D = lambda x: print(*x, sep="\n") # リストの要素を改行を挟んで表示する関数
# 入力を整数に変換して受け取る
def input_int():
return int(input())
def map_int_input():
... | import sys
sys.setrecursionlimit(10 ** 6) # 再帰関数の再帰の深さを設定
to_index = lambda x: int(x) - 1 # 入力した数字に1を引いたものを返す
print_list_in_2D = lambda x: print(*x, sep="\n") # リストの要素を改行を挟んで表示する関数
# 入力を整数に変換して受け取る
def input_int():
return int(input())
def map_int_input():
return map(int, input())
MII = map_i... | p02726 |
#n=int(input())
n,x,y=list(map(int,input().split()))
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
adjl=[[0 for i in range(n)] for j in range(n)]
dic={}
for i in range(n):
for j in range(i,n):
#if i>=j:
# continue
dis=j-i
... | #n=int(input())
n,x,y=list(map(int,input().split()))
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
#adjl=[[0 for i in range(n)] for j in range(n)]
dic={}
for i in range(n):
for j in range(i,n):
#if i>=j:
# continue
dis=j-i
... | p02726 |
n, x, y = list(map(int, input().split()))
x = x - 1
y = y - 1
kl = [0] * (n - 1)
for s in range(n - 1):
for e in range(s+1, n):
d = e-s
if (e <= x)or(s >= y):
kl[d - 1] += 1
else:
kl[min(d, abs(s-x)+abs(e-y)+1)-1] += 1
for i in kl:
print(i)
| n, x, y = list(map(int, input().split()))
x = x - 1
y = y - 1
kl = [0] * (n - 1)
for s in range(n - 1):
for e in range(s+1, n):
d = e-s
kl[min(d, abs(s-x)+abs(e-y)+1)-1] += 1
for i in kl:
print(i)
| p02726 |
import queue
n, x, y = list(map(int, input().split()))
graph = {i: [] for i in range(1, n + 1)}
graph[x].append(y)
graph[y].append(x)
for i in range(1, n):
graph[i].append(i + 1)
graph[i + 1].append(i)
tf = [[False] * (n + 1) for i in range(n + 1)]
ans = [0] * (n + 1)
def bfs(v):
q = queue.Qu... | 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):
sub = min(abs(j - i), abs(x - i) + 1 + abs(j - y), abs(y - i) + 1 + abs(j - x))
ans[sub] += 1
for i in range(1, n):
print((ans[i])) | p02726 |
import queue
n,x,y = list(map(int,input().split()))
adj = [[] for i in range(n)]
adj[x-1].append(y-1)
adj[y-1].append(x-1)
for i in range(n-1):
adj[i].append(i+1)
adj[i+1].append(i)
ans = [0 for _ in range(n+1)]
def bfs(start):
inf = 1001001001
q = queue.Queue()
q.put(... | from collections import deque
n,x,y = list(map(int,input().split()))
adj = [[] for i in range(n)]
adj[x-1].append(y-1)
adj[y-1].append(x-1)
for i in range(n-1):
adj[i].append(i+1)
adj[i+1].append(i)
ans = [0 for _ in range(n)]
def bfs(start):
inf = 1001001001
q = deque()
... | p02726 |
n,x,y = list(map(int, input().split()))
import collections
g = [[] for i in range(n)]
for i in range(n):
if i != 0:
g[i].append(i-1)
if i != n-1:
g[i].append(i+1)
g[x-1].append(y-1)
g[y-1].append(x-1)
inf = 10**5
dp = [[inf for i in range(n)] for j in range(n)]
todo = collectio... | n,x,y = list(map(int, input().split()))
ans = [0]*(n-1)
for j in range(1, n+1):
for i in range(1, j):
dis = min(j-i, abs(x-i)+1+abs(j-y), abs(y-i)+1+abs(j-x))
ans[dis-1] += 1
for i in ans:
print(i)
| p02726 |
# -*- coding: utf-8 -*-
"""
Created on Sat Mar 28 20:51:45 2020
@author: naoki
"""
from collections import deque
N, X, Y = list(map(int,input().split()))
distance_count = [0] * (N + 1)
route = [[i-1, i+1] for i in range(N+1)]
del route[-1][-1]
All_distances = [0]*N
route[X].append(Y)
route[Y].append... | # -*- coding: utf-8 -*-
"""
Created on Sat Mar 28 20:51:45 2020
@author: naoki
"""
from collections import deque
N, X, Y = list(map(int,input().split()))
distance_count = [0] * (N + 1)
route = [[i-1, i+1] for i in range(N+1)]
del route[-1][-1]
All_distances = [0]*N
route[X].append(Y)
route[Y].append... | p02726 |
n,x,y = (int(x) for x in input().split())
x-=1
y-=1
middle=(y+x)/2
list=[[0 for i in range(n)]for j in range(n)]
dic={}
for i in range(n-1):
for j in range(i+1,n):
if i<=x and j<=x:
k = j-i
if k not in dic:
dic[k]=1
else:
dic[k]+=1
... | n,x,y = (int(x) for x in input().split())
x-=1
y-=1
middle=(y+x)/2
dic={}
for i in range(n-1):
for j in range(i+1,n):
if i<=x and j<=x:
k = j-i
if k not in dic:
dic[k]=1
else:
dic[k]+=1
elif j==middle:
k = j-i
... | p02726 |
N,X,Y = list(map(int,input().split()))
ans = [0 for i in range(N+1)]
for i in range(1,N):
checking = i
#まずスタート地点から幅優先探索を実装
queue = [[i,0]]
if i >= Y:
checked = list(range(1,i+1))
elif i <= X:
checked = list(range(1,i+1))
else:
checked = list(range(1,X))... | N,X,Y = list(map(int,input().split()))
ans = [0 for i in range(N+1)]
def calc_goal(start,goal):
if goal <= X:
return goal-start
if goal <= Y:
if X >= start:
return min(goal-start,X-start+Y-goal+1)
else:
return min(start-X+Y-goal+1,goal-start)
els... | p02726 |
N, X, Y = list(map( int, input().split(" ")))
dlist = []
for i in range(1,N+1):
for j in range(i,N+1):
dis = min( abs(j-i), abs(X-i) +1+abs(j-Y), abs(Y-i) +1+abs(j-X) )
dlist.append(dis)
for i in range(1,N):
cnt = 0
for val in dlist:
if( val == i ):
cnt+=1
print( cnt )
| 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):
dis = min( abs(j-i), abs(X-i) +1+abs(j-Y), abs(Y-i) +1+abs(j-X) )
ans[dis]+=1
for i in range(1,N):
print(( ans[i] )) | p02726 |
N,X,Y=list(map(int,input().split()))
def dist(i,j):
return min([j-i,abs(X-1-i)+1+abs(Y-1-j),abs(Y-1-i)+1+abs(X-1-j)])
dists = []
for i in range(N-1):
for j in range(i+1,N):
dists.append(dist(i,j))
for i in range(1,N):
print((len([str(v) for v in dists if v == i])))
| N,X,Y=list(map(int,input().split()))
def dist(i,j):
return min([j-i,abs(X-1-i)+1+abs(Y-1-j),abs(Y-1-i)+1+abs(X-1-j)])
dists = {v:0 for v in range(1,N)}
for i in range(N-1):
for j in range(i+1,N):
d = dist(i,j)
dists[d]+=1
for i in range(1,N):
print((dists[i]))
| p02726 |
n,x,y = list(map(int,input().split()))
ps = []
for i in range(n):
for j in range(i):
ps.append([j+1,i+1])
dists = [0]*(n)
for p in ps:
dist = min(abs(p[0]-p[1]),abs(p[0]-x)+1+abs(p[1]-y),abs(p[1]-x)+1+abs(p[0]-y))
dists[dist] = dists[dist]+1
for i in range(len(dists) - 1):
print((d... | n,x,y = list(map(int,input().split()))
dists = [0]*(n)
for i in range(n):
for j in range(i):
dist = min(abs(i-j),abs((i+1)-x)+1+abs((j+1)-y),abs((j+1)-x)+1+abs((i+1)-y))
dists[dist] = dists[dist]+1
for i in range(len(dists) - 1):
print((dists[i+1])) | p02726 |
n,x,y = list(map(int,input().split()))
dists = [0]*(n)
for i in range(1,n+1):
for j in range(1,i):
dists[min(abs(i-j),abs(i-x)+1+abs(j-y),abs(j-x)+1+abs(i-y))]+=1
for i in range(1,len(dists)):
print((dists[i])) | n,x,y = list(map(int,input().split()))
dists = [0]*(n)
for i in range(1,n+1):
for j in range(1,i):
dists[min(i-j,abs(j-x)+1+abs(i-y))]+=1
for i in range(1,len(dists)):
print((dists[i])) | p02726 |
# N=頂点数、X,Y=座標
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
# 未セットの値
INF = 10**4
# キューデータ(次の値、最短距離)
queue_list = []
# 最短距離ごとのリスト
min_e_list = [0 for i in range(N)]
for i in range(N):
# キューデータ初期値をセット
queue_list.append([i, 0])
# 最短距離リスト(最短距離)
min_dist_list = [INF for i in ... | # N=頂点数、X,Y=座標
N, X, Y = list(map(int, input().split()))
# 最短距離データ
min_dist_list = [0 for i in range(N+1)]
for i in range(1,N+1):
for j in range(i+1, N+1):
t_dist = min(abs(j-i), 1+abs(X-i)+abs(Y-j), 1+abs(Y-i)+abs(X-j))
min_dist_list[t_dist] += 1
for i in range(1, N)... | p02726 |
from collections import defaultdict, deque
import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
... | import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return i... | p02726 |
import math
nums = [int(i) for i in input().split()]
n = nums[0]
x = nums[1]
y = nums[2]
res = {}
for i in range(1, n):
res[i] = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
dis = j - i
disI = min(abs(i-x), abs(i-y))
disJ = min(abs(j-x), abs(j-y))
dis = min(di... | import math
nums = [int(i) for i in input().split()]
n = nums[0]
x = nums[1]
y = nums[2]
res = [0 for i in range(2010)]
for i in range(1, n+1):
for j in range(i+1, n+1):
dis = j - i
dis = min(dis, abs(i-x)+abs(j-y)+1)
res[dis] += 1
for i in range(1, n):
print((res[i]))
| p02726 |
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans_l = [0]*n
for i in range(n):
for j in range(i, n):
k = min(abs(j-i), abs(x-i)+1+abs(y-j), abs(x-j)+1+abs(y-i))
ans_l[k] += 1
for ans in ans_l[1:]:
print(ans) | n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans_l = [0]*n
def min_dist(a,b):
return min(b-a, abs(x-a)+1+abs(y-b), abs(x-b)+1+abs(y-a))
for i in range(n):
for j in range(i, n):
k = min_dist(i,j)
ans_l[k] += 1
for ans in ans_l[1:]:
print(ans) | p02726 |
n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans_l = [0]*n
def min_dist(a,b):
return min(b-a, abs(x-a)+1+abs(y-b), abs(x-b)+1+abs(y-a))
for i in range(n):
for j in range(i, n):
k = min_dist(i,j)
ans_l[k] += 1
for ans in ans_l[1:]:
print(ans) | n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
ans_l = [0]*n
def min_dist(a,b):
return min(b-a, abs(x-a)+1+abs(y-b), abs(x-b)+1+abs(y-a))
for i in range(n):
for j in range(i, n):
ans_l[min_dist(i,j)] += 1
for ans in ans_l[1:]:
print(ans) | p02726 |
from heapq import heappush, heappop
n, x, y = list(map(int, input().split()))
links = [[] for i in range(n)]
for i in range(1, n):
links[i-1].append(i)
links[i].append(i-1)
links[x-1].append(y-1)
links[y-1].append(x-1)
ans = [0] * (n+1)
for i in range(n):
dist = [1e5] * n
... | n, x, y = list(map(int, input().split()))
ans = [0] * (n+1)
for i in range(1, n+1):
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 |
def main():
n, x, y = map(int, input().split())
ans = [0] * (n+1)
d = list()
for i in range(1, n):
for j in range(i+1, n+1):
# x->yを通らない
d1 = abs(j-i)
# i->x->y->jの順 +1はx->yの分
d2 = abs(x-i) + 1 + abs(j-y)
# i->y->x->jの順 +1はy-... | def main():
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):
# x->yを通らない
d1 = abs(j-i)
# i->x->y->jの順 +1はx->yの分
d2 = abs(x-i) + 1 + abs(j-y)
# i->y->x->jの順 +1はy->xの分
... | p02726 |
n,x,y = list(map(int,input().split()))
x -= 1
y -= 1
dis = [[0 for i in range(n)]for j in range(n)]
for i in range(n):
for j in range(i+1,n):
dis[i][j] = min(abs(j-i),min(abs(j-y)+abs(x-i)+1,abs(j-x)+abs(y-i)+1))
d = [0 for i in range(n)]
for i in range(n):
for j in range(n):
d[dis[i][... | n,x,y = list(map(int,input().split()))
x -= 1
y -= 1
dis = [0 for i in range(n)]
for i in range(n):
for j in range(i+1,n):
dis[min(abs(j-i),min(abs(j-y)+abs(x-i)+1,abs(j-x)+abs(y-i)+1))] += 1
print(("\n".join(map(str,dis[1:])))) | p02726 |
s = input().split()
n=int(s[0])
x=int(s[1])-1
y=int(s[2])-1
inf=float('inf')
map=[]
for i in range(n):
for j in range(i+1,n):
map.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((map.count(i))) | s = input().split()
n=int(s[0])
x=int(s[1])-1
y=int(s[2])-1
inf=float('inf')
map={}
for i in range(n):
map[i]=0
for i in range(n):
for j in range(i+1,n):
map[min(abs(j-i),abs(x-i)+1+abs(j-y),abs(y-i)+1+abs(j-x))]+=1
for i in range(1,n):
print((map[i]))
| p02726 |
import sys
from collections import deque
def input(): return sys.stdin.readline().rstrip()
def main():
N, X, Y = list(map(int, input().split()))
ans = [0] * N
for i in range(1, N+1):
dist = [-1] * (N+1)
dist[i] = 0
q = deque()
q.append(i)
def push(l, m)... | import sys
from collections import deque
def input(): return sys.stdin.readline().rstrip()
def main():
N, X, Y = map(int, input().split())
ans = [0] * N
for i in range(1, N+1):
dist = [-1] * (N+1)
dist[i] = 0
q = deque()
q.append(i)
def push(l, m):
... | p02726 |
n,x,y = [int(x) for x in input().split()]
for k in range(1, n):
ans = 0
for i in range(1,n):
for j in range(i+1, n+1):
if min(abs(j-i), abs(x-i)+1+abs(j-y), abs(y-i)+1+abs(j-x)) == k:
ans += 1
print(ans) | n,x,y = [int(x) for x in input().split()]
d = {x: 0 for x in range(1, n)}
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))] += 1
for v in list(d.values()):
print(v) | p02726 |
import sys
from heapq import heappush, heappop
inf = float('inf')
n, x, y = list(map(int, sys.stdin.readline().split()))
g = [[] for _ in range(n)]
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)
def dijkstra(i):
dist = [inf] * n
dist[i] = 0... | import sys
from itertools import combinations
n, x, y = list(map(int, sys.stdin.readline().split()))
def main():
res = [0] * (n + 1)
for i, j in combinations(list(range(1, n+1)), 2):
d = min(j - i, abs(i - x) + 1 + abs(j - y))
res[d] += 1
for i in range(1, n):
... | p02726 |
N,X,Y = list(map(int, input().split()))
X = X-1
Y = Y-1
kyori = []
for i in range(N):
for j in range(i,N):
l = min(abs(i-j), abs(i-X)+1+abs(j-Y), abs(i-Y)+1+abs(j-X))
kyori.append(l)
for k in range(1,N):
print((kyori.count(k))) | N,X,Y = list(map(int, input().split()))
X = X-1
Y = Y-1
kyori = [0]*N
for i in range(N):
for j in range(i+1,N):
l = min(abs(i-j), abs(i-X)+1+abs(j-Y), abs(i-Y)+1+abs(j-X))
kyori[l] += 1
for k in range(1,N):
print((kyori[k])) | p02726 |
from collections import deque
n, x, y = list(map(int, input().split()))
g = dict()
for i in range(n):
if i == 0:
g[i] = [i+1]
elif i == n-1:
g[i] = [i-1]
else:
g[i] = [i-1, i+1]
g[x-1].append(y-1)
g[y-1].append(x-1)
distance = [0]*(n-1)
for i in range(n):
queue = de... | from collections import deque
n, x, y = list(map(int, input().split()))
g = dict()
for i in range(n):
if i == 0:
g[i] = [i+1]
elif i == n-1:
g[i] = [i-1]
else:
g[i] = [i-1, i+1]
g[x-1].append(y-1)
g[y-1].append(x-1)
# print(g)
distance = [0]*(n-1)
# 1番ノードから各ノードへの最短距離を求め... | p02726 |
from collections import deque
# import sys
# input = sys.stdin.readline
n, x, y = list(map(int, input().split()))
g = dict()
for i in range(n):
if i == 0:
g[i] = [i+1]
elif i == n-1:
g[i] = [i-1]
else:
g[i] = [i-1, i+1]
g[x-1].append(y-1)
g[y-1].append(x-1)
# print(g)
... | from collections import deque
def main():
n, x, y = list(map(int, input().split()))
g = dict()
for i in range(n):
if i == 0:
g[i] = [i+1]
elif i == n-1:
g[i] = [i-1]
else:
g[i] = [i-1, i+1]
g[x-1].append(y-1)
g[y-1].append(x-1)
... | p02726 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.