QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#795217 | #9804. Guess the Polygon | ucup-team3734# | TL | 19ms | 11764kb | Python3 | 1.1kb | 2024-11-30 18:45:18 | 2024-11-30 18:45:19 |
Judging History
answer
import sys
from fractions import Fraction
def read_line():
while True:
line = sys.stdin.readline().strip()
if len(line) > 0:
return line
def assert_tl(cond: bool):
if not cond:
while True:
pass
def assert_wa(cond: bool):
if not cond:
sys.exit(0)
def ask(x: int):
assert_wa(0 <= x <= 1000)
print('?', x, 1, flush=True)
p, q = map(int, read_line().split())
return Fraction(p, q)
def solve():
n = int(read_line())
xs = []
for i in range(n):
x, _ = map(int, read_line().split())
assert(0 <= x <= 1000)
xs.append(x)
xs = list(sorted(xs))
answers = [Fraction(0) for _ in range(n)]
for i in range(1, n - 1):
answers[i] = ask(xs[i])
S = Fraction(0)
for i in range(0, n - 1):
S += (xs[i + 1] - xs[i]) * (answers[i] + answers[i + 1])
S /= 2
print('!', S.numerator, S.denominator, flush=True)
if __name__ == "__main__":
t = int(read_line())
for _ in range(t):
solve()
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 19ms
memory: 11764kb
input:
2 4 3 0 1 3 1 1 0 0 2 1 2 1 3 0 0 999 1000 1000 999 1999 1000
output:
? 1 1 ? 1 1 ! 3 1 ? 999 1 ! 1999 2
result:
ok correct! (2 test cases)
Test #2:
score: -100
Time Limit Exceeded
input:
9 4 1 1 1 3 3 0 0 0 3 1 3 1
output:
? 1 1 ? 1 1 ! 9 2