# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
397072 | Nicholas_Patrick | Sure Bet (CEOI17_sure) | C++17 | 1 ms | 204 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <queue>
#include <cmath>
#include <set>
using namespace std;
struct point{
long long x, y;
point(long long x=0, long long y=0):x(x), y(y){}
bool operator<(point rhs)const{
if(x!=rhs.x)return x<rhs.x;
return y<rhs.y;
}
};
int main(){
int n;
scanf("%d", &n);
if(n>10)return 0;
set<point> candy;
candy.emplace();
vector<point> p(n);
long long ans=0;
for(auto& i: p){
float x, y;
scanf("%f%f", &x, &y), x-=1, y-=1;
i=point(round(x*10000), round(y*10000));
auto candycopy=candy;
for(auto j: candycopy){
ans=max(ans, min(j.x-10000, j.y+i.y));
candy.emplace(j.x-10000, j.y+i.y);
ans=max(ans, min(j.x+i.x, j.y-10000));
candy.emplace(j.x+i.x, j.y-10000);
}
}
printf("%.4lf\n", ans/10000.0);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |