제출 #742898

#제출 시각아이디문제언어결과실행 시간메모리
742898jamezzzNicelines (RMI20_nicelines)C++17
0 / 100
3070 ms292 KiB
#include <bits/stdc++.h> using namespace std; #include "nice_lines.h" void solve(int subtask_id,int N){ long double ans[]={query(0,0),query(0,1),query(0,2)}; for(int a=-1e4;a<=1e4;++a){ long double denom=pow(1+a*a,0.5); for(int b=-1e4;b<=1e4;++b){ bool can=true; //printf("%d %d: ",a,b); for(int x=0;x<=2;++x){ //printf("(%Lf %Lf) ",(a*x+b)/pow((long double)1+a*a,0.5),ans[x]); if(abs((long double)(a*x+b)/denom-ans[x])>1e-6)can=false; } //printf("\n"); if(can)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...