Submission #634928

#TimeUsernameProblemLanguageResultExecution timeMemory
634928pragmatist생물 실험 (IZhO13_expgorl)C++17
0 / 100
139 ms65536 KiB
#include<bits/stdc++.h> #define ll long long #define pb push_back #define x first #define y second #define sz(v) (int)v.size() #define all(v) v.begin(), v.end() #define ld long double #define nl "\n" using namespace std; using pii = pair<int, int>; const int N = (int)1e5 + 7; const int inf = (int)1e9 + 7; const ll INF = (ll)1e18 + 7; const int MOD = (int)1e9 + 7; const int M = (int)5e4 + 7; int k, Lx, Ly, Gx, Gy; string a; ll dist(int x1, int y1, int x2, int y2) { return 1ll * (x1 - x2) * (x1 - x2) + 1ll * (y1 - y2) * (y1 - y2); } void solve() { cin >> k >> a >> Lx >> Ly >> Gx >> Gy; string s; while(k--) { s += a; } ll mn = INF, mx = -INF; mn = min(mn, dist(Gx, Gy, Lx, Ly)); mx = max(mx, dist(Gx, Gy, Lx, Ly)); for(auto x : s) { if(x == 'L') Gx--; if(x == 'R') Gx++; if(x == 'F') Gy++; if(x == 'B') Gy--; mn = min(mn, dist(Gx, Gy, Lx, Ly)); mx = max(mx, dist(Gx, Gy, Lx, Ly)); } cout << fixed << setprecision(9) << sqrt(mn) << ' ' << sqrt(mx) << nl; } signed main() { ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0); int test = 1; //cin >> test; while(test--) { solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...