QOJ.ac
QOJ
ID | 提交记录ID | 题目 | Hacker | Owner | 结果 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|
#727 | #313211 | #7730. Convex Checker | Qingyu | unclezhou | Success! | 2024-07-04 19:27:05 | 2024-07-04 19:27:06 |
详细
Extra Test:
Wrong Answer
time: 27ms
memory: 7236kb
input:
95217 -920449752 390860912 -920451998 390855623 -920493764 390757252 -920558815 390603977 -920565821 390587465 -920604170 390497070 -920612754 390476832 -920645198 390400331 -920653034 390381852 -920668869 390344506 -920675430 390329030 -920715025 390235623 -920738255 390180809 -920751302 390150021 ...
output:
Yes
result:
wrong answer expected NO, found YES
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#313211 | #7730. Convex Checker | unclezhou | WA | 39ms | 7348kb | C++14 | 1.2kb | 2024-01-24 16:38:46 | 2024-07-04 19:27:36 |
answer
#include <bits/stdc++.h>
using namespace std;
typedef double LD;
const LD eps=1e-6;
const int N=2e5+10;
int n;
struct point{
LD x,y;
point operator + (const point &a) const{
return {x+a.x,y+a.y};
}
point operator - (const point &a) const{
return {x-a.x,y-a.y};
}
point operator * (LD a) const{
return {x*a,y*a};
}
};
struct line{
point s,t;
};
LD dot (const point &a,const point &b){
return a.x*b.x+a.y*b.y;
}
LD det (const point &a,const point &b){
return a.x*b.y-a.y*b.x;
}
LD sqr(LD a){
return a*a;
}
LD dis (const point &a){
return (sqrt(sqr(a.x)+sqr(a.y)));
}
int sgn(LD x){
return x>eps?1:(x<-eps?-1:0);
}
point a[N];
int main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].x>>a[i].y;
}
LD t=0;
a[1+n]=a[1];
a[2+n]=a[2];
for(int i=1;i<=n;i++){
//line u,v;
point u=a[i+1]-a[i];
point v=a[i+2]-a[i+1];
if(det(u,v)==0){
cout<<"No\n";
return 0;
}
t+=(acos(dot(u,v)/dis(u)/dis(v)));
}
//cout<<t<<'\n';
if(sgn(t-2*acos(-1))==0){
cout<<"Yes\n";
}
else cout<<"No\n";
//cout<<t<<'\n';
}