QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#140793 | #5152. Circular Caramel Cookie | As3b_team_f_masr# | WA | 59ms | 17248kb | C++14 | 1.3kb | 2023-08-16 20:28:54 | 2023-08-16 20:28:57 |
Judging History
answer
#include <bits/stdc++.h>
typedef long double ld;
typedef long long ll;
using namespace std;
int di[] = {1, 0, -1, 0, 0, 1, -1, 1};
int dj[] = {0, 1, 0, -1, -1, 0, 1, -1};
const ll oo = 1e18, MOD = 1e9 + 7;
const int N = 2e5+ 5, M = 30005;
#define EPS 1e-9
int t, m, ans;
ll n;
int main() {
//ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
//freopen("output.txt", "w", stdout);
cin >> n;
n--;
/*for(int i = 1; i < n ;++i){
int u,v;
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}*/
map<ll,int> mp;
vector<ll>sq;
for(int i=0;i<N;i++)
{
sq.push_back(1ll*i*i);
mp[1ll*i*i]=i;
}
ld lo=0,hi=N;
while(hi-lo>EPS) {
ld mid = (lo + hi) / 2.0;
ll y = 1.0 * mid * mid;
ll id1 = 0, id2 = 0, mx = 0;
for (auto x:sq) {
if(!x)continue;
if (x > y)break;
int pos = upper_bound(sq.begin(), sq.end(), y - x) - sq.begin() - 1;
if (pos == -1)continue;
else {
mx+=4*mp[sq[pos]];
}
}
//cout<<lo<<" "<<hi<<" "<<mid<<" "<<mx<<" "endl;
if (mx >=n)
{
hi=mid;
}
else lo=mid;
}
cout<<fixed<<setprecision(11)<<lo;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 55ms
memory: 17248kb
input:
11
output:
2.23606797695
result:
ok found '2.2360680', expected '2.2360680', error '0.0000000'
Test #2:
score: 0
Accepted
time: 59ms
memory: 17196kb
input:
59
output:
4.99999999978
result:
ok found '5.0000000', expected '5.0000000', error '0.0000000'
Test #3:
score: -100
Wrong Answer
time: 54ms
memory: 17228kb
input:
1
output:
0.00000000000
result:
wrong answer 1st numbers differ - expected: '1.4142136', found: '0.0000000', error = '1.0000000'