QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#800479 | #9576. Ordainer of Inexorable Judgment | Hanoist | WA | 0ms | 2556kb | C++14 | 2.1kb | 2024-12-06 11:39:19 | 2024-12-06 11:39:27 |
Judging History
answer
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<functional>
#include<utility>
#include<cassert>
using namespace std;
const int N = 111;
#define pi acos(-1)
//#define double long double
int n;
struct vec{
double x,y;
}a[N],sl[N << 1];
double sx,sy,d,t;
inline double Dis(vec a,vec b){
return 1.0 * sqrt((a.y - b.y) * (a.y - b.y) + (a.x - b.x) * (a.x - b.x));
}
inline vec rotate(vec a,double ang){
return (vec){a.x * cos(ang) - a.y * sin(ang),a.x * sin(ang) + a.y * cos(ang)};
}
bool cmp(vec u,vec v){
if(u.x != v.x) return u.x < v.x;
return u.y < v.y;
}
int main(){
int i,j,k,x,y;
vec O = {0,0};
scanf("%d %lf %lf %lf %lf",&n,&sx,&sy,&d,&t);
for(i = 1;i <= n;i++){
scanf("%lf %lf",&a[i].x,&a[i].y);
}
for(i = 1;i <= n;i++){
vec p = a[i],p1,p2,temp;
double q = abs(acos(d / Dis(a[i],O)));
p1 = rotate(p,q),p2 = rotate(p,-q);
temp = (vec){p1.y,-p1.x},p1 = temp;
temp = (vec){-p2.y,p2.x},p2 = temp;
sl[i].x = atan2(p1.y,p1.x),sl[i].y = atan2(p2.y,p2.x);
//printf("%Lf %Lf\n",sl[i].x,sl[i].y);
if(sl[i].x > sl[i].y) sl[i].x -= 2 * pi;
}
sort(sl + 1,sl + n + 1,cmp);
for(i = 1;i <= n;i++) sl[i + n] = {sl[i].x + 2 * pi,sl[i].y + 2 * pi};
double res1,res,mx,my;
for(i = 1;i <= n;i++){
mx = 1e18,my = -1e18;
for(j = i;j < n + i;j++){
mx = min(sl[j].x,mx);
my = max(sl[j].y,my);
}
if(my - mx <= pi){
res1 = my - mx;
k = i;
break;
}
}
res = (int)(t / 2 / pi) * res1;
t -= 2 * pi * (int)(t / 2 / pi);
double st = atan2(sy,sx);
//printf("%Lf %d %Lf %Lf\n",st,k,mx,my);
if(my - st > 2 * pi) st += 2 * pi;
if(st < mx) res += min(res1,max((double)0.0,t - (mx - st)));
else if(st <= my) res += min(my - st + max((double)0.0,t - (mx + 2 * pi - my)),t);
else res += min(res1,max((double)0.0,t - (mx + 2 * pi - st)));
printf("%.12lf\n",res);
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 2420kb
input:
3 1 0 1 1 1 2 2 1 2 2
output:
1.000000000000
result:
ok found '1.0000000', expected '1.0000000', error '0.0000000'
Test #2:
score: 0
Accepted
time: 0ms
memory: 2472kb
input:
3 1 0 1 2 1 2 2 1 2 2
output:
1.570796326795
result:
ok found '1.5707963', expected '1.5707963', error '0.0000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 2448kb
input:
3 1 0 1 10000 1 2 2 1 2 2
output:
2500.707752257476
result:
ok found '2500.7077523', expected '2500.7077523', error '0.0000000'
Test #4:
score: 0
Accepted
time: 0ms
memory: 2404kb
input:
3 10000 10000 1 10000 10000 9999 10000 10000 9999 10000
output:
0.384241300290
result:
ok found '0.3842413', expected '0.3842413', error '0.0000000'
Test #5:
score: 0
Accepted
time: 0ms
memory: 2364kb
input:
3 -10000 -10000 10000 10000 -10000 -9999 -10000 -10000 -9999 -10000
output:
2500.240670009608
result:
ok found '2500.2406700', expected '2500.2406700', error '0.0000000'
Test #6:
score: 0
Accepted
time: 0ms
memory: 2328kb
input:
4 1 0 1 10000 -2 3400 -4 10000 -4 -10000 -2 -3400
output:
4999.219115408742
result:
ok found '4999.2191154', expected '4999.2191154', error '0.0000000'
Test #7:
score: 0
Accepted
time: 0ms
memory: 2416kb
input:
4 1 0 1 10000 -2 3300 -4 10000 -4 -10000 -2 -3300
output:
4999.200391854815
result:
ok found '4999.2003919', expected '4999.2003919', error '0.0000000'
Test #8:
score: 0
Accepted
time: 0ms
memory: 2516kb
input:
4 -3040 2716 2147 2 -9033 -8520 -8999 -8533 -8988 -8511 -9004 -8495
output:
0.350830058342
result:
ok found '0.3508301', expected '0.3508301', error '0.0000000'
Test #9:
score: 0
Accepted
time: 0ms
memory: 2556kb
input:
3 8168 -766 1549 1256 -3951 -6425 -3874 -6439 -3911 -6389
output:
84.832861161007
result:
ok found '84.8328612', expected '84.8328612', error '0.0000000'
Test #10:
score: 0
Accepted
time: 0ms
memory: 2384kb
input:
8 2977 -3175 8766 2 -4868 7759 -4867 7925 -4867 7950 -4886 7952 -4979 7953 -5048 7877 -5003 7761 -4936 7759
output:
0.327860646906
result:
ok found '0.3278606', expected '0.3278606', error '0.0000000'
Test #11:
score: 0
Accepted
time: 0ms
memory: 2388kb
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.589622784682
result:
ok found '153.5896228', expected '153.5896228', error '0.0000000'
Test #12:
score: 0
Accepted
time: 0ms
memory: 2416kb
input:
8 -9743 -7629 775 7 -194 981 -191 1720 -193 1845 -705 1929 -959 1950 -1131 1894 -1151 1604 -1031 1020
output:
2.046006204356
result:
ok found '2.0460062', expected '2.0460062', error '0.0000000'
Test #13:
score: 0
Accepted
time: 0ms
memory: 2380kb
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.241184963715
result:
ok found '822.2411850', expected '822.2411850', error '0.0000000'
Test #14:
score: 0
Accepted
time: 0ms
memory: 2508kb
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.038765377139
result:
ok found '3.0387654', expected '3.0387654', error '0.0000000'
Test #15:
score: 0
Accepted
time: 0ms
memory: 2508kb
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.423969078937
result:
ok found '262.4239691', expected '262.4239691', error '0.0000000'
Test #16:
score: 0
Accepted
time: 0ms
memory: 2364kb
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.000000000000
result:
ok found '0.0000000', expected '0.0000000', error '-0.0000000'
Test #17:
score: 0
Accepted
time: 0ms
memory: 2468kb
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.966768347891
result:
ok found '758.9667683', expected '758.9667683', error '0.0000000'
Test #18:
score: 0
Accepted
time: 0ms
memory: 2380kb
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.000000000000
result:
ok found '0.0000000', expected '0.0000000', error '-0.0000000'
Test #19:
score: 0
Accepted
time: 0ms
memory: 2444kb
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.311740079399
result:
ok found '3378.3117401', expected '3378.3117401', error '0.0000000'
Test #20:
score: -100
Wrong Answer
time: 0ms
memory: 2524kb
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.759021134227
result:
wrong answer 1st numbers differ - expected: '2.2682334', found: '2.7590211', error = '0.2163744'