//#include "nice_lines.h"
#include "bits/stdc++.h"
using namespace std;
long double query(long double x, long double y);
void the_lines_are(std::vector<int> a, std::vector<int> b);
void solve(int subtask_id, int N) {
int x = (1 << 16);
if (N >= 4) {
x = 1024;
}
vector<int> res;
function<void(int, int)> solve = [&] (int l, int r) {
//cout << l << " " << r << endl;
if (r - l < 2) {
return;
}
int m = (l + r) / 2;
if (abs(query(x, m) * 2 - query(x, l) - query(x, r)) < 1e-4) {
return;
}
if (abs(query(x, m) * 2 - query(x, m + 1) - query(x, m - 1)) > 1e-4) {
res.push_back(m);
}
solve(l, m);
solve(m, r);
};
solve(-x * (1 << 13), x * (1 << 13));
vector<int> a, b;
for (int i = 0; i < N; i++) {
int y = res[i] % x;
if (y < 0) {
y += x;
}
if (y >= x / 2) {
y -= x;
}
b.push_back(y);
a.push_back((res[i] - y) / x);
}
the_lines_are(a, b);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
308 KB |
Output is correct |
2 |
Correct |
6 ms |
208 KB |
Output is correct |
3 |
Correct |
5 ms |
208 KB |
Output is correct |
4 |
Correct |
3 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
208 KB |
Output is correct |
2 |
Correct |
8 ms |
208 KB |
Output is correct |
3 |
Correct |
6 ms |
208 KB |
Output is correct |
4 |
Correct |
7 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
208 KB |
Output is correct |
2 |
Correct |
5 ms |
208 KB |
Output is correct |
3 |
Correct |
10 ms |
208 KB |
Output is correct |
4 |
Correct |
9 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
161 ms |
208 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
36 ms |
300 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
161 ms |
208 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |