제출 #8196

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
8196		gs14004	생물 실험 (IZhO13_expgorl)	C++98	50 / 100	1000 ms	1268 KiB

expgorl

#include <cstdio>
#include <cmath>
#include <utility>
#include <algorithm>
using namespace std;
typedef long long lint;
typedef pair<lint,lint> pi;

int k;
char s[10005];
pi afterCycle, a[10005], laser, ainta, mp[150];
lint minv, maxv;

lint dist(pi x, pi y){
    return (y.second - x.second)*(y.second - x.second) + (y.first - x.first)*(y.first - x.first);
}

pi mv(pi x, int time){
    return pi(x.first + afterCycle.first * time, x.second + afterCycle.second * time);
}

void input(){
    scanf("%d %s",&k,s);
    scanf("%lld %lld %lld %lld",&laser.first,&laser.second,&ainta.first,&ainta.second);
    mp['I'] = pi(0ll,0ll);
    mp['L'] = pi(-1ll,0ll);
    mp['R'] = pi(1ll,0ll);
    mp['B'] = pi(0ll,-1ll);
    mp['F'] = pi(0ll,1ll);
}

int main(){
    input();
    minv = maxv = dist(laser,ainta);
    pi x = ainta;
    for (int i=0; s[i]; i++) {
        x.first += mp[s[i]].first;
        x.second += mp[s[i]].second;
        a[i] = x;
    }
    afterCycle = pi(x.first - ainta.first,x.second - ainta.second);
    for (int i=0; s[i]; i++) {
        for (int j=0; j<k; j++) {
            minv = min(minv,dist(laser,mv(a[i],j)));
        }
        maxv = max(maxv,dist(laser,a[i]));
        maxv = max(maxv,dist(laser,mv(a[i],k-1)));
    }
    printf("%lf\n%lf",sqrt(minv),sqrt(maxv));
}

• Subtask 1: 50 / 100