제출 #742966

#제출 시각아이디문제언어결과실행 시간메모리
742966jamezzzNicelines (RMI20_nicelines)C++17
0 / 100
1 ms208 KiB
#include <bits/stdc++.h>
using namespace std;
#include "nice_lines.h"

#define maxn 10000

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(0,10000),x2=query(0,10001);
	int a=(int)pow(1/((x2-x1)*(x2-x1))-1,0.5);//+-a
	int b=(int)(10001-x2*pow(a*a+1,0.5));
	if(dist(a,b,1,b+1)!=query(1,b+1))a=-a;
	the_lines_are({a},{b});
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...