AtCoder Beginner Contest 019

Submission #7478092

Source codeソースコード

from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor


INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LIM(): return list(map(lambda x:int(x) - 1, sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def LIRM(n): return [LIM() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007


n = I()
ret = -INF
for i in range(2, n+1):
    print("? {0} {1}".format(1, i))
    sys.stdout.flush()
    dist = I()
    if dist > ret:
        ret = dist
        v = i


ret = -INF
for j in range(1, n+1):
    if v != j:
        print("? {0} {1}".format(v, j))
        sys.stdout.flush()
        dist = I()
        if I() > ret:
            ret = dist
            w = j



print("! {0}".format(ret))

Submission

Task問題 D - 高橋くんと木の直径
User nameユーザ名 ryuhei_py
Created time投稿日時
Language言語 PyPy3 (2.4.0)
Status状態 TLE
Score得点 0
Source lengthソースコード長 1407 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
Sample - subtask0_0.txt
Subtask1 0 / 20 subtask1_0.txt,subtask1_1.txt,subtask1_10.txt,subtask1_11.txt,subtask1_12.txt,subtask1_13.txt,subtask1_14.txt,subtask1_15.txt,subtask1_16.txt,subtask1_17.txt,subtask1_18.txt,subtask1_19.txt,subtask1_2.txt,subtask1_20.txt,subtask1_3.txt,subtask1_4.txt,subtask1_5.txt,subtask1_6.txt,subtask1_7.txt,subtask1_8.txt,subtask1_9.txt,subtask0_0.txt
All 0 / 80 subtask0_0.txt,subtask1_0.txt,subtask1_1.txt,subtask1_10.txt,subtask1_11.txt,subtask1_12.txt,subtask1_13.txt,subtask1_14.txt,subtask1_15.txt,subtask1_16.txt,subtask1_17.txt,subtask1_18.txt,subtask1_19.txt,subtask1_2.txt,subtask1_20.txt,subtask1_3.txt,subtask1_4.txt,subtask1_5.txt,subtask1_6.txt,subtask1_7.txt,subtask1_8.txt,subtask1_9.txt,subtask2_0.txt,subtask2_1.txt,subtask2_10.txt,subtask2_11.txt,subtask2_12.txt,subtask2_13.txt,subtask2_14.txt,subtask2_15.txt,subtask2_16.txt,subtask2_17.txt,subtask2_18.txt,subtask2_19.txt,subtask2_2.txt,subtask2_3.txt,subtask2_4.txt,subtask2_5.txt,subtask2_6.txt,subtask2_7.txt,subtask2_8.txt,subtask2_9.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
subtask0_0.txt TLE
subtask1_0.txt TLE
subtask1_1.txt TLE
subtask1_10.txt TLE
subtask1_11.txt TLE
subtask1_12.txt TLE
subtask1_13.txt TLE
subtask1_14.txt TLE
subtask1_15.txt TLE
subtask1_16.txt TLE
subtask1_17.txt TLE
subtask1_18.txt TLE
subtask1_19.txt TLE
subtask1_2.txt TLE
subtask1_20.txt TLE
subtask1_3.txt TLE
subtask1_4.txt TLE
subtask1_5.txt TLE
subtask1_6.txt TLE
subtask1_7.txt TLE
subtask1_8.txt TLE
subtask1_9.txt TLE
subtask2_0.txt TLE
subtask2_1.txt TLE
subtask2_10.txt TLE
subtask2_11.txt TLE
subtask2_12.txt TLE
subtask2_13.txt TLE
subtask2_14.txt TLE
subtask2_15.txt TLE
subtask2_16.txt TLE
subtask2_17.txt TLE
subtask2_18.txt TLE
subtask2_19.txt TLE
subtask2_2.txt TLE
subtask2_3.txt TLE
subtask2_4.txt TLE
subtask2_5.txt TLE
subtask2_6.txt TLE
subtask2_7.txt TLE
subtask2_8.txt TLE
subtask2_9.txt TLE