# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1009165 | bornag | Experiments with Gorlum (IZhO13_expgorl) | C++98 | 1036 ms | 348 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;
#define ll long long
#define ld long double
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
ll lx, ly, gx, gy;
string s, si;
unordered_map<int, ld> sqs;
ll k;
int main(){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cout << fixed << setprecision(12);
cin >> k >> si;
for(int i = 0; i < si.size(); i++){
if(si[i] != 'I') s+=si[i];
}
cin >> lx >> ly >> gx >> gy;
ld mxi = -1;
ld mni = LLONG_MAX;
ld di = abs(gx-lx)*abs(gx-lx) + abs(gy-ly)*abs(gy-ly);
mxi = max(mxi, di);
mni = min(mni, di);
for(int i = 0; i < k; i++){
for(int j = 0; j < s.size(); j++){
char c = s[j];
if(c == 'L') gx--;
else if(c == 'R') gx++;
else if(c == 'F') gy++;
else if(c == 'B') gy--;
di = abs(gx-lx)*abs(gx-lx) + abs(gy-ly)*abs(gy-ly);
mxi = max(mxi, di);
mni = min(mni, di);
}
}
cout << sqrt(mni) << ' ' << sqrt(mxi) << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |