QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#776130#9576. Ordainer of Inexorable JudgmentEvanWA 0ms4276kbC++204.4kb2024-11-23 17:39:552024-11-23 17:39:56

Judging History

你现在查看的是最新测评结果

  • [2024-12-23 14:23:26]
  • hack成功,自动添加数据
  • (/hack/1303)
  • [2024-12-06 11:32:56]
  • hack成功,自动添加数据
  • (/hack/1271)
  • [2024-11-23 17:39:56]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:4276kb
  • [2024-11-23 17:39:55]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
struct P{
    int x,y;
};
P p[110];
int n,xx,yy,d,t;
double get_theta_b(int xp,int yp)
{
    double mm=1.00*sqrt(1.00*xp*xp+1.00*yp*yp);
    if(yp==0)
    {
        if(xp>0)return 0.00;
        else return 1.00*acos(-1.00);
    }
    else
    {
        double th=1.00*acos((xp*1.00)/mm);
        if(yp>=0)return th;
        else return 2.00*acos(-1.00)-th;
    }
}
double get_theta_s(int xp,int yp)
{
    double mm=1.00*sqrt(1.00*xp*xp+1.00*yp*yp);
    double tt=0.500*acos(-1.00)-acos(1.00*d/mm);
    return fabs(tt)*1.00;
}
double T1[110];
vector<double>TT;
int main()
{
    scanf("%d %d %d %d %d",&n,&xx,&yy,&d,&t);
    for(int i=1;i<=n;i++)
    {
        scanf("%d %d",&p[i].x,&p[i].y);
    }
    int jj=1;
    for(int i=1;i<=n;i++)
    {
        for(int j=i+1;j<=n;j++)
        {
            for(int k=j+1;k<=n;k++)
            {
                long long f1=((p[i].x)*(p[j].y)*1ll-(p[i].y)*(p[j].x)*1ll)*((p[i].x)*(p[k].y)*1ll-(p[i].y)*(p[k].x)*1ll);
                long long f2=((p[j].x)*(p[i].y)*1ll-(p[j].y)*(p[i].x)*1ll)*((p[j].x)*(p[k].y)*1ll-(p[k].y)*(p[k].x)*1ll);
                long long f3=((p[k].x)*(p[i].y)*1ll-(p[k].y)*(p[i].x)*1ll)*((p[k].x)*(p[j].y)*1ll-(p[k].y)*(p[j].x)*1ll);
                if(f1<=0&&f2<=0&&f3<=0)jj=0;
            }
        }
    }
    if(jj==0)printf("%.8f",t*1.00);
    else
    {
        for(int i=1;i<=n;i++)
        {
            double base_the=get_theta_b(p[i].x,p[i].y);
            double eps=get_theta_s(p[i].x,p[i].y);
            if(i==1)
            {
                T1[i]=base_the;
                TT.push_back(base_the+eps*1.00);
                TT.push_back(base_the-eps*1.00);
            }
            else
            {
                base_the-=2.00*acos(-1.00);
                while(fabs(base_the-T1[1])>1.00*acos(-1.00)+1e-7)base_the+=2.00*acos(-1.00);
                T1[i]=base_the;
                TT.push_back(base_the+eps*1.00);
                TT.push_back(base_the-eps*1.00);
            }
        }
        sort(TT.begin(),TT.end());
        double LL=TT[0];
        double RR=TT[2*n-1];
        double ans=0.00;
        //printf("%.8f %.8f\n",LL,RR);
        double curr=get_theta_b(xx,yy);
        double lenth=fabs(RR*1.00-LL*1.00)*1.00;
        int round=(int)((1.00*t+1e-7)/(2.00*acos(-1.00)));
        ans+=round*1.00*lenth;
        double rest=t*1.00-round*2.00*acos(-1.00);
        LL-=2.00*acos(-1.00);
        while(fabs(LL-acos(1.00))>1.00*acos(-1.00)+1e-7)LL+=2.00*acos(-1.00);
        RR-=2.00*acos(-1.00);
        while(fabs(RR-acos(1.00))>1.00*acos(-1.00)+1e-7)RR+=2.00*acos(-1.00);
        curr-=2.00*acos(-1.00);
        while(fabs(curr-acos(1.00))>1.00*acos(-1.00)+1e-7)curr+=2.00*acos(-1.00);
        if(LL<RR)
        {
            if(LL<=curr&&curr<=RR)
            {
                if(rest<=RR-curr)ans+=rest;
                else if(rest<=2.00*acos(-1.00)-curr+LL)ans+=RR-curr;
                else ans+=lenth*1.00-curr+LL;
            }
            else
            {
                if(curr>=RR)
                {
                    if(rest<=2.00*acos(-1.00)-curr+LL)ans+=0.00;
                    else if(2.00*acos(-1.00)-curr+LL<=rest&&rest<=2.00*acos(-1.00)-curr+LL+lenth)ans+=rest-(2.00*acos(-1.00)-curr+LL);
                    else ans+=lenth*1.00;
                }
                else
                {
                    if(rest<=-curr+LL)ans+=0.00;
                    else if(-curr+LL<=rest&&rest<=-curr+RR)ans+=rest-LL+curr;
                    else ans+=lenth*1.00;
                }
            }
        }
        else
        {
            if(RR<=curr&&curr<=LL)
            {
                if(rest<=(LL-curr))ans+=0.00;
                else if(LL-curr<=rest&&rest<=LL-curr+lenth)ans+=rest-LL+curr;
                else ans+=lenth*1.00;
            }
            else
            {
                if(curr>=LL)
                {
                    if(rest<=RR+2*acos(-1.00)-LL)ans+=rest;
                    else if(rest<=2.00*acos(-1.00)-(curr-LL))ans+=RR+2*acos(-1.00)-LL;
                    else ans+=lenth-2.00*acos(-1.00)+rest;
                }
                else
                {
                    if(rest<=RR-curr)ans+=rest;
                    else if(rest<=LL-curr)ans+=RR-curr;
                    else ans+=lenth-2.00*acos(-1.00)+rest;
                }
            }
        }
        printf("%.8f",ans);
    }
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 4076kb

input:

3 1 0 1 1
1 2
2 1
2 2

output:

1.00000000

result:

ok found '1.0000000', expected '1.0000000', error '0.0000000'

Test #2:

score: 0
Accepted
time: 0ms
memory: 4184kb

input:

3 1 0 1 2
1 2
2 1
2 2

output:

1.57079633

result:

ok found '1.5707963', expected '1.5707963', error '0.0000000'

Test #3:

score: 0
Accepted
time: 0ms
memory: 4096kb

input:

3 1 0 1 10000
1 2
2 1
2 2

output:

2500.70775226

result:

ok found '2500.7077523', expected '2500.7077523', error '0.0000000'

Test #4:

score: 0
Accepted
time: 0ms
memory: 4196kb

input:

3 10000 10000 1 10000
10000 9999
10000 10000
9999 10000

output:

0.38424130

result:

ok found '0.3842413', expected '0.3842413', error '0.0000000'

Test #5:

score: 0
Accepted
time: 0ms
memory: 4152kb

input:

3 -10000 -10000 10000 10000
-10000 -9999
-10000 -10000
-9999 -10000

output:

2500.24067001

result:

ok found '2500.2406700', expected '2500.2406700', error '0.0000000'

Test #6:

score: 0
Accepted
time: 0ms
memory: 4064kb

input:

4 1 0 1 10000
-2 3400
-4 10000
-4 -10000
-2 -3400

output:

4999.21911541

result:

ok found '4999.2191154', expected '4999.2191154', error '0.0000000'

Test #7:

score: 0
Accepted
time: 0ms
memory: 4160kb

input:

4 1 0 1 10000
-2 3300
-4 10000
-4 -10000
-2 -3300

output:

4999.20039185

result:

ok found '4999.2003919', expected '4999.2003919', error '0.0000000'

Test #8:

score: 0
Accepted
time: 0ms
memory: 4208kb

input:

4 -3040 2716 2147 2
-9033 -8520
-8999 -8533
-8988 -8511
-9004 -8495

output:

0.35083006

result:

ok found '0.3508301', expected '0.3508301', error '0.0000000'

Test #9:

score: 0
Accepted
time: 0ms
memory: 4020kb

input:

3 8168 -766 1549 1256
-3951 -6425
-3874 -6439
-3911 -6389

output:

84.83286116

result:

ok found '84.8328612', expected '84.8328612', error '0.0000000'

Test #10:

score: 0
Accepted
time: 0ms
memory: 4272kb

input:

8 2977 -3175 8766 2
-4868 7759
-4867 7925
-4867 7950
-4886 7952
-4979 7953
-5048 7877
-5003 7761
-4936 7759

output:

0.32786065

result:

ok found '0.3278606', expected '0.3278606', error '0.0000000'

Test #11:

score: 0
Accepted
time: 0ms
memory: 4092kb

input:

13 -1715 -4640 267 8651
272 6659
264 6660
208 6664
108 6625
107 6621
93 6564
90 6551
90 6485
124 6474
219 6477
283 6525
288 6591
286 6657

output:

153.58962278

result:

ok found '153.5896228', expected '153.5896228', error '0.0000000'

Test #12:

score: 0
Accepted
time: 0ms
memory: 4188kb

input:

8 -9743 -7629 775 7
-194 981
-191 1720
-193 1845
-705 1929
-959 1950
-1131 1894
-1151 1604
-1031 1020

output:

2.04600620

result:

ok found '2.0460062', expected '2.0460062', error '0.0000000'

Test #13:

score: 0
Accepted
time: 0ms
memory: 4196kb

input:

9 -6770 -1426 3491 1918
-2118 2886
-2063 3245
-2122 3709
-2129 3737
-2850 3718
-2984 3650
-3042 3462
-3028 2972
-2688 2888

output:

822.24118496

result:

ok found '822.2411850', expected '822.2411850', error '0.0000000'

Test #14:

score: 0
Accepted
time: 0ms
memory: 4276kb

input:

12 1616 -7384 5256 10
-5607 2623
-5838 2843
-6117 2986
-6592 3169
-7129 3120
-7334 3069
-7406 2295
-7369 1712
-7091 1287
-6312 1252
-5596 1592
-5457 2088

output:

3.03876538

result:

ok found '3.0387654', expected '3.0387654', error '0.0000000'

Test #15:

score: 0
Accepted
time: 0ms
memory: 4272kb

input:

10 -4546 5056 639 2996
4851 -3506
6078 -3725
6629 -3674
6775 -3296
6743 -2137
6585 -1866
5334 -1837
4950 -2020
4873 -2260
4852 -3240

output:

262.42396908

result:

ok found '262.4239691', expected '262.4239691', error '0.0000000'

Test #16:

score: 0
Accepted
time: 0ms
memory: 4192kb

input:

20 4847 -6818 2502 2
-2164 -3844
-2453 -3826
-4654 -3818
-5073 -3829
-5212 -3833
-5828 -3921
-5889 -6065
-5896 -6716
-5877 -7349
-5855 -7457
-5619 -7711
-5485 -7786
-3743 -7809
-2345 -7747
-2075 -7682
-1960 -7364
-1900 -7015
-1901 -6391
-1922 -4091
-1968 -4028

output:

0.00000000

result:

ok found '0.0000000', expected '0.0000000', error '-0.0000000'

Test #17:

score: 0
Accepted
time: 0ms
memory: 4196kb

input:

14 -1792 -5751 2349 4072
-3697 -4432
-4268 -4431
-6475 -4433
-7140 -4464
-7320 -4526
-7354 -5333
-7357 -5731
-7366 -7076
-7346 -7868
-7218 -8415
-4044 -8407
-3412 -8398
-3388 -7296
-3391 -4497

output:

758.96676835

result:

ok found '758.9667684', expected '758.9667683', error '0.0000000'

Test #18:

score: 0
Accepted
time: 0ms
memory: 4096kb

input:

23 8820 -5943 927 1
-1319 -4435
-1321 -297
-1361 -149
-1379 -119
-1619 13
-6579 12
-7090 11
-7184 -5
-7209 -18
-7277 -62
-7316 -672
-7316 -5095
-7295 -5877
-7273 -5921
-7250 -5955
-6569 -5967
-5927 -5975
-4278 -5977
-2646 -5978
-1477 -5965
-1472 -5962
-1404 -5892
-1334 -5809

output:

0.00000000

result:

ok found '0.0000000', expected '0.0000000', error '-0.0000000'

Test #19:

score: 0
Accepted
time: 0ms
memory: 4180kb

input:

22 -5664 7523 2588 8083
3456 2960
3446 2865
3433 2724
3432 615
3434 -1360
3446 -2929
3602 -2969
6204 -2972
8409 -2972
9227 -2969
9329 -2929
9375 -2890
9426 -2575
9432 2499
9432 2620
9390 2954
9386 2968
9277 3023
8340 3026
6809 3026
3634 3020
3600 3018

output:

3378.31174008

result:

ok found '3378.3117401', expected '3378.3117401', error '0.0000000'

Test #20:

score: 0
Accepted
time: 0ms
memory: 4100kb

input:

19 -1886 -3232 561 6
-8846 -7186
-8842 -7658
-8705 -7660
-1521 -7660
-1248 -7658
-1048 -7654
-906 -7650
-877 -7643
-858 -7619
-846 -7598
-846 -1489
-847 -277
-851 311
-1001 332
-1072 340
-7480 340
-8844 337
-8845 332
-8846 -9

output:

2.26823338

result:

ok found '2.2682334', expected '2.2682334', error '0.0000000'

Test #21:

score: 0
Accepted
time: 0ms
memory: 4184kb

input:

27 -8996 -3721 1431 7076
5671 -1552
3604 -1551
1370 -1551
-1106 -1552
-1845 -1553
-1945 -1582
-1964 -1649
-1981 -1924
-1981 -7875
-1980 -8365
-1979 -8628
-1977 -8988
-1974 -9316
-1963 -9548
-1871 -9550
-1288 -9551
5996 -9551
6006 -9455
6010 -9391
6012 -9343
6014 -9271
6015 -9144
6019 -7478
6019 -263...

output:

3442.55917371

result:

ok found '3442.5591737', expected '3442.5591737', error '0.0000000'

Test #22:

score: 0
Accepted
time: 0ms
memory: 4216kb

input:

5 -7413 -6822 8371 4
-8435 1969
-8446 1918
-8438 1885
-8390 1892
-8422 1955

output:

0.39515773

result:

ok found '0.3951577', expected '0.3951577', error '0.0000000'

Test #23:

score: 0
Accepted
time: 0ms
memory: 4272kb

input:

5 5998 6928 4304 9649
-9352 -3336
-9335 -3337
-9282 -3320
-9273 -3304
-9313 -3284

output:

1393.59587865

result:

ok found '1393.5958787', expected '1393.5958787', error '0.0000000'

Test #24:

score: 0
Accepted
time: 0ms
memory: 4180kb

input:

13 7526 -9874 3812 9
2735 4538
2673 4561
2663 4563
2652 4563
2609 4539
2607 4535
2582 4483
2593 4434
2601 4415
2711 4396
2735 4405
2749 4417
2777 4472

output:

3.29923603

result:

ok found '3.2992360', expected '3.2992360', error '0.0000000'

Test #25:

score: -100
Wrong Answer
time: 0ms
memory: 4228kb

input:

9 1419 -6061 9067 634
-1331 -9405
-1206 -9456
-1165 -9391
-1157 -9359
-1184 -9294
-1252 -9276
-1312 -9299
-1329 -9336
-1336 -9354

output:

265.30807870

result:

wrong answer 1st numbers differ - expected: '266.3903806', found: '265.3080787', error = '0.0040628'