# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253461 | Markoes | Wish (LMIO19_noras) | C++14 | 190 ms | 11376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int n;
long long R,a,b,c,d,l,r,mid,teng,tmp1,tmp2,opo,bwh,ats;
vector<pair<long long,long long> > v;
long long dist(long long x){
long long ret;
ret = (a+c*x)*(a+c*x) + (b+d*x)*(b+d*x);
return ret;
}
int main(){
ios_base::sync_with_stdio(NULL);
cin.tie(0);cout.tie(0);
cin>>n>>R;
R *= R;
for(int i=1;i<=n;i++){
cin>>a>>b>>c>>d;
c = c-a;
d = d-b;
a -= c;
b -= d;
opo = max(abs(c),abs(d));
l = 1;
r = 1e9/opo;
//cout<<r<<endl;
while(l<=r){
mid = (l+r)/2;
tmp1 = dist(mid);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |