| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 645183 | TimDee | Nicelines (RMI20_nicelines) | C++17 | 0 ms | 0 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 "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 x=query(0,b), y=query(1,b);
assert(x==0);
if (x==y) {
if (b!=0) exit(1);
the_lines_are({0},{b});
return;
}
exit(1);
int a;
if (r) {
assert(b!=0);
a=-b/r;
}
else {
if (query(1,1)==0) a=1;
else if (query(1,-1)==0) a=-1;
else a=0;
}
the_lines_are({a},{b});
}