QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#800989 | #9804. Guess the Polygon | ucup-team135# | Compile Error | / | / | C++20 | 1.4kb | 2024-12-06 17:29:57 | 2024-12-06 17:29:58 |
Judging History
This is the latest submission verdict.
- [2024-12-06 17:29:58]
- Judged
- Verdict: Compile Error
- Time: 0ms
- Memory: 0kb
- [2024-12-06 17:29:57]
- Submitted
answer
import math
t=int(input())
for _ in range(t):
n=int(input())
a=[]
xs=[]
for i in range(n):
x,y=map(int,input().split())
a.append([x,y])
xs.append(x)
xs.sort()
xs1=[]
for i in range(n):
if(i==0 or (i>0 and xs[i]!=xs[i-1])):
xs1.append(xs[i])
xs=xs1
if(len(xs)<n):
u=0
v=1
for i in range(len(xs)-1):
print("?",end=' ')
oo=xs[i]+xs[i+1]
vv=2
if(oo%2==0):
oo//=2
vv//=2
print(oo,end=' ')
print(vv)
p,q=map(int,input().split())
p*=(xs[i+1]-xs[i])
u1=u*q+v*p
u2=v*q
o=math.gcd(u1,u2)
u1//=o
u2//=o
u=u1
v=u2
o=math.gcd(u,v)
u//=o
v//=o
print("!",end=' ')
print(u,end=' ')
print(v)
continue
u=0
v=1
for i in range(1,len(xs)-1):
print("?",end=' ')
print(xs[i],end=' ')
print(1)
p,q=map(int,input().split())
p*=(xs[i+1]-xs[i-1])
u1=u*q+v*p
u2=v*q
o=math.gcd(u1,u2)
u1//=o
u2//=o
u=u1
v=u2
v*=2
o=math.gcd(u,v)
u//=o
v//=o
print("!",end=' ')
print(u,end=' ')
print(v)
continue
详细
answer.code:1:1: error: ‘import’ does not name a type 1 | import math | ^~~~~~ answer.code:1:1: note: C++20 ‘import’ only available with ‘-fmodules-ts’, which is not yet enabled with ‘-std=c++20’