# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88979 | 2018-12-10T07:39:41 Z | lazarus88 | Experiments with Gorlum (IZhO13_expgorl) | C++14 | 2 ms | 252 KB |
#include<bits/stdc++.h> using namespace std; int main(){ int k; cin>>k; string s; cin>>s; double dis=0,min=9999999,max=0; pair<int,int> l,g; cin>>l.first>>l.second; cin>>g.first>>g.second; dis=sqrt((l.first-g.first)*(l.first-g.first)+(l.second-g.second)*(l.second-g.second)); if(dis<min) min=dis; if(dis>max) max=dis; for(int i=0;i<s.size();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-l.first)*(g.first-l.first)+(g.second-l.second)*(g.second-l.second)); if(dis<min) min=dis; if(dis>max) max=dis; } cout<<min<<' '<<max; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 252 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |