oj.uz

답안 #882095

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
882095 2023-12-02T15:19:34 Z alexdd 생물 실험 (IZhO13_expgorl) C++17
0 / 100
 1000 ms 432 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
int k;
string s;
int dist(int gx, int gy, int lx, int ly)
{
    return (gx-lx)*(gx-lx) + (gy-ly)*(gy-ly);
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>k>>s;
    //k = min(k, 40000);
    int gx,gy,lx,ly;
    cin>>lx>>ly>>gx>>gy;
    int mnm = dist(gx,gy,lx,ly), mxm = dist(gx,gy,lx,ly);
    int cpx = gx, cpy = gy;
    gx=0;
    gy=0;
    for(int i=0;i<(int)s.size();i++)
    {
        if(s[i]=='L')
        {
            gx--;
        }
        else if(s[i]=='R')
        {
            gx++;
        }
        else if(s[i]=='F')
        {
            gy++;
        }
        else if(s[i]=='B')
        {
            gy--;
        }
        //if(abs(gx-lx) > 20000 || abs(gy-ly) > 20000)
          //  break;
        //mnm = min(mnm, dist(gx,gy,lx,ly));
        //mxm = max(mxm, dist(gx,gy,lx,ly));
    }
    int dx = gx, dy = gy;
    gy = cpy;
    gx = cpx;
    for(int i=0;i<=k;i++)
    {
        mnm=min(mnm,dist(gx+dx*i,gy+dy*i,lx,ly));
        mxm=max(mxm,dist(gx+dx*i,gy+dy*i,lx,ly));
    }
    for(int i=0;i<k;i++)
    {
        ///(gy + cv - ly)^2 <= mnm
        ///abs(gy + cv - ly) <= mnm
        ///
        int sq = (int)sqrt(mnm) + 5;


        ///(gy + cv - ly)^2 >= mxm
        bool bl=0;
        if(((gy + 10000 - ly) * (gy + 10000 - ly) >= mxm || (gy - 10000 - ly) * (gy - 10000 - ly) >= mxm) && ((gx + 10000 - lx) * (gx + 10000 - lx) >= mxm || (gx - 10000 - lx) * (gx - 10000 - lx) >= mxm))
            bl=1;
        if(abs(gy-ly)<=sq && abs(gx-lx)<=sq)
            bl=1;
        if(bl || 1)
        {
            for(int j=0;j<s.size();j++)
            {
                if(s[j]=='L')
                {
                    gx--;
                }
                else if(s[j]=='R')
                {
                    gx++;
                }
                else if(s[j]=='F')
                {
                    gy++;
                }
                else if(s[j]=='B')
                {
                    gy--;
                }
                //if(abs(gx-lx) > 20000 || abs(gy-ly) > 20000)
                  //  break;
                mnm = min(mnm, dist(gx,gy,lx,ly));
                mxm = max(mxm, dist(gx,gy,lx,ly));
            }
        }
        else
        {
            gx += dx;
            gy += dy;
        }
    }
    long double d1 = sqrt(mnm);
    long double d2 = sqrt(mxm);
    cout<<fixed<<setprecision(10)<<d1<<" "<<d2;
    return 0;
}

Compilation message

expgorl.cpp: In function 'int main()':
expgorl.cpp:68:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |             for(int j=0;j<s.size();j++)
      |                         ~^~~~~~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 344 KB Output is correct
2 Correct 63 ms 348 KB Output is correct
3 Correct 74 ms 428 KB Output is correct
4 Correct 71 ms 348 KB Output is correct
5 Correct 37 ms 348 KB Output is correct
6 Correct 55 ms 344 KB Output is correct
7 Correct 59 ms 432 KB Output is correct
8 Correct 82 ms 348 KB Output is correct
9 Execution timed out 1063 ms 348 KB Time limit exceeded
10 Halted 0 ms 0 KB -