QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#501130 | #5152. Circular Caramel Cookie | Ink_bai | TL | 0ms | 3924kb | C++20 | 989b | 2024-08-02 14:39:09 | 2024-08-02 14:39:09 |
Judging History
answer
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define G2 1.41421356237
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
if(n % 4 == 0) n += 1;
long double l = 1, r = n;
if(l <= G2) l = G2;
while (l + 1e-9 < r) {
long double m = (l + r) / 2;
int sum = 0;
int m_int = (int)m;
int tt = 1;
if(n >= 10000) tt = m_int/G2;
else tt = m_int;
// if(m_int > 100) tt = m_int - 100000;
for (int i = 1; i <= tt; ++i) {
int max_j = sqrt(m * m - i * i);
sum += max_j;
}
if(n >= 10000) sum = 2 * sum - tt * tt;
sum *= 4;
if(sum >= n) {
r = m;
} else {
l = m;
}
}
cout << fixed << setprecision(10) << l << endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3872kb
input:
11
output:
2.2360679769
result:
ok found '2.2360680', expected '2.2360680', error '0.0000000'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
59
output:
4.9999999994
result:
ok found '5.0000000', expected '5.0000000', error '0.0000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3744kb
input:
1
output:
1.4142135624
result:
ok found '1.4142136', expected '1.4142136', error '0.0000000'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3832kb
input:
2
output:
1.4142135624
result:
ok found '1.4142136', expected '1.4142136', error '0.0000000'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3832kb
input:
3
output:
1.4142135624
result:
ok found '1.4142136', expected '1.4142136', error '0.0000000'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
4
output:
2.2360679775
result:
ok found '2.2360680', expected '2.2360680', error '0.0000000'
Test #7:
score: -100
Time Limit Exceeded
input:
1000000000