QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#688275 | #2940. Pooling PCR Tests | kevinyang# | AC ✓ | 0ms | 3980kb | C++17 | 971b | 2024-10-30 02:11:20 | 2024-10-30 02:11:21 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
double eps = 1e-10;
signed main() {
cin.tie(0)->sync_with_stdio(0);
double p;
cin >> p;
vector<double>pw(17);
pw[0] = 1;
for(int i = 1; i<=16; i++){
pw[i] = pw[i-1] * (1-p);
}
vector<double>ans(17);
for(int i = 1; i<=16; i++){
ans[i] = pw[i] + i*(1-pw[i]);
}
bool bad = true;
cout << fixed << setprecision(30);
for(int i = 2; i<=16; i++){
if(ans[i] < i){
bad = false;
}
//cout << ans[i]/i << '\n';
}
if(bad){
cout << "1\n";
return 0;
}
double mn = ans[2]/2;
int idx = 2;
for(int i = 3; i<=16; i++){
if(ans[i]/i+eps < mn){
mn = ans[i]/i;
idx = i;
}
}
cout << idx << '\n';
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3788kb
input:
0.1
output:
4
result:
ok single line: '4'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3760kb
input:
0.02
output:
8
result:
ok single line: '8'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3824kb
input:
0.01
output:
10
result:
ok single line: '10'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3748kb
input:
0.4
output:
2
result:
ok single line: '2'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3812kb
input:
0.24
output:
3
result:
ok single line: '3'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3756kb
input:
0.11
output:
4
result:
ok single line: '4'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3908kb
input:
0.061
output:
5
result:
ok single line: '5'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3824kb
input:
0.035
output:
6
result:
ok single line: '6'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
0.025
output:
7
result:
ok single line: '7'
Test #10:
score: 0
Accepted
time: 0ms
memory: 3828kb
input:
0.02
output:
8
result:
ok single line: '8'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3824kb
input:
0.015
output:
9
result:
ok single line: '9'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3980kb
input:
0.01
output:
10
result:
ok single line: '10'
Test #13:
score: 0
Accepted
time: 0ms
memory: 3756kb
input:
0.009
output:
11
result:
ok single line: '11'
Test #14:
score: 0
Accepted
time: 0ms
memory: 3752kb
input:
0.0075
output:
12
result:
ok single line: '12'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3760kb
input:
0.006
output:
13
result:
ok single line: '13'
Test #16:
score: 0
Accepted
time: 0ms
memory: 3820kb
input:
0.0055
output:
14
result:
ok single line: '14'
Test #17:
score: 0
Accepted
time: 0ms
memory: 3980kb
input:
0.005
output:
15
result:
ok single line: '15'
Test #18:
score: 0
Accepted
time: 0ms
memory: 3948kb
input:
0.0033
output:
16
result:
ok single line: '16'
Test #19:
score: 0
Accepted
time: 0ms
memory: 3752kb
input:
0.001
output:
16
result:
ok single line: '16'