#include "nice_lines.h"
#include <bits/stdc++.h>
#define ld long double
using namespace std;
const int x=1e5;
const ld eps=1e-12;
vector <int> a,b;
void dnc(ld l, ld r, ld lo, ld hi){
ld mid=(l+r)/2,m=query(x,mid);
if (abs((lo+hi)/2-m)<eps)
return;
if (r-l<1){
int y=floor(r);
int B=(y%x+x)%x;
if (B>10000)
B-=x;
int A=(y-B)/x;
a.push_back(A);
b.push_back(B);
return;
}
dnc(l,mid,lo,m);
dnc(mid,r,m,hi);
}
void solve(int subtask_id, int N){
dnc(-2e9,2e9+1e-6,query(x,-2e9),query(x,2e9+1e-6));
the_lines_are(a,b);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
432 KB |
Output is correct |
2 |
Correct |
1 ms |
440 KB |
Output is correct |
3 |
Correct |
1 ms |
436 KB |
Output is correct |
4 |
Correct |
1 ms |
436 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
436 KB |
Output is correct |
2 |
Correct |
1 ms |
432 KB |
Output is correct |
3 |
Correct |
1 ms |
432 KB |
Output is correct |
4 |
Correct |
1 ms |
692 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
436 KB |
Output is correct |
2 |
Correct |
2 ms |
432 KB |
Output is correct |
3 |
Correct |
2 ms |
440 KB |
Output is correct |
4 |
Correct |
2 ms |
684 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
85 ms |
688 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
11 ms |
436 KB |
Output is partially correct |
2 |
Incorrect |
13 ms |
436 KB |
Incorrect |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
85 ms |
688 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |