#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
template<class T>
void readi(T &x)
{
T input = 0;
bool negative = false;
char c = ' ';
while (c < '-')
{
c = getchar();
}
if (c == '-')
{
negative = true;
c = getchar();
}
while (c >= '0')
{
input = input * 10 + (c - '0');
c = getchar();
}
if (negative)
{
input = -input;
}
x = input;
}
template<class T>
void printi(T output)
{
if (output == 0)
{
putchar('0');
return;
}
if (output < 0)
{
putchar('-');
output = -output;
}
int aout[20];
int ilen = 0;
while(output)
{
aout[ilen] = ((output % 10));
output /= 10;
ilen++;
}
for (int i = ilen - 1; i >= 0; i--)
{
putchar(aout[i] + '0');
}
return;
}
template<class T>
void ckmin(T &a, T b)
{
a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
a = max(a, b);
}
long long randomize(long long mod)
{
return ((1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
#define MP make_pair
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-20;
#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 500013
long long normalize(long long x, long long mod = INF)
{
return (((x % mod) + mod) % mod);
}
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int N, M, K, T;
pii want[MAXN];
pii arr[MAXN];
int dp[MAXN];
struct node
{
node *ch[2];
int sum;
node()
{
ch[0] = ch[1] = nullptr;
sum = 0;
}
};
node *root[MAXN];
int ft[MAXN];
node* initpseg(int L, int R)
{
node *t = new node();
if (L == R)
{
return t;
}
int mid = (L + R) / 2;
t -> ch[0] = initpseg(L, mid);
t -> ch[1] = initpseg(mid + 1, R);
return t;
}
node* update(node *w, int L, int R, int x, int v)
{
if (x < L || R < x)
{
return w;
}
node *t = new node();
if (L == R)
{
t -> sum = w -> sum + v;
t -> ch[0] = t -> ch[1] = nullptr;
return t;
}
int mid = (L + R) / 2;
t -> ch[0] = update(w -> ch[0], L, mid, x, v);
t -> ch[1] = update(w -> ch[1], mid + 1, R, x, v);
t -> sum = t -> ch[0] -> sum + t -> ch[1] -> sum;
return t;
}
int query(node *t, int L, int R, int a, int b)
{
if (b < L || R < a)
{
return 0;
}
if (a <= L && R <= b)
{
return t -> sum;
}
int mid = (L + R) / 2;
return query(t -> ch[0], L, mid, a, b) + query(t -> ch[1], mid + 1, R, a, b);
}
int rect(int X1, int X2, int Y1, int Y2)
{
return query(root[ft[X2]], 0, N, Y1, Y2) - query(root[ft[X1 - 1]], 0, N, Y1, Y2);
}
int cost(int L, int R)
{
return (rect(arr[L].fi + 1, arr[R].fi, arr[R].fi, N));
}
int overpass(int a, int b)
{
//when does a become a better choice then b
int lo = b + 1, hi = K;
while(hi > lo)
{
int mid = (hi + lo) / 2;
if (dp[a] + cost(a, mid) <= dp[b] + cost(b, mid))
{
//a is better than b
hi = mid;
}
else
{
lo = mid + 1;
}
}
return lo;
}
void init(int n, int A[], int B[])
{
N = n;
for (int i = 0; i < N; i++)
{
want[i] = MP(A[i], B[i]);
}
sort(want, want + N);
root[0] = initpseg(0, N);
T = 1;
for (int i = 0; i < N; i++)
{
if (i)
{
for (int j = want[i - 1].fi; j < want[i].fi; j++)
{
ft[j] = T - 1;
}
}
else
{
for (int j = 0; j < want[i].fi; j++)
{
ft[j] = T - 1;
}
}
ft[want[i].fi] = T;
root[T] = update(root[T - 1], 0, N, want[i].se, 1);
T++;
}
for (int j = want[N - 1].fi; j <= N; j++)
{
ft[j] = T - 1;
}
}
int can(int m, int a[])
{
M = m;
int s = 0;
for (int i = 0; i < M; i++)
{
s += a[i];
}
if (s > N)
{
return 0;
}
sort(a, a + M);
K = 1;
arr[0] = {0, 0};
for (int i = 0; i < M; i++)
{
if (i == 0 || a[i] != a[i - 1])
{
arr[K] = MP(a[i], 1);
K++;
}
else
{
arr[K - 1].se++;
}
}
deque<int> opt;
opt.PB(0);
for (int i = 1; i < K; i++)
{
int sz = arr[i].fi;
dp[i] = INF;
while(opt.size() >= 2 && overpass(opt[opt.size() - 2], opt[opt.size() - 1]) <= i)
{
opt.pop_back();
}
int j = opt.back();
ckmin(dp[i], dp[j] + cost(j, i));
dp[i] -= arr[i].fi * arr[i].se;
while(opt.size() >= 2 && overpass(opt[opt.size() - 2], opt[opt.size() - 1]) <= overpass(opt[opt.size() - 1], i))
{
opt.pop_back();
}
opt.PB(i);
}
for (int i = 0; i < K; i++)
{
if (dp[i] < 0)
{
return 0;
}
}
//|neighbors| - |sum of #s| < 0 => die
//there are at most sqrtN distinct guys
return 1;
//check if the sum of values in subset of k's is < sum cnt's of those k's
//you need to make a team if
}
