# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339503 | beksultan04 | Experiments with Gorlum (IZhO13_expgorl) | C++14 | 2 ms | 364 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 int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 3e5+12,INF=1e9+7;
pair<double,double> p[N];
int k;
double laser1,laser2,xxxx,yyyy;
string s;
double disting(double x,double y,double x1,double y1){
ret (x-x1)*(x-x1)+(y-y1)*(y-y1);
}
void answer(double &ans){
double l=0,r=0,i;
for (i=0;i<s.size();++i){
if (s[i] == 'L')l--;
if (s[i] == 'R')l++;
if (s[i] == 'F')r++;
if (s[i] == 'B')r--;
ans = max(ans,disting(laser1,laser2,xxxx+l,yyyy+r));
}
l*=k-1;
r*=k-1;
for (i=0;i<s.size();++i){
if (s[i] == 'L')l--;
if (s[i] == 'R')l++;
if (s[i] == 'F')r++;
if (s[i] == 'B')r--;
ans = max(ans,disting(laser1,laser2,xxxx+l,yyyy+r));
}
}
double fun(int x){
double l = (x-1)*p[s.size()-1].fr;
double r = (x-1)*p[s.size()-1].sc;
double ans=INF;
for (int i=0;i<s.size();++i){
ans = min(ans,disting(laser1,laser2,xxxx+l+p[i].sc,yyyy+r+p[i].fr));
}
ret ans;
}
main(){
scan1(k)
cin>>s>>laser1>>laser2>>xxxx>>yyyy;
int i,j;
double mx=disting(laser1,laser2,xxxx,yyyy),mn=disting(laser1,laser2,xxxx,yyyy);
answer(mx);
for (i=0;i<s.size();++i){
if (i != 0)
p[i] = p[i-1];
if (s[i] == 'L')p[i].fr--;
if (s[i] == 'R')p[i].fr++;
if (s[i] == 'F')p[i].sc++;
if (s[i] == 'B')p[i].sc--;
}
int l=0,r=k;
int fff=200;
while (fff--){
int m1 = l+((r-l)/3);
int m2 = r-((r-l)/3);
if (fun((m1)) <= fun((m2))){
r = m2;
}
else l =m1;
}
mn = min(mn,fun(l));
mn = min(mn,fun(r));
cout <<sqrt(mn)<<" "<<sqrt(mx);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |