//#include "nice_lines.h"
#include "bits/stdc++.h"
using namespace std;
#define int long long
long double query(long double x, long double y);
void the_lines_are(std::vector<int> a, std::vector<int> b);
int x = (1 << 15);
map<int, long double> mem;
long double query(int y) {
if (mem.find(y) != mem.end()) {
return mem[y];
}
return mem[y] = query(x, y);
}
pair<long double, long double> line(int a, int b) {
long double A = query(a);
long double B = query(b);
long double k = (B - A) / (b - a);
return {k, A - k * a};
}
long double intersection(pair<long double, long double> a, pair<long double, long double> b) {
return (a.second - b.second) / (b.first - a.first);
}
bool check(int a, int b, int c) {
auto L = line(a, b);
auto R = line(b, c);
if (abs(L.first - R.first) < 1e-4) {
return true;
}
return false;
}
void solve(int subtask_id, int N) {
if (subtask_id == 4) {
x = 1024;
}
vector<int> res;
function<void(int, int, int, int)> solve = [&] (int l, int l1, int r, int r1) {
auto L = line(l, l1);
auto R = line(r, r1);
if (abs(L.first - R.first) < 1e-4) {
return;
}
int X = round(intersection(L, R));
if (check(l, l1, X) && check(X, r, r1)) {
res.push_back(X);
return;
}
cout << X << endl;
solve(l, l1, X - 1, X);
solve(X - 1, X, r, r1);
};
solve(-x * (1 << 14), -x * (1 << 14) + 3 * x, x * (1 << 14) - 3 * x, x * (1 << 14));
sort(res.begin(), res.end());
res.resize(unique(res.begin(), res.end()) - res.begin());
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);
}
Compilation message
/usr/bin/ld: /tmp/ccatVH1B.o: in function `solve(long long, long long)':
nicelines.cpp:(.text+0xc25): undefined reference to `the_lines_are(std::vector<long long, std::allocator<long long> >, std::vector<long long, std::allocator<long long> >)'
/usr/bin/ld: /tmp/ccyBrCTC.o: in function `main':
grader.cpp:(.text.startup+0x68): undefined reference to `solve(int, int)'
collect2: error: ld returned 1 exit status
