QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#796904 | #9804. Guess the Polygon | propane | RE | 0ms | 0kb | Python3 | 1.0kb | 2024-12-02 09:52:01 | 2024-12-02 09:52:03 |
Judging History
answer
from pickle import TRUE
import sys
from fractions import Fraction
input = sys.stdin.readline
for _ in range(int(input())):
n = int(input())
x = []
for i in range(n):
x.append(int(input().split()[0]))
x.sort()
print(*x)
if len(set(x)) == n:
l = [Fraction(0)] * n
for i in range(1, n - 1):
print("?", x[i], 1, flush=True)
aa, bb = map(int, input().split())
l[i] = Fraction(aa, bb)
ans = 0
for i in range(n - 1):
ans += Fraction(x[i + 1] - x[i], 2) * (l[i] + l[i + 1])
print("!", ans.numerator, ans.denominator, flush=True)
else:
ans = 0
for i in range(n - 1):
if x[i] != x[i + 1]:
t = Fraction(x[i] + x[i + 1], 2)
print("?", t.numerator, t.denominator, flush=True)
aa, bb = map(int, input().split())
ans += Fraction(aa, bb) * (x[i + 1] - x[i])
print("!", ans.numerator, ans.denominator, flush=True)
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Dangerous Syscalls
input:
2 4 3 0 1 3 1 1 0 0
output:
0 1 1 3 ? 1 2