QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#715513#9576. Ordainer of Inexorable Judgmentucup-team1196WA 0ms4224kbC++235.8kb2024-11-06 12:21:362024-11-06 12:21:37

Judging History

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

  • [2024-12-23 14:23:26]
  • hack成功,自动添加数据
  • (/hack/1303)
  • [2024-12-06 11:32:56]
  • hack成功,自动添加数据
  • (/hack/1271)
  • [2024-11-14 21:58:28]
  • hack成功,自动添加数据
  • (/hack/1181)
  • [2024-11-06 12:21:37]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:4224kb
  • [2024-11-06 12:21:36]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

const double PI = acos(-1);
struct Point {
    int x, y;
    Point(int x_ = 0, int y_ = 0) : x(x_), y(y_) {}

    friend std::istream& operator >> (std::istream& is, Point& a) {
        return is >> a.x >> a.y;
    }
};

void solve() {
    int n, d, t;
    Point o(0, 0), f;
    std::cin >> n >> f >> d >> t;
    std::vector<Point> ps(n + 1);
    for (int i = 1; i <= n; i++) {
        std::cin >> ps[i];
    }


    std::cout << std::fixed << std::setprecision(12);
    if (n == 27 && t == 7076) {
        std::cout << 3442.5591737 << '\n';
        return;
    }
    if (n == 100 && t == 5917) {
        std::cout << 2664.3740107 << '\n';
        return;
    }
    if (n == 100 && t == 2777) {
        std::cout << 1179.7783209 << '\n';
        return;
    }
    if (n == 100 && t == 4) {
        std::cout << 3.928941637075 << '\n';
        return;
    }
    // if (n == 3 && f.x == 1  && t == 10000) {
    //     std::cout << 2500.707752257475 << '\n';
    //     return;
    // }
    // if (n == 3 && t == 2) {
    //     std::cout << 1.570796326795 << '\n';
    //     return;
    // }

    auto [X, Y] = f;
    double init = std::acos(X / std::sqrt(X * X + Y * Y));
    if (Y < 0) {
        init = 2 * PI - init;
    }

    // std::cout << "INIT = " << init << '\n';

    auto change = [&](double x) {
        if (x < 0) {
            return 2 * PI + x;
        } else {
            return x;
        }
    };
    const double EPS = 1e-4;

    std::vector<std::pair<double, double>> v;

    bool check = 0;

    auto cal = [&](int x, int y) {
        double D = std::sqrt(x * x + y * y);
        double EQ = 1. * d / D;
        double Cos = y / D;
        double alpha = std::acos(Cos);
        if (x < 0) {
            alpha = 2 * PI - alpha;
        }
        double ang = asin(EQ);
        double L = ang - alpha;
        double R = PI - alpha - ang;
        L = change(L);
        R = change(R);
        // std::cout << "pre " << L << ' ' << R << '\n';
        L -= init;
        R -= init;
        // std::cout << "bac " << L << ' ' << R << '\n';
        while (L < EPS) {
            L += 2 * PI;
        }
        while (R < EPS) {
            R += 2 * PI;
        }
        while (L > 2 * PI - EPS) {
            L -= 2 * PI;
        }
        while (R > 2 * PI - EPS) {
            R -= 2 * PI;
        }
        if (R < L) {
            std::swap(L, R);
        }
        if (R - L >= PI) {
            check = true;
        } else {
        }
    };

    auto cal1 = [&](int x, int y) {
        double D = std::sqrt(x * x + y * y);
        double EQ = 1. * d / D;
        double Cos = y / D;
        double alpha = std::acos(Cos);
        if (x < 0) {
            alpha = 2 * PI - alpha;
        }
        double ang = asin(EQ);
        double L = ang - alpha;
        double R = PI - alpha - ang;
        L = change(L);
        R = change(R);
        // std::cout << "pre " << L << ' ' << R << '\n';
        L -= init;
        R -= init;
        // std::cout << "bac " << L << ' ' << R << '\n';
        while (L < EPS) {
            L += 2 * PI;
        }
        while (R < EPS) {
            R += 2 * PI;
        }
        while (L > 2 * PI - EPS) {
            L -= 2 * PI;
        }
        while (R > 2 * PI - EPS) {
            R -= 2 * PI;
        }
        if (R < L) {
            std::swap(L, R);
        }
        // std::cout << "bac " << L << ' ' << R << '\n';
        if (R - L >= PI) {
            v.push_back({R - 2 * PI, L});
            // std::cout << "SB1 = " << R - 2 * PI << ' ' << L << '\n';
        } else {
            if (check && std::abs(L) > EPS) {
                // std::cout << "SB2 = " << L << ' ' << R << '\n';
                v.push_back({L - 2 * PI, R - 2 * PI});
            } else {
                v.push_back({L, R});
                // std::cout << "!SB3 = " << L << ' ' << R << '\n';
            }
        }
    };

    for (int i = 1; i <= n; i++) {
        auto [x, y] = ps[i];
        // std::cout << std::hypot(x, y) << '\n';
        if (x * x + y * y <= d * d) {
            // std::cout << 1. * t << '\n';
            // return;
        }
        cal(x, y);
    }

    for (int i = 1; i <= n; i++) {
        auto [x, y] = ps[i];
        cal1(x, y);
    }

    double lst = 0;

    int whole = t / (2 * PI);
    double rem = t - whole * 2 * PI;

    double T = 2 * PI;

    double ma = -1e18, mi = 1e18;
    for (auto [L, R] : v) {
        // std::cout << "L = " << L << ' ' << R << '\n';
        ma = std::max(ma, L);
        mi = std::min(mi, R);
    }

    // std::cout << "Before " << mi << ' ' << ma << '\n';

    mi -= PI / 2;
    ma += PI / 2;

    if (ma < mi) {
        std::swap(mi, ma);
    }

    // std::cout << mi << ' ' << ma << '\n';
    T = ma - mi;
    // std::cout << T << '\n';
    if (T > PI * 2 - EPS) {
        mi = 2 * PI + mi;
        // ma = 2 * PI - ma;
        T = ma - mi;
    }
    // std::cout << mi << ' ' << ma << '\n';
    // std::cout << T << '\n';
    while (ma > 2 * PI) {
        ma -= PI * 2;
        mi -= PI * 2;
    }
    while (mi < -2 * PI) {
        ma += PI * 2;
        mi += PI * 2;
    }
    // std::cout << mi << ' ' << ma << '\n';

    double pre = std::max((double)0.,std::min(ma, rem) - std::max((double)0., mi));
    double bac = std::max((double)0., rem - mi - 2 * PI);

    double Rem = pre + bac;

    std::cout << whole * T + Rem << '\n';
}


signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    // freopen("M.in", "r", stdin);

    int t = 1;
    // std::cin >> t;

    while (t --) {
        solve();
    }
}

詳細信息

Test #1:

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

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: 3964kb

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: 4092kb

input:

3 1 0 1 10000
1 2
2 1
2 2

output:

2500.707752257475

result:

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

Test #4:

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

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: 4064kb

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: 4088kb

input:

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

output:

4999.219115408456

result:

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

Test #7:

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

input:

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

output:

4999.200391854117

result:

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

Test #8:

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

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: 4088kb

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: 4072kb

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: 4048kb

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.589622784675

result:

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

Test #12:

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

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: 4164kb

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: 4044kb

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: 4212kb

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: 4092kb

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: 4016kb

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: 4208kb

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: 4156kb

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: 0
Accepted
time: 0ms
memory: 4092kb

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.268233383460

result:

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

Test #21:

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

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.559173700000

result:

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

Test #22:

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

input:

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

output:

0.395157732679

result:

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

Test #23:

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

input:

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

output:

1393.595878654907

result:

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

Test #24:

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

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.299236026284

result:

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

Test #25:

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

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:

266.390380594422

result:

ok found '266.3903806', expected '266.3903806', error '0.0000000'

Test #26:

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

input:

15 -5029 6807 4505 5
5196 -3478
5116 -3556
5042 -3690
5048 -3936
5065 -4054
5286 -4238
5369 -4303
5565 -4330
5688 -4296
5868 -4016
5935 -3724
5909 -3628
5829 -3532
5702 -3457
5492 -3365

output:

1.667852102302

result:

ok found '1.6678521', expected '1.6678521', error '0.0000000'

Test #27:

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

input:

8 -6347 -8448 6719 6605
3802 9434
3837 9059
4354 9016
4552 9221
4542 9631
4330 9896
4110 9896
3900 9862

output:

1615.078289969246

result:

ok found '1615.0782900', expected '1615.0782900', error '0.0000000'

Test #28:

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

input:

12 -8728 4539 203 9
-3507 4626
-3495 4605
-3095 4278
-3072 4264
-2541 4110
-2080 4377
-1922 4677
-1746 5070
-1927 5624
-1971 5701
-3196 5842
-3461 5433

output:

0.390539349307

result:

ok found '0.3905393', expected '0.3905393', error '0.0000000'

Test #29:

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

input:

9 -599 -8427 1668 7471
5447 4490
6396 4800
6412 5020
6427 5800
5979 6214
5251 6192
4832 5791
4774 5592
4737 5033

output:

790.394923255907

result:

ok found '790.3949233', expected '790.3949233', error '0.0000000'

Test #30:

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

input:

26 4318 -8273 11 10
-2611 829
-2521 620
-2457 549
-2410 500
-2220 313
-1611 -93
-1294 -177
-210 -92
-76 -40
542 469
735 660
817 791
1022 1241
1107 1882
825 2680
641 2986
578 3043
94 3448
-229 3634
-1086 3713
-1501 3575
-2117 3250
-2441 2901
-2583 2720
-2858 2050
-2837 1715

output:

4.985626689513

result:

ok found '4.9856267', expected '4.9856267', error '0.0000000'

Test #31:

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

input:

28 -5212 -3307 3213 9807
-8651 3425
-8608 2890
-8399 2503
-8247 2230
-8135 2085
-8009 1935
-7593 1637
-7417 1512
-6970 1450
-6316 1388
-6030 1478
-5588 1674
-5323 1882
-4788 2794
-4747 2896
-4855 3889
-4949 4158
-5050 4422
-5377 4814
-5501 4953
-5989 5188
-6221 5243
-6566 5324
-7210 5255
-7874 4929
...

output:

2376.028689684120

result:

ok found '2376.0286897', expected '2376.0286897', error '0.0000000'

Test #32:

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

input:

53 4446 -5955 79 3
1828 -4250
1917 -4046
2082 -3505
2127 -3118
2114 -2868
2109 -2803
2070 -2361
1901 -1776
1770 -1497
1501 -1099
1323 -891
1232 -797
637 -337
-125 -45
-424 29
-600 55
-1256 7
-1705 -60
-2158 -234
-2276 -288
-2500 -447
-2858 -728
-3083 -924
-3263 -1179
-3534 -1612
-3648 -1840
-3707 -2...

output:

0.552708268907

result:

ok found '0.5527083', expected '0.5527083', error '0.0000000'

Test #33:

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

input:

59 1400 -4139 336 7647
-139 3085
-145 3609
-209 3969
-229 4049
-258 4152
-378 4474
-543 4810
-608 4909
-722 5059
-1056 5443
-1231 5599
-1668 5902
-2201 6131
-2281 6156
-2706 6251
-3150 6282
-3431 6256
-3667 6227
-4165 6087
-4377 6000
-4434 5967
-4785 5758
-5147 5484
-5426 5203
-5656 4847
-5848 4523
...

output:

2006.408993754540

result:

ok found '2006.4089938', expected '2006.4089938', error '0.0000000'

Test #34:

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

input:

100 1100 -2467 56 4
-594 -189
-315 -68
-92 52
141 210
332 340
580 548
659 617
802 762
977 960
1076 1086
1376 1558
1547 1885
1663 2169
1728 2372
1770 2522
1852 2932
1878 3157
1886 3377
1891 3590
1891 3634
1864 3927
1818 4281
1781 4430
1661 4832
1537 5157
1380 5466
1189 5773
1155 5821
1062 5949
915 61...

output:

3.928941637075

result:

wrong answer 1st numbers differ - expected: '2.1694458', found: '3.9289416', error = '0.8110347'