# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1231745 | durdona | Table Tennis (info1cup20_tabletennis) | Pypy 3 | 3106 ms | 291300 KiB |
from itertools import combinations as comb
def fun(arr):
arr.sort()
n=len(arr)
hozir=arr[0]+arr[-1]
for i in range(n//2):
if arr[i]+arr[n-i-1]!=hozir:
return False
return True
n,k=map(int,input().split())
arr=list(map(int,input().split()))
for c in comb(range(n+k),k):
c=set(c)
t=[arr[i] for i in range(n+k) if i not in c]
if fun(t):
print(*t)
break
컴파일 시 표준 출력 (stdout) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |