oj.uz

Submission #88963

# Submission time Handle Problem Language Result Execution time Memory
88963 2018-12-10T07:12:22 Z tamazineb Experiments with Gorlum (IZhO13_expgorl) C++14
0 / 100
 260 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;
int a[1],b[1];
int main()
{
int n,p=-1,mx,j=1000000;
cin>>n;
string s;
cin>>s;
cin>>a[0]>>a[1];
cin>>b[0]>>b[1];
for(int w=0;w<n;w++){
for(int k=0;k<s.size();k++){
   if(s[k]=='L') {
    b[0]--;
    mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));

   }
   if(s[k]=='R'){
    b[0]++;
 mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));   }
    if(s[k]=='F'){
       b[1]++;
 mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));

    }
    if(s[k]=='B'){
        b[1]--;
 mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));    }
    if(s[k]=='I'){
 mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));
    }

 if(mx>p)
 p=mx;

 if(mx<j)
    j=mx;
}
mx=0;
}
cout<<j<<" "<<p;
    return 0;
}

Compilation message

expgorl.cpp: In function 'int main()':
expgorl.cpp:13:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(int k=0;k<s.size();k++){
             ~^~~~~~~~~
expgorl.cpp:16:41: warning: array subscript is above array bounds [-Warray-bounds]
     mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));
                                      ~~~^
expgorl.cpp:16:46: warning: array subscript is above array bounds [-Warray-bounds]
     mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));
                                           ~~~^
expgorl.cpp:21:38: warning: array subscript is above array bounds [-Warray-bounds]
  mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));   }
                                   ~~~^
expgorl.cpp:21:43: warning: array subscript is above array bounds [-Warray-bounds]
  mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));   }
                                        ~~~^
expgorl.cpp:23:11: warning: array subscript is above array bounds [-Warray-bounds]
        b[1]++;
        ~~~^
expgorl.cpp:23:11: warning: array subscript is above array bounds [-Warray-bounds]
expgorl.cpp:24:38: warning: array subscript is above array bounds [-Warray-bounds]
  mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));
                                   ~~~^
expgorl.cpp:28:12: warning: array subscript is above array bounds [-Warray-bounds]
         b[1]--;
         ~~~^
expgorl.cpp:28:12: warning: array subscript is above array bounds [-Warray-bounds]
expgorl.cpp:29:38: warning: array subscript is above array bounds [-Warray-bounds]
  mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));    }
                                   ~~~^
expgorl.cpp:31:38: warning: array subscript is above array bounds [-Warray-bounds]
  mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));
                                   ~~~^
expgorl.cpp:31:43: warning: array subscript is above array bounds [-Warray-bounds]
  mx=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));
                                        ~~~^

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 260 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -