QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#226327 | #7329. Independent Events | PPP# | WA | 275ms | 10060kb | C++17 | 2.3kb | 2023-10-25 20:22:24 | 2023-10-25 20:22:24 |
Judging History
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 = 50;
ld dp[2 * 134'000][BUBEN];
ld lazy[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;
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]);
}
}
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;
}
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;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3844kb
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: 275ms
memory: 10060kb
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.002077206650 -0.087028601196 -0.001970593407 -0.001720740425 -0.318571762107 -0.000930266964 -0.096670070173 -0.027806789664 -0.000850180901 -0.019377365382 -0.149311965454 -0.079548929737 -0.179267734093 -0.004080636362 -0.002692768631 -0.153444508274 -0.150068799443 -0.150585849...
result:
wrong answer 2nd numbers differ - expected: '-0.1728569398', found: '-0.0020772066', error = '0.1707797332'