Submission #169560

#	Time	Username	Problem	Language	Result	Execution time	Memory
169560		davitmarg	생물 실험 (IZhO13_expgorl)	C++17	0 / 100	218 ms	376 KiB

expgorl

/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 10004;

LL k, n, sx, sy, lx, ly, x[N], y[N];
string s;
LD mn = mod * mod, mx;

int main()
{
    cin >> k;
    cin >> s;
    n = s.length();
    s = "#" + s;
    cin >> ly >> lx >> sy >> sx;
    ly -= sy;
    lx -= sx;
    sy = 0;
    sx = 0;
    for (int i = 1; i <= n; i++)
    {
        x[i] = x[i - 1];
        y[i] = y[i - 1];
        if (s[i] == 'R')
            x[i]++;
        else if (s[i] == 'L')
            x[i]--;
        else if (s[i] == 'F')
            y[i]++;
        else if (s[i] == 'B')
            y[i]--;
    }

    for (LL i = 0; i < k; i++)
        for (int j = 0; j <= n; j++)
        {
            LD d = sqrt((y[n] * i + y[j] - ly) * (y[n] * i + y[j] - ly) + (x[n] * i + x[j] - lx) * (x[n] * i + x[j] - lx));
            mn = min(mn, d);
            mx = max(mx, d);
        }
    printf("%.11f %.11f\n", (double)mn, (double)mx);
    return 0;
}

/*


*/

• Subtask 1: 0 / 100