QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#756620 | #9576. Ordainer of Inexorable Judgment | infCraft | WA | 0ms | 3940kb | C++17 | 2.7kb | 2024-11-16 21:13:15 | 2024-11-16 21:13:15 |
Judging History
你现在查看的是最新测评结果
- [2024-12-23 14:23:26]
- hack成功,自动添加数据
- (/hack/1303)
- [2024-12-06 11:32:56]
- hack成功,自动添加数据
- (/hack/1271)
- [2024-11-16 21:13:15]
- 提交
answer
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " = " << x << endl
#define endl '\n'
#define fori(x, y) for (int i=(x);i<=(y);++i)
#define forj(x, y) for (int j=(x);j<=(y);++j)
#define fork(x, y) for (int k=(x);k<=(y);++k)
#define double long double
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
const double PI = acos(-1.0);
/*
3 1 0 1 10
-1 -2
-2 -1
-2 -2
*/
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, x0, y0, d;
double t;
cin >> n >> x0 >> y0 >> d >> t;
vector<pll> vec;
fori(1, n) {
int x, y;
cin >> x >> y;
vec.push_back({x, y});
}
bool in = false;
for (auto [x, y]: vec) {
if (x*x+y*y<=d*d) {
in = true;
break;
}
}
cout << fixed << setprecision(15);
if (in) {
cout << t << endl;
return 0;
}
vector<pdd> rang;
for (auto [x, y]: vec) {
double s = 0;
if (x == 0&&y > 0) s = PI/2;
else if (x == 0&&y < 0) s = -PI/2;
else {
s = atan((double)y/x);
if (x<0) s = s+PI;
}
double r = acos((double)d/sqrt(x*x+y*y));
rang.push_back({s, r});
// debug(s);
// debug(r);
}
// exist ????
int cnt1 = 0, cnt2 = 0;
for (auto [x, y]: vec) {
if (y<0&&x<0) cnt1++;
if (y<0&&x>0) cnt2++;
}
if (cnt1&&cnt2) for (auto& [s, r]: rang) if (s<PI/2) s += 2*PI;
double le = 1e9, ri = -1e9;
for (auto [s, r]: rang) {
// debug(s);
// debug(r);
le = min(le, s-PI/2+r);
ri = max(ri, s+PI/2-r);
}
// debug(le);
// debug(ri);
int per = t/(2*PI);
double ans = 0;
ans += per*(ri-le);
// debug(ans);
t -= per*2*PI;
double ang = 0;
if (x0 == 0&&y0 > 0) ang = PI/2;
else if (x0 == 0&&y0 < 0) ang = -PI/2;
else {
ang = atan((double)y0/x0);
if (x0<0) ang = ang+PI;
}
// debug(ang);
if (ang > ri) ang -= 2*PI;
if (ang>=le&&ang<=ri) {
double dis = ri-ang;
// debug(dis);
if (t<dis) {
ans += t;
cout << ans << endl;
return 0;
}
ans += dis;
t -= dis;
dis = le-ri+2*PI;
if (t<dis) {
cout << ans << endl;
return 0;
}
t -= dis;
ans += t;
cout << ans << endl;
return 0;
}
double dis = le-ang;
if (t<dis) {
cout << ans << endl;
return 0;
}
t -= dis;
dis = ri-le;
ans += min(dis, (double)t);
cout << ans << endl;
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3936kb
input:
3 1 0 1 1 1 2 2 1 2 2
output:
1.000000000000000
result:
ok found '1.0000000', expected '1.0000000', error '0.0000000'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3864kb
input:
3 1 0 1 2 1 2 2 1 2 2
output:
1.570796326794896
result:
ok found '1.5707963', expected '1.5707963', error '0.0000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3828kb
input:
3 1 0 1 10000 1 2 2 1 2 2
output:
2500.707752257475146
result:
ok found '2500.7077523', expected '2500.7077523', error '0.0000000'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
3 10000 10000 1 10000 10000 9999 10000 10000 9999 10000
output:
0.384241300290070
result:
ok found '0.3842413', expected '0.3842413', error '0.0000000'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
3 -10000 -10000 10000 10000 -10000 -9999 -10000 -10000 -9999 -10000
output:
2500.240670009608200
result:
ok found '2500.2406700', expected '2500.2406700', error '0.0000000'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3812kb
input:
4 1 0 1 10000 -2 3400 -4 10000 -4 -10000 -2 -3400
output:
4999.219115408742782
result:
ok found '4999.2191154', expected '4999.2191154', error '0.0000000'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3864kb
input:
4 1 0 1 10000 -2 3300 -4 10000 -4 -10000 -2 -3300
output:
4999.200391854814753
result:
ok found '4999.2003919', expected '4999.2003919', error '0.0000000'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
4 -3040 2716 2147 2 -9033 -8520 -8999 -8533 -8988 -8511 -9004 -8495
output:
0.350830058342073
result:
ok found '0.3508301', expected '0.3508301', error '0.0000000'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
3 8168 -766 1549 1256 -3951 -6425 -3874 -6439 -3911 -6389
output:
84.832861161006929
result:
ok found '84.8328612', expected '84.8328612', error '0.0000000'
Test #10:
score: 0
Accepted
time: 0ms
memory: 3840kb
input:
8 2977 -3175 8766 2 -4868 7759 -4867 7925 -4867 7950 -4886 7952 -4979 7953 -5048 7877 -5003 7761 -4936 7759
output:
0.327860646906108
result:
ok found '0.3278606', expected '0.3278606', error '0.0000000'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3860kb
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.589622784682112
result:
ok found '153.5896228', expected '153.5896228', error '0.0000000'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3800kb
input:
8 -9743 -7629 775 7 -194 981 -191 1720 -193 1845 -705 1929 -959 1950 -1131 1894 -1151 1604 -1031 1020
output:
2.046006204355634
result:
ok found '2.0460062', expected '2.0460062', error '0.0000000'
Test #13:
score: 0
Accepted
time: 0ms
memory: 3940kb
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.241184963714710
result:
ok found '822.2411850', expected '822.2411850', error '0.0000000'
Test #14:
score: 0
Accepted
time: 0ms
memory: 3880kb
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.038765377139072
result:
ok found '3.0387654', expected '3.0387654', error '0.0000000'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3796kb
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.423969078937309
result:
ok found '262.4239691', expected '262.4239691', error '0.0000000'
Test #16:
score: 0
Accepted
time: 0ms
memory: 3860kb
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.000000000000000
result:
ok found '0.0000000', expected '0.0000000', error '-0.0000000'
Test #17:
score: 0
Accepted
time: 0ms
memory: 3812kb
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.966768347891124
result:
ok found '758.9667683', expected '758.9667683', error '0.0000000'
Test #18:
score: 0
Accepted
time: 0ms
memory: 3876kb
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.000000000000000
result:
ok found '0.0000000', expected '0.0000000', error '-0.0000000'
Test #19:
score: 0
Accepted
time: 0ms
memory: 3804kb
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.311740079399094
result:
ok found '3378.3117401', expected '3378.3117401', error '0.0000000'
Test #20:
score: 0
Accepted
time: 0ms
memory: 3848kb
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.268233383460396
result:
ok found '2.2682334', expected '2.2682334', error '0.0000000'
Test #21:
score: 0
Accepted
time: 0ms
memory: 3908kb
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.559173706863610
result:
ok found '3442.5591737', expected '3442.5591737', error '0.0000000'
Test #22:
score: 0
Accepted
time: 0ms
memory: 3808kb
input:
5 -7413 -6822 8371 4 -8435 1969 -8446 1918 -8438 1885 -8390 1892 -8422 1955
output:
0.395157732679363
result:
ok found '0.3951577', expected '0.3951577', error '0.0000000'
Test #23:
score: 0
Accepted
time: 0ms
memory: 3876kb
input:
5 5998 6928 4304 9649 -9352 -3336 -9335 -3337 -9282 -3320 -9273 -3304 -9313 -3284
output:
1393.595878654907023
result:
ok found '1393.5958787', expected '1393.5958787', error '0.0000000'
Test #24:
score: 0
Accepted
time: 0ms
memory: 3808kb
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.299236026284499
result:
ok found '3.2992360', expected '3.2992360', error '0.0000000'
Test #25:
score: -100
Wrong Answer
time: 0ms
memory: 3860kb
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.430912408722818
result:
wrong answer 1st numbers differ - expected: '266.3903806', found: '265.4309124', error = '0.0036017'