Submission #89110

#TimeUsernameProblemLanguageResultExecution timeMemory
89110lazarus88Experiments with Gorlum (IZhO13_expgorl)C++14
0 / 100
2 ms256 KiB
#include<bits/stdc++.h> using namespace std; int main(){ long long k; cin>>k; string s; cin>>s; double dis=0,min=9999999,max=0; pair<long long,long long> l,g; cin>>l.first>>l.second; cin>>g.first>>g.second; g.first-=l.first; g.second-=l.second; dis=sqrt(g.first*g.first+g.second*g.second); if(dis<min) min=dis; if(dis>max) max=dis; int q=s.size(); for(int i=0;i<q;i++){ if(s[i]=='L') g.second--; if(s[i]=='R') g.second++; if(s[i]=='F') g.first++; if(s[i]=='B') g.first--; dis=sqrt(g.first*g.first+g.second*g.second); if(dis<min) min=dis; if(dis>max) max=dis; } cout<<fixed<<setprecision(12)<<min<<' '<<max; }
#Verdict Execution timeMemoryGrader output
Fetching results...