Submission #89010

#TimeUsernameProblemLanguageResultExecution timeMemory
89010LkvatashidzeExperiments with Gorlum (IZhO13_expgorl)C++17
0 / 100
2 ms376 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; double mn, mx; int k; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> k; string s; cin >> s; double x, y, x1, y1; cin >> x >> y; cin >> x1 >> y1; mn=sqrt((x1-x)*(x1-x)+(y-y1)*(y-y1)); int n=s.size(); int x2=0, y2=0; for (int i=0; i<n; i++) { if (s[i]=='L') x1--, x2--; if (s[i]=='R') x1++, x2++; if (s[i]=='F') y1++, y2++; if (s[i]=='B') y1--, y2--; double p=sqrt((x1-x)*(x1-x)+(y-y1)*(y-y1)); mn=min(mn,p); mx=max(mx,p); } k--; while (k>0) { x1+=x2; y1+=y2; k--; double p=sqrt((x1-x)*(x1-x)+(y-y1)*(y-y1)); mn=min(mn,p); mx=max(mx,p); } cout << fixed << setprecision(12) << mn << ' '; cout << fixed << setprecision(12) << mx; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...