QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #724548 | #4383. Laser | XfJbUhpyzgaW# | AC ✓ | 22ms | 5916kb | C++11 | 2.4kb | 2024-11-08 13:40:16 | 2024-11-08 13:40:16 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define GC getchar()
#define N 500100
#define M 200000100
#define PC putchar
using namespace std;
ll re(){
ll s=0,b=1; char c=GC;
while(c>'9'||c<'0'){if(c=='-')b=-b; c=GC;}
while(c<='9'&&c>='0'){s=(s<<1)+(s<<3)+(c^48); c=GC;}
return s*b;
}
void ks(ll s){if(s>=10)ks(s/10); PC((s%10)|48);}
int n,x[N],y[N],s,xa,xb,xc,ya,yb,yc;
void wo(){
n=re();
for(int i=1; i<=n; ++i){
x[i]=re(),y[i]=re();
} bool fl=1; xa=M,xb=M,xc=M;
for(int i=2; i<=n; ++i){
if(x[i]==x[1])continue;
if(xa==M){
xa=y[i]; xb=y[i]-(x[i]-x[1]); xc=y[i]+(x[i]-x[1]);
} else{
ya=y[i]; yb=y[i]-(x[i]-x[1]); yc=y[i]+(x[i]-x[1]);
if(xa!=ya&&xa!=yb&&xa!=yc)xa=M;
if(xb!=ya&&xb!=yb&&xb!=yc)xb=M;
if(xc!=ya&&xc!=yb&&xc!=yc)xc=M;
if(xa>xb)swap(xa,xb); if(xb>xc)swap(xb,xc);
if(xa>xb)swap(xa,xb); if(xa==M){fl=0; break;}
}
}
if(fl){cout<<"YES"<<endl; return;}
fl=1; xa=M,xb=M,xc=M;
for(int i=2; i<=n; ++i){
if(y[i]==y[1])continue;
if(xa==M){
xa=x[i]; xb=x[i]-(y[i]-y[1]); xc=x[i]+(y[i]-y[1]);
} else{
ya=x[i]; yb=x[i]-(y[i]-y[1]); yc=x[i]+(y[i]-y[1]);
if(xa!=ya&&xa!=yb&&xa!=yc)xa=M;
if(xb!=ya&&xb!=yb&&xb!=yc)xb=M;
if(xc!=ya&&xc!=yb&&xc!=yc)xc=M;
if(xa>xb)swap(xa,xb); if(xb>xc)swap(xb,xc);
if(xa>xb)swap(xa,xb); if(xa==M){fl=0; break;}
}
}
if(fl){cout<<"YES"<<endl; return;}
fl=1; xa=M,xb=M,xc=M;
//y=-x+x[1]+y[1]
for(int i=2; i<=n; ++i){
if(x[i]+y[i]==x[1]+y[1])continue;
if(xa==M){
xa=x[i]*2; xb=(x[1]+y[1]-y[i])*2; xc=x[1]+y[1]+x[i]-y[i];
} else{
ya=x[i]*2; yb=(x[1]+y[1]-y[i])*2; yc=x[1]+y[1]+x[i]-y[i];
if(xa!=ya&&xa!=yb&&xa!=yc)xa=M;
if(xb!=ya&&xb!=yb&&xb!=yc)xb=M;
if(xc!=ya&&xc!=yb&&xc!=yc)xc=M;
if(xa>xb)swap(xa,xb); if(xb>xc)swap(xb,xc);
if(xa>xb)swap(xa,xb); if(xa==M){fl=0; break;}
}
}
if(fl){cout<<"YES"<<endl; return;}
fl=1; xa=M,xb=M,xc=M;
//y=x-x[1]+y[1]
//y=-x+x[i]+y[i]
for(int i=2; i<=n; ++i){
if(x[i]-y[i]==x[1]-y[1])continue;
if(xa==M){
xa=x[i]*2; xb=(y[i]+x[1]-y[1])*2; xc=x[1]-y[1]+x[i]+y[i];
} else{
ya=x[i]*2; yb=(y[i]+x[1]-y[1])*2; yc=x[1]-y[1]+x[i]+y[i];
if(xa!=ya&&xa!=yb&&xa!=yc)xa=M;
if(xb!=ya&&xb!=yb&&xb!=yc)xb=M;
if(xc!=ya&&xc!=yb&&xc!=yc)xc=M;
if(xa>xb)swap(xa,xb); if(xb>xc)swap(xb,xc);
if(xa>xb)swap(xa,xb); if(xa==M){fl=0; break;}
}
}
if(fl)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
int main(){
int T=re();
while(T--)wo();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 22ms
memory: 5916kb
input:
116 4 -10 0 10 0 5 5 -5 -5 4 -10 0 10 0 0 10 0 -10 4 -1 0 1 0 2 0 3 0 4 0 1 0 2 0 3 0 4 4 100 100 10000 10000 100000 100000 -100 -100 4 -100 100 -10000 10000 -100000 100000 100 -100 6 1 1 1 3 2 2 3 1 3 3 3 4 7 1 1 1 3 2 2 3 1 3 3 1 4 3 4 4 1236833 14678 1232056 9901 1237055 9790 1231834 15011 4 1236...
output:
YES YES YES YES YES YES YES NO YES NO NO YES NO NO YES YES NO NO YES YES YES YES YES YES NO YES YES YES YES YES YES YES NO YES YES NO NO YES NO NO NO YES YES YES NO NO YES YES NO NO NO NO NO YES YES NO YES NO NO YES NO YES NO NO NO NO YES YES YES NO YES YES YES NO YES YES NO YES NO YES YES NO YES NO...
result:
ok 116 lines