# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89020 | tamazineb | Experiments with Gorlum (IZhO13_expgorl) | C++14 | 3 ms | 504 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 main()
{
int n,mx;
int a[1],b[1];
double j=1000000,p=-1;
cin>>n;
string s;
cin>>s;
cin>>a[0]>>a[1];
cin>>b[0]>>b[1];
for(int w=0;w<n;w++){
for(int k=0;k<s.size();k++){
if(s[k]=='L') {
b[0]--;
mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));
}
if(s[k]=='R'){
b[0]++;
mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1])); }
if(s[k]=='F'){
b[1]++;
mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));
}
if(s[k]=='B'){
b[1]--;
mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1])); }
if(s[k]=='I'){
mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));
}
if(mx>p)
p=mx;
if(mx<j)
j=mx;
}
mx=0;
}
cout<<fixed<<setprecision(12)<<j<<" ";
cout<<fixed<<setprecision(12)<<p;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |