QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#162175#7110. Kuririn MIRACLEucup-team1198#WA 378ms160248kbC++202.1kb2023-09-03 05:48:412023-09-03 05:48:41

Judging History

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

  • [2023-09-03 05:48:41]
  • 评测
  • 测评结果:WA
  • 用时:378ms
  • 内存:160248kb
  • [2023-09-03 05:48:41]
  • 提交

answer

#include <bits/stdc++.h>

#pragma GCC optimize("fast-math")

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

const ld pi = atan2l(1, 0) * 2;
const int T = 10000000;


ld get_dphi(ld phi, ld u, ld r) {
    ld sinp = sinl(phi);
    return (- u * sinp + sqrtl(u * u * (sinp * sinp + 3))) / (2 * r);
}

ld tphi[T + 2];

void precalc() {
    ld cur_t = 0;
    for (int i = 0; i < T; ++i) {
        ld phi = pi * i / T;
    
        ld dphi = get_dphi(phi, 1, 1);  // at further point better
        cur_t += pi / T / dphi;
        tphi[i + 1] = cur_t;
    }
}

ld get(ld phi, ld v, ld r) {
    ld prop = phi / pi * T;
    int i = floor(prop);

    return r / v * (tphi[i] * (1 - (prop - i)) + tphi[i + 1] * (prop - i));
}

double rush(ld phi, ld r, ld v, ld d, ld t) {
    d -= 2 * r + t * v;

    ld x = - 2 * r * cosl(phi);
    ld y = 2 * r * sinl(phi);

    ld x1 = d - x;
    ld y1 = y;

    ld l = sqrtl(x1 * x1 + y1 * y1);
    ld fac = 2 * v / l;

    x1 *= fac;
    y1 *= fac;

    x1 -= v;

    if (x1 * x > y * y1 - 1e-7) {
        // cerr << l << '\n';
        return l / (2 * v);
    } else {
        return -1;
    }
}

void solve() {
    ld u, r, d;
    
    u = 2.0;
    r = 3;
    d = 30;

    cin >> u >> r >> d;

    if (get(pi, u, r) * u <= d - 2 * r) {
        ld lp = pi / 2;
        ld rp = pi;

        for (int i = 0; i < 200; ++i) {
            ld mp = (lp + rp) / 2;

            ld t = get(mp, u, r);
            if (rush(mp, r, u, d, t) >= 0) {
                rp = mp;
            } else {
                lp = mp;
            }
        }

        ld t = get(rp, u, r);
        cout << t + rush(rp, r, u, d, t) << '\n';

    } else {
        cout << (d - r) / u << '\n';        
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    precalc();


    // for (int i = 0; i < T; ++i) {
    //     presin[i] = sinl(pi * i / T);
    //     precos[i] = cosl(pi * i / T);
    //     pre3sin[i] = presin[i] * presin[i] + 3;
    // }

    cout << fixed << setprecision(15);

    int t = 1000;
    cin >> t;
    while (t--) solve();


    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 378ms
memory: 160140kb

input:

1
2.00 3 30.0

output:

8.310579873394436

result:

ok found '8.3105799', expected '8.3105799', error '0.0000000'

Test #2:

score: -100
Wrong Answer
time: 368ms
memory: 160248kb

input:

100
8.66 6.05 71.59
8.44 8.67 82.55
4.23 9.68 24.74
6.63 9.95 7.45
1.2 7.27 97.55
2.08 2.94 31.61
8.48 5.56 20.16
7.35 5.55 52.48
1.35 8.15 51.23
3.88 9.02 72.37
7.03 1.97 57.03
1.78 4.44 93.44
5.5 6.11 52.94
1.09 9.64 69.01
1.01 3.54 16.78
1.63 4.55 44.06
5.82 5.51 5.92
5.62 2.93 76.01
4.75 4.43 73...

output:

4.457837084359021
5.488360779887392
3.560283687943262
-0.377073906485671
43.266479694873765
8.305490069047340
1.721698113207547
4.015485950275980
31.911111111111111
11.196913490200410
4.155123625209847
27.178962846204111
4.828457745000667
54.467889908256881
13.108910891089109
15.093994367268540
0.07...

result:

wrong answer 3rd numbers differ - expected: '5.8486998', found: '3.5602837', error = '0.3912692'