QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#501405 | #5152. Circular Caramel Cookie | ziripo | TL | 0ms | 3980kb | C++20 | 693b | 2024-08-02 17:54:33 | 2024-08-02 17:54:33 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> a, pair<int, int> b) {
return a.first * a.first + a.second * a.second < b.first * b.first + b.second * b.second;
}
int main() {
double s; cin >> s;
double n = s / 4;
vector<pair<int, int>> a;
for (int i = 1; i <= sqrt(n)+1; i++)
for (int j = 1; j <= i; j++)
a.push_back({ i,j });
sort(a.begin(), a.end(), cmp);
vector<vector<int>> v(n + 1, vector<int>(n + 1));
int sum = 0;
for (pair<int, int> i : a) {
if (i.first == i.second)
sum += 1;
else
sum += 2;
if (sum > n) {
printf("%.10f", sqrtf(i.first * i.first + i.second * i.second));
break;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3980kb
input:
11
output:
2.2360680103
result:
ok found '2.2360680', expected '2.2360680', error '0.0000000'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3780kb
input:
59
output:
5.0000000000
result:
ok found '5.0000000', expected '5.0000000', error '0.0000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3904kb
input:
1
output:
1.4142135382
result:
ok found '1.4142135', expected '1.4142136', error '0.0000000'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3912kb
input:
2
output:
1.4142135382
result:
ok found '1.4142135', expected '1.4142136', error '0.0000000'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
3
output:
1.4142135382
result:
ok found '1.4142135', expected '1.4142136', error '0.0000000'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3980kb
input:
4
output:
2.2360680103
result:
ok found '2.2360680', expected '2.2360680', error '0.0000000'
Test #7:
score: -100
Time Limit Exceeded
input:
1000000000