Submission #69121906

---

Source Code Expand

# C31
# C12 sub2 => WA x13 AC x1
# C11 sub1 => WA x13 AC x1

import sys
sys.setrecursionlimit(10 ** 6)

# import numpy as np
# from numba import jit, boolean, int64, float64, typeof, types, typeof, objmode




def main():
    from io import StringIO
    execute(StringIO(sample), sys.stderr)
    print("-- ^sample! --", file=sys.stderr)

    execute(sys.stdin, sys.stdout)

    # if len(solve.nopython_signatures) != 1:
    #     raise KeyboardInterrupt("!! Unexpected: wrong use of jit !!")

def execute(src, dst):

    T = int(src.readline())

    cases = [list(map(int, src.readline().split())) for _i in range(T)]

    ans = solve(cases)
    print(*ans, sep="\n", file=dst)

sample = """\
5
3 1 2
100 0 0
1000000 1000000 1000000
31 41 59
1000000000 10000 1
"""

# @jit(nopython=True, cache=True)
def solve(cases):

    ans = []

    for na, nb, nc in cases:
        ac = [na , nc]
        ac.sort()

        if ac[0] <= nb :  # 21
            res = ac[0]
            ans.append(res)
            continue

        res = nb
        ac2 = [ac[0] - nb , ac[1] - nb]


        if ac2[0] *2 <= ac2[1] :
            res += ac2[0]
            ans.append(res)
            continue
        # C31:論理ミス訂正
        res += (ac2[0] + ac2[1]) // 3
        ans.append(res)
        continue

    return ans




main()

Submission Info

Judge Result