# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
84447 | 2018-11-15T08:02:00 Z | farukkastamonuda | 생물 실험 (IZhO13_expgorl) | C++14 | 1000 ms | 544 KB |
#include <bits/stdc++.h> #define fi first #define se second #define mp make_pair #define lo long long #define inf 1000000000 #define md 1000000007 #define pb push_back #define li 100005 using namespace std; int k,lx,ly,gx,gy; char s[li]; double mx,mn=inf; double abs1(double a){ if(a<=0) return -a; return a; } double dis(int a,int b){ double aa=a,bb=b; double cc=lx,dd=ly; return sqrt(abs1(aa-cc)*abs1(aa-cc)+abs1(bb-dd)*abs1(bb-dd)); } int main(){ scanf("%d",&k); scanf("%s",s+1); int t=strlen(s+1); scanf("%d %d %d %d",&lx,&ly,&gx,&gy); mx=max(mx,dis(gx,gy)); mn=min(mn,dis(gx,gy)); //if(k<=20000 && t<=2000){ for(int i=1;i<=k;i++){ for(int j=1;j<=t;j++){ if(s[j]=='L'){ gx--; } if(s[j]=='R'){ gx++; } if(s[j]=='F'){ gy++; } if(s[j]=='B'){ gy--; } mx=max(mx,dis(gx,gy)); mn=min(mn,dis(gx,gy)); } } printf("%lf\n%lf\n",mn,mx); //} return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 212 ms | 356 KB | Output is correct |
2 | Correct | 352 ms | 500 KB | Output is correct |
3 | Correct | 371 ms | 528 KB | Output is correct |
4 | Correct | 369 ms | 544 KB | Output is correct |
5 | Correct | 168 ms | 544 KB | Output is correct |
6 | Correct | 269 ms | 544 KB | Output is correct |
7 | Correct | 332 ms | 544 KB | Output is correct |
8 | Correct | 444 ms | 544 KB | Output is correct |
9 | Execution timed out | 1086 ms | 544 KB | Time limit exceeded |
10 | Halted | 0 ms | 0 KB | - |