#include "nice_lines.h"
#include <bits/stdc++.h>
using namespace std;
#define ld long double
int n;
void p1() {
int l=-1e4, r=1e4;
while (l<r) {
int mid=(l+r+1)>>1;
ld x=query(0,mid-1);
ld y=query(0,mid);
ld z=query(0,mid+1);
if (x>=y && y<=z) {
r=mid; break;
}
if (x<=y && y<=z) r=mid-1;
else l=mid;
}
int b=r;
l=-1e4, r=1e4;
while (l<r) {
int mid=(l+r+1)>>1;
ld x=query(mid-1,0);
ld y=query(mid,0);
ld z=query(mid+1,0);
if (x>=y && y<=z) {
r=mid; break;
}
if (x<=y && y<=z) r=mid-1;
else l=mid;
}
int a;
if (r) a=-b/r;
else {
if (query(1,1)==0) a=1;
else if (query(1,-1)==0) a=-1;
else a=0;
}
for (int i=1; i<=10; ++i) {
if(query(i,a*i+b)!=0) cerr<<a<<' '<<b<<' '<<i<<' '<<query(i,a*i+b)<<'\n';
}
the_lines_are({a},{b});
}
void solve(int id, int N) {
n=N;
if (n==1) {
p1(); return;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Incorrect |
1 ms |
208 KB |
Incorrect |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |