/*
PROG: source
LANG: C++11
_____
.' '.
/ 0 0 \
| ^ |
| \ / |
\ '---' /
'._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
struct chash
{
int operator()(int x) const
{
x ^= (x >> 20) ^ (x >> 12);
return x ^ (x >> 7) ^ (x >> 4);
}
int operator()(long long x) const
{
return x ^ (x >> 32);
}
};
template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using hashtable = gp_hash_table<T, T, chash>;
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);
}
template<class T>
T normalize(T x, T mod = 1000000007)
{
return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
return ((1ll << 15) * rand() + rand()) % mod;
}
#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;
const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;
#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 100013
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
int N, T;
int arr[MAXN];
vector<int> compress;
vector<int> edge[MAXN];
int parent[MAXN];
int quer[MAXN];
int depth[MAXN];
int ancestor[25][MAXN];
ll fenwick[MAXN];
int seg[4 * MAXN];
int st[MAXN], ft[MAXN];
vector<int> clr;
void update(int idx, ll v)
{
for (int e = idx + 1; e <= N; e += e & (-e))
{
fenwick[e] += v;
clr.PB(e);
}
return;
}
ll query(int idx)
{
ll res = 0;
for (int e = idx + 1; e; e -= e & (-e))
{
res += fenwick[e];
}
return res;
}
void dfs(int u)
{
st[u] = T;
ft[u] = T;
T++;
for (int v : edge[u])
{
dfs(v);
ft[u] = ft[v];
}
return;
}
int DNE = -INF; //MODIFY AS APPROPRIATE
int comb(int a, int b)
{
return max(a, b);
}
void upd(int w, int L, int R, int a, int val)
{
if (a < L || a > R)
{
return;
}
if (L > R)
{
return;
}
if (L == R)
{
seg[w] = val;
return;
}
int mid = (L + R)/2;
upd(2 * w, L, mid, a, val);
upd(2 * w + 1, mid + 1, R, a, val);
seg[w] = comb(seg[2 * w], seg[2 * w + 1]);
return;
}
int qu(int w, int L, int R, int a, int b)
{
if (L > R || a > b)
{
return DNE;
}
if (a > R || b < L)
{
return DNE;
}
if (a <= L && R <= b)
{
return seg[w];
}
int mid = (L + R)/2;
return comb(qu(2 * w, L, mid, a, b), qu(2 * w + 1, mid + 1, R, a, b));
}
int get(int l, int r)
{
return qu(1, 0, N, l, r);
}
int32_t main()
{
ios_base::sync_with_stdio(0);
srand(time(0));
// cout << fixed << setprecision(10);
// cerr << fixed << setprecision(10);
if (fopen("input.in", "r"))
{
freopen ("input.in", "r", stdin);
freopen ("output.out", "w", stdout);
}
cin >> N;
compress.resize(N);
for (int i = 0; i < N; i++)
{
cin >> arr[i];
compress[i] = arr[i];
}
sort(compress.begin(), compress.end());
compress.erase(unique(compress.begin(), compress.end()), compress.end());
for (int i = 0; i < N; i++)
{
arr[i] = LB(compress.begin(), compress.end(), arr[i]) - compress.begin();
}
arr[N] = N;
parent[0] = N;
depth[0] = 0;
st[N] = N;
ft[N] = N;
for (int i = 0; i < N - 1; i++)
{
int u, v;
cin >> u >> v;
u--; v--;
parent[v] = u;
edge[u].PB(v);
depth[v] = depth[u] + 1;
quer[i] = v;
}
dfs(0);
for (int i = 0; i < 25; i++)
{
ancestor[i][N] = N;
}
for (int i = 0; i < N; i++)
{
ancestor[0][i] = parent[i];
}
for (int i = 1; i <= 21; i++)
{
for (int j = 0; j < N; j++)
{
ancestor[i][j] = ancestor[i - 1][ancestor[i - 1][j]];
}
}
for (int i = 0; i <= N; i++)
{
upd(1, 0, N, i, -i - 1);
}
for (int i = 0; i < N - 1; i++)
{
//query inversions on path to u
//update path to u to all be equal to arr[u]
ll ans = 0;
int u = quer[i], v = parent[u];
while(v != N)
{
ll freq = 1;
for (int j = (32 - __builtin_clz(depth[v])); j >= 0; j--)
{
if (get(st[v], ft[v]) == get(st[ancestor[j][v]], ft[ancestor[j][v]]))
{
freq += (1 << j);
v = ancestor[j][v];
}
}
ans += freq * query(arr[quer[get(st[v], ft[v])]] - 1);
update(arr[quer[get(st[v], ft[v])]], freq);
v = parent[v];
}
for (int x : clr)
{
fenwick[x] = 0;
}
clr.clear();
upd(1, 0, N, st[u], i);
//most recently updated time in subtree?
cout << ans << '\n';
}
// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
return 0;
}
Compilation message
construction.cpp: In function 'int32_t main()':
construction.cpp:242:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen ("input.in", "r", stdin);
~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
construction.cpp:243:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen ("output.out", "w", stdout);
~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
2808 KB |
Output is correct |
| 2 |
Correct |
5 ms |
3052 KB |
Output is correct |
| 3 |
Runtime error |
9 ms |
5816 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
2808 KB |
Output is correct |
| 2 |
Correct |
5 ms |
3052 KB |
Output is correct |
| 3 |
Runtime error |
9 ms |
5816 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
2808 KB |
Output is correct |
| 2 |
Correct |
5 ms |
3052 KB |
Output is correct |
| 3 |
Runtime error |
9 ms |
5816 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 4 |
Halted |
0 ms |
0 KB |
- |
