QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#738622 | #7065. Triangle | sunnygreen | AC ✓ | 1369ms | 3924kb | C++14 | 4.1kb | 2024-11-12 19:34:28 | 2024-11-12 19:34:30 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define il inline
#define fi first
#define se second
#define mk make_pair
#define eb emplace_back
#define rep(i,l,r) for(int i=(l); i<=(r); ++i)
#define rep_(i,l,r) for(int i=(l); i>=(r); --i)
typedef long long lr;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
constexpr int mod1=998244353,mod2=1e9+7;
constexpr db pi=3.141592653589793,eps=1e-9;
constexpr int inf32=0x3f3f3f3f,Inf32=0xc0c0c0c0;
constexpr lr inf64=0x3f3f3f3f3f3f3f3f,Inf64=0xc0c0c0c0c0c0c0c0;
template<typename T>il T Max(T x,T y) { return (x>y)? x:y; }
template<typename T>il T Min(T x,T y) { return (x<y)? x:y; }
template<typename T>il T gcd(T x,T y) { return (!y)? x:gcd(y,x%y); }
template<typename T>il T Abs(T x) { return (x>0)? x:(-x); }
template<typename T>il T Rnd(T l,T r,mt19937_64 &eng)
{
uniform_int_distribution<T> uid(l,r);
return uid(eng);
}
mt19937_64 eng(chrono::high_resolution_clock::now().time_since_epoch().count());
constexpr int N=524300;
il db cross(db xa,db ya,db xb,db yb,db xc,db yc) { return Abs((xa-xc)*(yb-yc)-(xb-xc)*(ya-yc)); }
db tmp;
il bool chk(int xa,int ya,int xb,int yb,int x,int y)
{
if((x<xa&&x<xb)||(x>xa&&x>xb)||(y<ya&&y<yb)||(y>ya&&y>yb))
return 0;
return (lr)(x-xa)*(yb-ya)==(lr)(y-ya)*(xb-xa);
}
il void calc(int xa,int ya,int xb,int yb,int xl,int yl,int xr,int yr)
{
if(xl==xr)
{
db l=yl,r=yr,mid,ax=0,ay=0;
while(Abs(r-l)>eps)
{
mid=(l+r)*0.5;
db xc=xl,yc=mid;
if(cross(xa,ya,xb,yb,xc,yc)*2>=tmp)
ax=xc,ay=yc,(l<r)? (r=mid-eps):(r=mid+eps);
else
(l<r)? (l=mid+eps):(l=mid-eps);
}
cout<<setiosflags(ios::fixed)<<setprecision(6)<<ax<<' '<<ay<<'\n';
return;
}
db l=xl,r=xr,mid,ax=0,ay=0;
while(Abs(r-l)>eps)
{
mid=(l+r)*0.5;
db xc=mid,yc=(yl*(xr-xc)+yr*(xc-xl))/(xr-xl);
if(cross(xa,ya,xb,yb,xc,yc)*2>=tmp)
ax=xc,ay=yc,(l<r)? (r=mid-eps):(r=mid+eps);
else
(l<r)? (l=mid+eps):(l=mid-eps);
}
cout<<setiosflags(ios::fixed)<<setprecision(6)<<ax<<' '<<ay<<'\n';
}
int xa,ya,xb,yb,xc,yc,xp,yp;
il void Solve()
{
cin>>xa>>ya>>xb>>yb>>xc>>yc>>xp>>yp,tmp=cross(xa,ya,xb,yb,xc,yc);
if(chk(xa,ya,xb,yb,xp,yp))
{
if(xa==xb)
{
int ap=Abs(yp-ya),bp=Abs(yp-yb);
if(ap==bp)
{
cout<<setiosflags(ios::fixed)<<setprecision(6)<<1.0*xc<<' '<<1.0*yc<<'\n';
return;
}
if(ap>bp)
return calc(xa,ya,xp,yp,xa,ya,xc,yc);
else
return calc(xb,yb,xp,yp,xb,yb,xc,yc);
}
int ap=Abs(xp-xa),bp=Abs(xp-xb);
if(ap==bp)
{
cout<<setiosflags(ios::fixed)<<setprecision(6)<<1.0*xc<<' '<<1.0*yc<<'\n';
return;
}
if(ap>bp)
return calc(xa,ya,xp,yp,xa,ya,xc,yc);
else
return calc(xb,yb,xp,yp,xb,yb,xc,yc);
}
if(chk(xa,ya,xc,yc,xp,yp))
{
if(xa==xc)
{
int ap=Abs(yp-ya),cp=Abs(yp-yc);
if(ap==cp)
{
cout<<setiosflags(ios::fixed)<<setprecision(6)<<1.0*xb<<' '<<1.0*yb<<'\n';
return;
}
if(ap>cp)
return calc(xa,ya,xp,yp,xa,ya,xb,yb);
else
return calc(xc,yc,xp,yp,xc,yc,xb,yb);
}
int ap=Abs(xp-xa),cp=Abs(xp-xc);
if(ap==cp)
{
cout<<setiosflags(ios::fixed)<<setprecision(6)<<1.0*xb<<' '<<1.0*yb<<'\n';
return;
}
if(ap>cp)
return calc(xa,ya,xp,yp,xa,ya,xb,yb);
else
return calc(xc,yc,xp,yp,xc,yc,xb,yb);
}
if(chk(xb,yb,xc,yc,xp,yp))
{
if(xb==xc)
{
int bp=Abs(yp-yb),cp=Abs(yp-yc);
if(bp==cp)
{
cout<<setiosflags(ios::fixed)<<setprecision(6)<<1.0*xa<<' '<<1.0*ya<<'\n';
return;
}
if(bp>cp)
return calc(xb,yb,xp,yp,xb,yb,xa,ya);
else
return calc(xc,yc,xp,yp,xc,yc,xa,ya);
}
int bp=Abs(xp-xb),cp=Abs(xp-xc);
if(bp==cp)
{
cout<<setiosflags(ios::fixed)<<setprecision(6)<<1.0*xa<<' '<<1.0*ya<<'\n';
return;
}
if(bp>cp)
return calc(xb,yb,xp,yp,xb,yb,xa,ya);
else
return calc(xc,yc,xp,yp,xc,yc,xa,ya);
}
cout<<"-1\n";
}
int main()
{
#ifdef LOCAL
string fpre="test",isuf="in",osuf="out";
assert(freopen((fpre+"."+isuf).c_str(),"r",stdin));
assert(freopen((fpre+"."+osuf).c_str(),"w",stdout));
#endif
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int T;
cin>>T;
while(T--)
Solve();
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3904kb
input:
2 0 0 1 1 1 0 1 0 0 0 1 1 1 0 2 0
output:
0.500000 0.500000 -1
result:
ok 3 numbers
Test #2:
score: 0
Accepted
time: 546ms
memory: 3776kb
input:
999966 9456 15557 18451 3957 6242 20372 9855 5351 30245 31547 9979 4703 25914 19144 26670 11383 13855 0 24614 0 15860 11017 12445 0 27870 17680 4219 3554 9129 29072 28316 17893 3249 27269 12754 4923 31746 16860 14894 21576 6846 0 1915 0 25023 28721 10508 0 10110 11862 23224 10373 17715 8212 29474 11...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 21424.681479 13086.053911 -1 -1 18711.237990 10162.376377 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 28212.952135 245.817786 -1 -1 -1 -1 -1 -1 -1 -1 22604.575302 14546.128716 -1 -1 11557.346522 4668.209790 -1 -1 19488.201031 725.306...
result:
ok 1111378 numbers
Test #3:
score: 0
Accepted
time: 557ms
memory: 3924kb
input:
999974 9228 16833 13143 23461 5117 7645 21359 13652 21313 3160 20333 1620 16288 7781 13315 10132 4372 0 27536 0 3207 8695 9983 0 21469 29998 19948 29904 30517 11141 14857 12881 11116 29172 16833 32095 18915 9448 22043 12275 32131 0 14304 0 16638 29018 2048 0 4695 4823 14130 2496 32676 4092 6363 2476...
output:
-1 -1 11482.990372 5737.223836 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 15409.841855 12451.427864 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 10828.971386 25347.334857 -1 -1 -1 -1 -1 18768.672699 12151.367151 -1 -1 -1 -1 -1 10801.120594 5947.861781 -1 -1 -1 -1 -1 1...
result:
ok 1110866 numbers
Test #4:
score: 0
Accepted
time: 1369ms
memory: 3908kb
input:
1000000 54242 34392 23333 92971 5711 47765 54242 34392 24492 41078 36756 68794 2060 62118 14678 50283 12685 18891 59613 23256 26016 46755 59613 23256 85238 49611 95092 85360 45143 87657 95092 85360 72852 37174 39825 60628 32289 18423 72852 37174 95309 61613 1645 45877 78395 38196 95309 61613 92215 7...
output:
14522.000000 70368.000000 32900.888889 68052.222222 19350.500000 32823.000000 65190.500000 68634.000000 36057.000000 39525.500000 40020.000000 42036.500000 95183.500000 40970.500000 28582.000000 94834.500000 55598.000000 59174.000000 19727.000000 68648.000000 73385.000000 43885.500000 16466.000000 5...
result:
ok 2000000 numbers