#include <algorithm>
#include <iostream>
#include <tgmath.h>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <set>
typedef long long llong;
const int MAXN = 100000 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e9;
struct House
{
int x, h, v;
inline friend bool operator < (const House &a, const House &b)
{
return a.x < b.x || (a.x == b.x && a.h < b.h) || (a.x == b.x && a.h == b.h && a.v < b.v);
}
} houses[MAXN];
int n, t;
int x[MAXN];
int h[MAXN];
int v[MAXN];
bool gotPresent[MAXN];
std::multiset <int> s;
std::multiset <int> toGive;
std::vector <int> used[MAXN];
std::vector <std::pair <int,bool>> left;
inline bool cmp(std::pair <int,bool> x, std::pair <int,bool> y)
{
return x.first > y.first || (x.first == y.first && x.second < y.second);
}
bool check(int idx, int allowed)
{
left.clear();
for (const int &i : used[allowed-1])
{
left.emplace_back(i, 0);
}
for (int i = allowed ; i <= idx ; ++i)
{
left.emplace_back(v[i], h[i]);
}
std::sort(left.begin(), left.end(), cmp);
int cnt = 0;
for (int i = 0 ; i < left.size() ; ++i)
{
if (left[i].second == 0) cnt++;
else if (cnt >= 1) cnt--;
}
return cnt == 0;
}
int maxElvePos;
int minElveIdx;
void solve()
{
for (int i = 1 ; i <= n ; ++i)
{
if (h[i] == 0) toGive.insert(v[i]);
else
{
auto it = toGive.lower_bound(v[i]);
if (it != toGive.end()) toGive.erase(it);
}
used[i].clear();
used[i].reserve(toGive.size());
for (const int &j : toGive) used[i].push_back(j);
std::reverse(used[i].begin(), used[i].end());
}
int ptr = 1;
for (int i = 1 ; i <= n ; ++i)
{
if (x[i] < maxElvePos)
{
std::cout << -1 << ' ';
continue;
}
while (ptr + 1 <= i && check(i, ptr + 1)) ptr++;
if (l == 0) std::cout << -1 << ' ';
else std::cout << 2*x[i] - x[ptr] << ' ';
}
std::cout << '\n';
}
void read()
{
std::cin >> n;
for (int i = 1 ; i <= n ; ++i) std::cin >> houses[i].x;
for (int i = 1 ; i <= n ; ++i) std::cin >> houses[i].h;
for (int i = 1 ; i <= n ; ++i) std::cin >> houses[i].v;
std::sort(houses + 1, houses + 1 + n);
for (int i = 1 ; i <= n ; ++i)
{
x[i] = houses[i].x;
h[i] = houses[i].h;
v[i] = houses[i].v;
if (h[i] == 0)
{
maxElvePos = x[i];
minElveIdx = i;
}
}
}
void fastIO()
{
std::ios_base :: sync_with_stdio(0);
std::cout.tie(nullptr);
std::cin.tie(nullptr);
}
int main()
{
fastIO();
std::cin >> t;
while (t--)
{
read();
solve();
}
return 0;
}
Compilation message
santa.cpp: In function 'bool check(int, int)':
santa.cpp:57:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, bool> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
57 | for (int i = 0 ; i < left.size() ; ++i)
| ~~^~~~~~~~~~~~~
santa.cpp: In function 'void solve()':
santa.cpp:95:13: error: 'l' was not declared in this scope
95 | if (l == 0) std::cout << -1 << ' ';
| ^
