# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1009136 | 2024-06-27T09:16:20 Z | tarpent | Experiments with Gorlum (IZhO13_expgorl) | C++14 | 56 ms | 348 KB |
#include<bits/stdc++.h> using namespace std; long long n,gx,gy,lx,ly; string pu; double mi,ma,tr; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n; cin>>pu; cin>>lx>>ly>>gx>>gy; mi= INT_MAX; ma=0; int siz; char e; siz = pu.size(); for(int i = 0; i<n; i++){ for(int j = 0; j<siz; j++){ e=pu[j]; if(e=='L'){ gx-=1; } else if(e=='R'){ gx+=1; } else if(e=='F'){ gy+=1; } else if(e=='B'){ gy-=1; } else if(e=='I'){ continue; } tr=sqrt(abs(lx-gx)^2 +abs(ly-gy)^2); if(tr<mi) mi = tr; if(tr>ma) ma = tr; } } cout<<fixed; cout<<setprecision(12); cout<<mi<<' '<<ma; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 56 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |