Submission #68187633

---

Source Code Expand

import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

"""
w0,w1,...,wn
wi + wj > M (i!=j) だと困る

1. 全員 M/2 以下
2. そうでない場合、最大値をaとすると a + (M-a) * (N-1) = N*(N-1)-a*(N-2) が最大 
"""

def solve(N,M):
    res = (M//2) * N
    a = M//2 + 1
    if a <= M:
        res = max(res,M*(N-1)-a*(N-2))
    return res

for _ in range(int(input())):
    N,M = mi()
    print(solve(N,M))

Submission Info

Judge Result