# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107875 | SamAnd | Experiments with Gorlum (IZhO13_expgorl) | C++17 | 5 ms | 512 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 <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
const int N=100005;
struct ban
{
long long x,y;
};
long double her(const ban& a,const ban& b)
{
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+0.0);
}
int k,n;
char a[N];
ban laser,s,g;
long double minu=10000000000007,maxu;
void ubd(ban t)
{
long double h=her(laser,t);
if(h<minu)
minu=h;
if(h>maxu)
maxu=h;
}
void stg(int ki)
{
ban t;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |