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;
#include "nice_lines.h"
#define maxn 10000
#define EPS 1e-3
typedef long double ld;
#define dist(a,b,x,y) (ld)abs(y-a*x-b)/pow(1+a*a,0.5)
void solve(int subtask_id,int N){
ld x1=query(1,20000),x2=query(1,20001);
ld inv=1/(x2-x1);
int a=(int)(pow(inv*inv-1,0.5)+EPS);
int b=(int)(20001-x2*pow(a*a+1,0.5)-a+EPS);
if(abs(dist(a,b,1,20001)-x2)>EPS){
a=-a;
b=(int)(20001-x2*pow(a*a+1,0.5)-a+EPS);
}
the_lines_are({a},{b});
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |