# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
882050 | alexdd | Experiments with Gorlum (IZhO13_expgorl) | C++17 | 583 ms | 600 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<bits/stdc++.h>
using namespace std;
int k;
string s;
long long dist(long long gx, long long gy, long long lx, long long ly)
{
return (gx-lx)*(gx-lx) + (gy-ly)*(gy-ly);
}
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>k>>s;
k = min(k, 40000);
int gx,gy,lx,ly;
cin>>lx>>ly>>gx>>gy;
long long mnm = dist(gx,gy,lx,ly), mxm = dist(gx,gy,lx,ly);
int poz=0;
int lim = k * (int)s.size();
for(int i=0;i<lim;i++)
{
if(s[poz]=='L')
{
gx--;
}
else if(s[poz]=='R')
{
gx++;
}
else if(s[poz]=='F')
{
gy++;
}
else if(s[poz]=='B')
{
gy--;
}
mnm = min(mnm, dist(gx,gy,lx,ly));
mxm = max(mxm, dist(gx,gy,lx,ly));
poz++;
if(poz==(int)s.size())
poz=0;
}
long double d1 = sqrt(mnm);
long double d2 = sqrt(mxm);
cout<<fixed<<setprecision(10)<<d1<<" "<<d2;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |