oj.uz

답안 #84449

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
84449 2018-11-15T08:09:54 Z farukkastamonuda 생물 실험 (IZhO13_expgorl) C++14
0 / 100
 2 ms 376 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;
double k,lx,ly,gx,gy;
char s[li];
double mx,mn=inf,lst,lst2;
double abs1(double a){
	if(a<=0) return -a;
	return a;
}
double dis(double a,double 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("%lf",&k);
	scanf("%s",s+1);
	int t=strlen(s+1);
	scanf("%lf %lf %lf %lf",&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++){
			lst=mx;
			lst2=mn;
			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));
			}
			if(mx>lst && i>1){
				mx+=(k-1)*(mx-lst);
			}
			if(mn<lst2 && i>1){
				mn-=(k-1)*(lst2-mn);
			}
			if(i>1) break;
		}
		printf("%lf\n%lf\n",mn,mx);
	//}
	return 0;
}

Compilation message

expgorl.cpp: In function 'int main()':
expgorl.cpp:24:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lf",&k);
  ~~~~~^~~~~~~~~~
expgorl.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s+1);
  ~~~~~^~~~~~~~~~
expgorl.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lf %lf %lf %lf",&lx,&ly,&gx,&gy);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -