Submission #88961

#TimeUsernameProblemLanguageResultExecution timeMemory
88961beso123Experiments with Gorlum (IZhO13_expgorl)C++14
0 / 100
1046 ms844 KiB
#include <bits/stdc++.h> #include <iostream> #include <iomanip> using namespace std; double n; double a1,b1,a2,b2; double dis1; void dis(){ double a=(a1-a2)*(a1-a2); double b=(b1-b2)*(b1-b2); dis1=sqrt(a+b); } int main(){ cin>>n; string s; cin>>s; int m=s.size(); cin>>a1>>b1>>a2>>b2; double mn=INT_MAX,mx=-INT_MAX; for(int i=1;i<=n;i++){ for(int k=0;k<m;k++){ dis(); if(mx<dis1) mx=dis1; if(mn>dis1) mn=dis1; if(s[k]=='L') a2--; if(s[k]=='R') a2++; if(s[k]=='F') b2++; if(s[k]=='B') b2--; /* if(s[k]=='I'){ cout<<fixed; cout<<setprecision(12)<<mn<<' '; cout<<setprecision(12)<<mx; return 0; }*/ } } dis(); if(mx<dis1) mx=dis1; if(mn>dis1) mn=dis1; cout<<fixed; cout<<setprecision(12)<<mn<<' '; cout<<setprecision(12)<<mx; //cout<<fixed; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...