#include "horses.h"
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pii pair<ll, ll>
const ll mod = 1e9 + 7;
const ll mxN = 5e5 + 5;
using namespace std;
ll NN;
struct tree
{
vector<pii> seg;
ll s, e;
void init(ll n)
{
NN = exp2(ceil(log2(n)));
seg.resize(NN * 4);
}
ll queryMax(ll l = 1, ll r = NN, ll ind = 1)
{
if (l > e || r < s)
return 0;
if (l >= s && r <= e)
return seg[ind].F;
ll md = (l + r) / 2;
return max(queryMax(l, md, ind * 2), queryMax(md + 1, r, ind * 2 + 1));
}
ll queryProd(ll l = 1, ll r = NN, ll ind = 1)
{
if (l > e || r < s)
return 1;
if (l >= s && r <= e)
return seg[ind].S;
ll md = (l + r) / 2;
return (queryProd(l, md, ind * 2) * queryProd(md + 1, r, ind * 2 + 1)) % mod;
}
void update(pii val, ll ind)
{
ind += NN;
seg[ind] = val;
while (ind /= 2)
{
seg[ind].F = max(seg[ind * 2].F, seg[ind * 2 + 1].F);
seg[ind].S = (seg[ind * 2].S * seg[ind * 2 + 1].S) % mod;
}
}
} seg;
struct ones
{
ll l, r;
friend bool operator<(ones a, ones b)
{
return a.l < b.l;
}
};
set<ones> s;
ll x[mxN], y[mxN];
ll n;
ll solve()
{
ll st, id = 0;
ll i = n - 1;
while (i && id <= 100)
{
if (x[i] == 1)
{
auto it = s.upper_bound({i, i});
it--;
i = (*it).l;
}
i--;
id++;
}
ll mx = -1, mxid = -1;
ll prd = 1;
for (i; i < n; i++)
{
if (x[i] == -1)
{
auto it = s.lower_bound({i, i});
seg.s = (*it).l + 1, seg.e = (*it).r + 1;
ll val = seg.queryMax();
if (val * prd > mx)
{
mx = val;
mxid = i;
prd = 1;
}
i = (*it).r;
continue;
}
if (prd * x[i] > mx)
{
mx = y[i];
mxid = i;
prd = 1;
continue;
}
prd *= x[i];
if (prd * y[i] > mx)
{
mx = y[i];
mxid = i;
prd = 1;
continue;
}
}
seg.s = 1;
seg.e = mxid + 1;
return (mx * seg.queryProd()) % mod;
}
ll init(ll N, ll X[], ll Y[])
{
seg.init(N);
n = N;
for (ll i = 0; i < N; i++)
{
y[i] = Y[i];
x[i] = X[i];
seg.update({Y[i], X[i]}, i);
}
ll l = -1, r = -1;
for (ll i = 0; i < N; i++)
{
if (X[i] == 1)
{
if (l == -1)
l = i;
r = i;
}
else
{
if (l != -1)
{
s.insert({l, r});
l = r = -1;
}
}
}
if (l != -1)
{
s.insert({l, r});
l = r = -1;
}
return solve();
}
ll updateX(ll pos, ll val)
{
if (x[pos] != 1 && val == 1)
{
auto it = s.upper_bound({pos, pos});
ll l = pos, r = pos;
if (it != s.end() && (*it).l == pos + 1)
{
l = pos, r = (*it).r;
s.erase(it);
s.insert({l, r});
}
else
s.insert({pos, pos});
it = s.lower_bound({pos, pos});
auto p = s.lower_bound({l, r});
if (it != s.begin())
{
it--;
if ((*it).r == l - 1)
{
l = (*it).l;
s.erase(it);
s.erase(s.lower_bound({pos, pos}));
s.insert({l, r});
}
}
}
if (x[pos] == 1 && val != 1)
{
auto it = s.upper_bound({pos, 0});
it--;
ll l = (*it).l, r = pos - 1, l1 = pos + 1, r1 = (*it).r;
s.erase(it);
if (l <= r)
s.insert({l, r});
if (l1 <= r1)
s.insert({l1, r1});
}
x[pos] = val;
seg.update({y[pos], x[pos]}, pos);
return solve();
}
ll updateY(ll pos, ll val)
{
y[pos] = val;
seg.update({y[pos], x[pos]}, pos);
return solve();
}
Compilation message
horses.cpp: In member function 'void tree::init(long long int)':
horses.cpp:18:12: warning: conversion from 'double' to 'long long int' may change value [-Wfloat-conversion]
18 | NN = exp2(ceil(log2(n)));
| ~~~~^~~~~~~~~~~~~~~
horses.cpp: In function 'long long int solve()':
horses.cpp:78:7: warning: statement has no effect [-Wunused-value]
78 | for (i; i < n; i++)
| ^
horses.cpp:63:5: warning: unused variable 'st' [-Wunused-variable]
63 | ll st, id = 0;
| ^~
horses.cpp: In function 'long long int updateX(long long int, long long int)':
horses.cpp:165:8: warning: variable 'p' set but not used [-Wunused-but-set-variable]
165 | auto p = s.lower_bound({l, r});
| ^
/usr/bin/ld: /tmp/ccjXDl90.o: in function `main':
grader.c:(.text.startup+0xaa): undefined reference to `init(int, int*, int*)'
/usr/bin/ld: grader.c:(.text.startup+0x113): undefined reference to `updateX(int, int)'
/usr/bin/ld: grader.c:(.text.startup+0x16d): undefined reference to `updateY(int, int)'
collect2: error: ld returned 1 exit status
