QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#226337#7329. Independent EventsPPP#WA 523ms10064kbC++172.4kb2023-10-25 20:26:522023-10-25 20:26:53

Judging History

This is the latest submission verdict.

  • [2023-10-25 20:26:53]
  • Judged
  • Verdict: WA
  • Time: 523ms
  • Memory: 10064kb
  • [2023-10-25 20:26:52]
  • Submitted

answer

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;

#define pb push_back

typedef long long ll;
typedef long double ld;
int n, m;
const int maxN = 1e5 + 10;
ld p[maxN];
const int BUBEN = 75;
ld dp[2 * 134'000][BUBEN];
ld lazy[4 * maxN];
void merge(int v) {
    for (int k = 0; k < BUBEN; k++) {
        dp[v][k] = dp[2 * v][k] + dp[2 * v + 1][k];
    }
}
void build(int v, int tl, int tr) {
    lazy[v] = 1;
    if (tl == tr) {
        dp[v][0] = 1;
        for (int z = 1; z < BUBEN; z++) {
            dp[v][z] = dp[v][z - 1] * p[tl];
        }
        return;
    }
//    cout << " TUT " << v << " " << tl << " " << tr << endl;
    int tm = (tl + tr) / 2;
    build(2 * v, tl, tm);
    build(2 * v + 1, tm + 1, tr);
    merge(v);
}
ld ans = 0;
void apply(int v, ld k) {
    ld x = 1;
    lazy[v] *= k;
    for (int z = 0; z < BUBEN; z++) {
        dp[v][z] *= x;
        x *= k;
    }
}
void push(int v, int tl, int tr) {
    if (tl != tr) {
        apply(2 * v, lazy[v]);
        apply(2 * v + 1, lazy[v]);
    }
    lazy[v] = 1;
}
void go(int v, int tl, int tr, int l, int r) {
    if (tr < l || tl > r) return;
    if (l <= tl && tr <= r) {
        for (int k = 1; k < BUBEN; k++) ans += dp[v][k] / k;
        return;
    }
    push(v, tl, tr);
    int tm = (tl + tr) / 2;
    go(2 * v, tl, tm, l, r);
    go(2 * v + 1, tm + 1, tr, l, r);
}
void upd(int v, int tl, int tr, int l, int r, ld k) {
    if (tr < l || tl > r) return;
    if (l <= tl && tr <= r) {
        apply(v, k);
        return;
    }
    push(v, tl, tr);
    int tm = (tl + tr) / 2;
    upd(2 * v, tl, tm, l, r, k);
    upd(2 * v + 1, tm + 1, tr, l, r, k);
    merge(v);
}
void solve() {
    for (int i = 1; i <= n; i++) {
        cin >> p[i];
    }
    build(1, 1, n);
    while (m--) {
        int tp, l, r;
        cin >> tp >> l >> r;
        if (tp == 0) {
            ans = 0;
            go(1, 1, n, l, r);
            cout << fixed << setprecision(12) << -ans << '\n';
        }
        else {
            ld k;
            cin >> k;
            upd(1, 1, n, l, r, k);
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    while (cin >> n >> m) {
        solve();
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 5988kb

input:

6 5
0.01000 0.09871 0.00005 0.00999 0.01234 0.02345
0 1 6
1 3 4 10.00000
0 1 6
1 1 2 0.05000
0 1 6

output:

-0.160214877278
-0.255874176895
-0.147343477321

result:

ok 3 numbers

Test #2:

score: -100
Wrong Answer
time: 523ms
memory: 10064kb

input:

54 36
0.00014 0.00020 0.00054 0.00084 0.00088 0.00095 0.00031 0.00077 0.00054 0.00050 0.00024 0.00057 0.00066 0.00029 0.00084 0.00031 0.00024 0.00091 0.00063 0.00069 0.00024 0.00041 0.00090 0.00057 0.00071 0.00031 0.00047 0.00016 0.00063 0.00074 0.00040 0.00077 0.00058 0.00049 0.00013 0.00076 0.0007...

output:

-0.000940442077
-0.172856939841
-0.647243684110
-0.001447320472
-0.092955641905
-0.930783280601
-0.064102393188
-0.091664042818
-0.047742692391
-0.000850180901
-0.031857810984
-0.237312223565
-0.517538000549
-0.653499425353
-0.301089175013
-0.062422318722
-0.476679973076
-0.317678112868
-0.393605508...

result:

wrong answer 159th numbers differ - expected: '-0.0003542665', found: '-0.0003542665', error = '0.0000000000'