Submission #1841654


Source Code Expand

def d_diameter(N):
    import sys
    diameter = -1  # 木の直径(木の頂点のうち、最も距離が長い2頂点間の距離)
    p = -1 #頂点Nから最も遠い頂点のうち1つの番号を格納

    # 頂点Nから最も遠い頂点pを求める
    for i in range(1, N):
        print('? {} {}'.format(i, N))
        sys.stdout.flush()
        dist = int(input())
        if dist > diameter:
            diameter = dist
            p = i
    # 頂点pから最も遠い頂点との距離を求める
    diameter = -1
    for i in range(1, N + 1):
        if i == p:
            continue
        print('? {} {}'.format(i, p))
        sys.stdout.flush()
        dist = int(input())
        if dist > diameter:
            diameter = dist
    return '! {}'.format(diameter)

N = int(input())
print(d_diameter(N))

Submission Info

Submission Time
Task D - 高橋くんと木の直径
User kenseiQ
Language Python (3.4.3)
Score 100
Code Size 852 Byte
Status AC
Exec Time 25 ms
Memory 3532 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 20 / 20 80 / 80
Status
AC × 1
AC × 22
AC × 42
Set Name Test Cases
Sample subtask0_0.txt
Subtask1 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 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
Case Name Status Exec Time Memory
subtask0_0.txt AC 19 ms 3400 KB
subtask1_0.txt AC 24 ms 3528 KB
subtask1_1.txt AC 25 ms 3528 KB
subtask1_10.txt AC 24 ms 3404 KB
subtask1_11.txt AC 24 ms 3524 KB
subtask1_12.txt AC 24 ms 3528 KB
subtask1_13.txt AC 24 ms 3528 KB
subtask1_14.txt AC 24 ms 3528 KB
subtask1_15.txt AC 24 ms 3528 KB
subtask1_16.txt AC 24 ms 3528 KB
subtask1_17.txt AC 24 ms 3528 KB
subtask1_18.txt AC 24 ms 3532 KB
subtask1_19.txt AC 24 ms 3524 KB
subtask1_2.txt AC 24 ms 3524 KB
subtask1_20.txt AC 19 ms 3404 KB
subtask1_3.txt AC 24 ms 3528 KB
subtask1_4.txt AC 24 ms 3528 KB
subtask1_5.txt AC 25 ms 3404 KB
subtask1_6.txt AC 24 ms 3404 KB
subtask1_7.txt AC 24 ms 3524 KB
subtask1_8.txt AC 24 ms 3400 KB
subtask1_9.txt AC 24 ms 3400 KB
subtask2_0.txt AC 24 ms 3528 KB
subtask2_1.txt AC 24 ms 3532 KB
subtask2_10.txt AC 24 ms 3524 KB
subtask2_11.txt AC 24 ms 3404 KB
subtask2_12.txt AC 24 ms 3524 KB
subtask2_13.txt AC 24 ms 3396 KB
subtask2_14.txt AC 24 ms 3524 KB
subtask2_15.txt AC 24 ms 3528 KB
subtask2_16.txt AC 24 ms 3528 KB
subtask2_17.txt AC 24 ms 3528 KB
subtask2_18.txt AC 24 ms 3528 KB
subtask2_19.txt AC 24 ms 3524 KB
subtask2_2.txt AC 24 ms 3524 KB
subtask2_3.txt AC 24 ms 3400 KB
subtask2_4.txt AC 24 ms 3520 KB
subtask2_5.txt AC 24 ms 3404 KB
subtask2_6.txt AC 24 ms 3524 KB
subtask2_7.txt AC 24 ms 3524 KB
subtask2_8.txt AC 24 ms 3528 KB
subtask2_9.txt AC 24 ms 3528 KB